Sciweavers

59 search results - page 8 / 12
» An Algorithm for Polygon Subdivision Based on Vertex Normals
Sort
View
SMI
2007
IEEE
208views Image Analysis» more  SMI 2007»
14 years 1 months ago
A Partition-of-Unity Based Algorithm for Implicit Surface Reconstruction Using Belief Propagation
In this paper, we propose a new algorithm for the fundamental problem of reconstructing surfaces from a large set of unorganized 3D data points. The local shapes of the surface ar...
Yi-Ling Chen, Shang-Hong Lai
FOCS
1997
IEEE
13 years 11 months ago
The Computational Complexity of Knot and Link Problems
We consider the problem of deciding whether a polygonal knot in 3dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that...
Joel Hass, J. C. Lagarias, Nicholas Pippenger
COMGEO
1999
ACM
13 years 7 months ago
Multiresolution hierarchies on unstructured triangle meshes
The use of polygonal meshes for the representation of highly complex geometric objects has become the de facto standard in most computer graphics applications. Especially triangle...
Leif Kobbelt, Jens Vorsatz, Hans-Peter Seidel
COMPGEOM
2011
ACM
12 years 11 months ago
Deconstructing approximate offsets
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
Eric Berberich, Dan Halperin, Michael Kerber, Roza...
WSCG
2003
152views more  WSCG 2003»
13 years 9 months ago
Mesh Simplification Based on Shading Characteristic
Mesh simplification is a key research area in scientific visualizationand virtual reality. The paper presents a new method of polyhedral model simplification based on vision chara...
Hui Zhang, Huazhong Shu, Limin Luo