Sciweavers

3025 search results - page 185 / 605
» Computational geometry: a retrospective
Sort
View
SIGGRAPH
2000
ACM
15 years 11 months ago
Normal meshes
Normal meshes are new fundamental surface descriptions inspired by differential geometry. A normal mesh is a multiresolution mesh where each level can be written as a normal offse...
Igor Guskov, Kiril Vidimce, Wim Sweldens, Peter Sc...
SIGGRAPH
1992
ACM
15 years 10 months ago
Surface reconstruction from unorganized points
We describe and demonstrate an algorithm that takes as input an unorganized set of points fx1; : : : ; xng IR3 on or near an unknown manifold M, and produces as output a simplicia...
Hugues Hoppe, Tony DeRose, Tom Duchamp, John Alan ...
WAE
2000
95views Algorithms» more  WAE 2000»
15 years 7 months ago
Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves
Given a collection C of curves in the plane, the arrangement of C is the subdivision of the plane into vertices, edges and faces induced by the curves in C. Constructing arrangemen...
Iddo Hanniel, Dan Halperin
SIAMDM
2008
90views more  SIAMDM 2008»
15 years 6 months ago
The Nine Morse Generic Tetrahedra
From computational geometry comes the notion of a Gabriel graph of a point set in the plane. The Gabriel graph consists of those edges connecting two points of the point set such t...
D. Siersma, M. van Manen
COMPGEOM
2004
ACM
15 years 12 months ago
The number of lines tangent to arbitrary convex polyhedra in 3D
We prove that the lines tangent to four possibly intersecting convex polyhedra in   3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
Hervé Brönnimann, Olivier Devillers, V...