Sciweavers

102291 search results - page 163 / 20459
» Computability in Computational Geometry
Sort
View
IMR
2003
Springer
15 years 10 months ago
BSP-Assisted Constrained Tetrahedralization
In this paper we tackle the problem of tetrahedralization by breaking non-convex polyhedra into convex subpolyhedra, tetrahedralizing these convex subpolyhedra and merging them to...
Bhautik Joshi, Sébastien Ourselin
IMR
1998
Springer
15 years 9 months ago
Reliable Whisker Weaving via Curve Contraction
Whisker Weaving is an advancing front algorithm for all-hexahedral mesh generation. It uses global information derived from grouping the mesh dual into surfaces, the STC, to constr...
Nathan T. Folwell, Scott A. Mitchell
COMPGEOM
2006
ACM
15 years 11 months ago
Complete subdivision algorithms, I: intersection of Bezier curves
We give the first complete subdivision algorithm for the intersection of two Bezier curves F, G, possibly with tangential intersections. Our approach to robust subdivision algori...
Chee-Keng Yap
SIGGRAPH
2000
ACM
15 years 9 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...
152
Voted
SIGGRAPH
1992
ACM
15 years 9 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 ...
« Prev « First page 163 / 20459 Last » Next »