Prohlížení dle Předmět výpočetní geometrie

Přejít na: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
nebo zadejte několik prvních písmen:  
Zobrazují se výsledky 1 až 15 z 15
Datum vydáníNázevAutor
2006A background-priority discrete boundary triangulation methodLoke, Robert Edward; Jansen, Frederik W.; du Buf, Hans
1998Computation and maintenance of visibility and shadows in the planeGhali, Sherif
2019Exit regions of cavities in proteinsMaňák, Martin; Anikeenko, Alexey; Kolingerová, Ivana
1998Genetic approach to the minimum weight triangulaitonKolingerová, I.
2020Kinetic locally minimal triangulation: theoretical evaluation and combinatorial analysisVomáčka, Tomáš; Kolingerová, Ivana; Maňák, Martin
2007Maintaining Sharp Features in Surface Construction for Volumetric ObjectsLoke, Robert Edward; Jansen, Frederik W.
1997Nibble meshing: an algorithm for triangulation of non-manifold solid boundaryMarcheix, David; Gueorguieva, Stefka
1997On the expected number of common edges in delaunay and greedy triangulationCho, Han-Gue
2019Pi-surfaces: products of implicit surfaces towards constructive composition of 3D objectsRaposo, Adriano N.; Gomes, Abel J.P.
2000Robust Incremental Polygon Triangulation for Fast Surface RenderingKumar, Subodh
2000Robust incremental polygon triangulation for surface renderingKumar, Subodh
1997A simple and efficient algorithm for sorting the intersection points between a Jordan curve and a lineSojka, Eduard
2007Upper and Lower Bounds on the Quality of the PCA Bounding BoxesDimitrov, Danko; Knauer, Christian; Kriegel, Klaus; Rote, Günter
2017Využití výpočetní geometrie pro modelování a vizualizaci proteinůMaňák, Martin
2010Walking location algorithms: technical report no. DCSE/TR-2010-03Soukal, Roman