PL
 |
EN
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 11

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available On streamwise structures in boundary layer under adverse pressure gradient on inclined plate
Uruba V., Prochazka P., Skala V.
TASK Quarterly : scientific bulletin of Academic Computer Centre in Gdansk
|
2018
|
Vol. 22, No 3
255--267
EN
The presented study is focused on experimental investigation of a boundary layer on a flat plate in an adverse pressure gradient. The flat plate is placed in a regular flow, the pressure gradient is generated by the plate inclination. The preceding studies deal with the structure of the wake behind the plate, the presented study concentrates on the flow structureclose to the suction surface of the plate. The dynamical behavior of the flow structures is studied in details with respect to the topology in the streamwise direction. In spite of the fact that thetime-mean flow field is close to 2D, more or less constant along the span, the instantaneous structures topology is fully 3D. Rather oblique structures are detected instead of those oriented in the streamwise direction. The patterns are travelling in the streamwise direction along the plate.
2
Surface construction from orthogonal slices (English)
Svitak R., Skala V.
Zeszyty Naukowe. Geometria i Grafika Inżynierska / Politechnika Śląska
|
2004
|
z. 6
49-52
EN
This paper is concerned with the problem of reconstructing surfaces of 3D objects, given mutually orthogonal sets of planar parallel slices representing cross sections through the objects. Our proposal of solution is presented and its properties plus some results are discussed.
PL
Praca ta zajmuje się problemami rekonstrukcji powierzchni obiektów 3D w oparciu o odpowiednio wybrane prostopadłe i równoległe przekroje tegoż obiektu 3D. W opracowaniu przedstawiono pewne propozycje rozwiązania problemu, cechy i wyniki badań.
3
Isosurface vertex normal computation
Jirka T., Skala V.
Zeszyty Naukowe. Geometria i Grafika Inżynierska / Politechnika Śląska
|
2004
|
z. 6
27-32
EN
This paper discusses the use of scalar field's gradients for computing normal vectors in the vertices of such field's isosurfaces. Three schemes for the gradient vector estimation arę compared with respect to their accuracy and thus their influence on the Gouraud shaded isosurface appearance.
PL
W artykule omówiono użycie gradientu pola skalarnego do obliczania wektora normalnego w wierzchołkach pól izopowierzchni. Schematyczne drzewo dla gradientu wektora oszacowane jest z uwzględnieniem jego dokładności i tym samym wpływu na cieniowania na typy Gourauda izopowierzchni.
4
Detection of sharp edges during polygonization of implicit surfaces by the edge spinning
Cermak M., Skala V.
Zeszyty Naukowe. Geometria i Grafika Inżynierska / Politechnika Śląska
|
2004
|
z. 6
5-8
EN
This paper presents an algorithm for detection of sharp edges during polygonization of implicit surfaces by the Edge spinning method.
PL
Praca ta przedstawia algorytm wykrywania ostrych krawędzi w procesie poligonizacji powierzchni danych niejawnie za pomocą obracania krawędzi.
5
A survey of method for implicitization of polygonal model
Uhlir K., Skala V.
Zeszyty Naukowe. Geometria i Grafika Inżynierska / Politechnika Śląska
|
2004
|
z. 6
61-70
EN
This paper describes a method for the representation of the polygonal model or model defined by the point-cloud data with the implicit function. i The basie aspects of the method based on representation of the model with a Radial o Basis Functions (RBFs) arę analyzed.
PL
Artykuł ten opisuje metodę reprezentacji modelu wielokątnego i modelu zdefiniowanego za pomocą danych w postaci chmury punktów z funkcją. Przeanalizowane zostały podstawowe aspekty metody oparte na vieniu modelu z funkcjami podstawy promienia (RBFs).
6
Content available remote A robust technique for surface reconstruction from orthogonal slices
Sviták R., Skala V.
Machine Graphics and Vision
|
2004
|
Vol. 13, No. 3
221-233
EN
The problem of surface reconstruction from sets of planar slices representing cross sections through 3D objects is presented. The final result of surface reconstruction is always based on the correct estimation of the structure of the original object and on the visual quality of the resultant surface. This paper is a case study of the structure reconstruction and the surface formation problems. We present a new approach, which is based on considering mutually orthogonal sets of slices. A new method for surface reconstruction from orthogonal slices is described, and the benefit of orthogonal slices is also discussed. The properties and sample results are presented as well. Key words: surface reconstruction, orthogonal slices, orthogonal cross-sections, contour correspondence.
7
Content available remote A comparison of fundamental methods for iso surface extraction
Patera J., Skala V.
Machine Graphics and Vision
|
2004
|
Vol. 13, No. 4
329-343
EN
This paper compares four fundamental methods for iso surface extraction based on cell decomposition to tetrahedra. The methods are compared both on mathematically generated data sets as well as on real data sets. The comparison using mathematical data is made from different points of view such, as area approximation, or volume approximation. On the other hand, the Hausdorff distance and the root mean square are used to compare methods on real data sets. The presented comparison can be of help when deciding which of the tested methods to choose, as well as when we need to compare a newly developed method with other existing approaches.
8
Content available A survey of methods for 3D model feature extraction
Hlavaty T., Skala V.
Journal Biuletyn of Polish Society for Geometry and Engineering Graphics
|
2003
|
Vol. 13
5--8
EN
This paper deals with problems that are related to a feature extraction from 3D objects. The main aim of the feature extraction is to describe a shape of 3D object by a feature vector. Then the elements of this feature vector characterize the shape of the own 3D objects and they can serve as a key in searching for similar models. In this paper are introduced current methods for the feature extraction of 3D models and their classification. These methods are based on different mathematical background and according to that they are separated into several groups.
9
Content available remote Two new algorithms for line clipping in E² and their comparison
Skala V., Hui B. D.
Machine Graphics and Vision
|
2000
|
Vol. 9, No. 1/2
297-306
EN
New efficient algorithms for the line clipping by the given rectangle in E² are presented. The first algoritm is based on the line direction evaluation the second one is based on a new coding technique of clipping rectangle's vertices. It allows solving all cases more effectively. A comparison of the proposed algorithms with the Liang-Barsky algorithm and some experimental results are presented, too.
10
Content available remote Two methods for iso-surface extraction from vlumetric data and their comparison
Skala V., Brusi A.
Machine Graphics and Vision
|
2000
|
Vol. 9, No. 1/2
149-166
EN
There are various methods for extracting iso-surfaces from volumetric data. Marching cubes or tetrahedra or raytracing methods are mostly used. There are many specific techniques to increase speed of computation and decrease memory requirements. Although a precision of iso-surface extraction is very important, too, it is not mentioned usually. A comparison of the selected method was made in different aspects: iso-surface extraction process time, number of triangles generated and estimation of radius, area and volume errors based on approximation of a sphere. Surprisingly, experiments proved that there is no direct relation between precision of extracted and human perception of the extracted iso-surface.
11
Content available remote Faster algorithm for line clipping against a pyramid in E³
Skala V., Bui D. H.
Machine Graphics and Vision
|
2000
|
Vol. 9, No. 4
841-850
EN
A new algorithm for line clipping against a pyramid in E³ is presented. The suggested algorithm is based on the use of a separation function and avoids conmputation of intersection points that are not endpoints of the output line segment. It also allows to solved all cases more effictively. The performance of this algorithm is shown to be consistently better than the traditional Liang-Barsky's algorithm for line clipping in E³. Experimental are also presented.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.