12 search results - page 1 / 3 » Provably Good Surface Sampling and Approximation |
SGP
2003
13 years 6 months ago
2003
We present an algorithm for meshing surfaces that is a simple adaptation of a greedy “farthest point” technique proposed by Chew. Given a surface S, it progressively adds poin...
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
In the last decade, a great deal of work has been devoted to the elaboration of a sampling theory for smooth surfaces. The goal was to ensure a good reconstruction of a given surf...
SIGGRAPH
1998
ACM
13 years 9 months ago
1998
ACM
We describe our experience with a new algorithm for the reconstruction of surfaces from unorganized sample points in IR 3. The algorithm is the first for this problem with provab...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
We present a method to maintain a mesh approximating a deforming surface, which is specified by a dense set of sample points. We identify a reasonable motion model for which a pro...
DAGM
2006
Springer
13 years 9 months ago
2006
Springer
Existing methods for segmentation by edgel linking are based on heuristics and give no guarantee for a topologically correct result. In this paper, we propose an edgel linking algo...