Sampling and meshing a surface with guaranteed topology and geometry
Dey, Tamal K.
Ramos, Edgar A.
|Source||SIAM journal on computing, v. 37, (4), 2007, Sep, p. 1199-1227|
|Summary||This paper presents an algorithm for sampling and triangulating a generic C-2-smooth surface Sigma subset of R-3 that is input with an implicit equation. The output triangulation is guaranteed to be homeomorphic to Sigma. We also prove that the triangulation has well-shaped triangles, large dihedral angles, and a small size. The only assumption we make is that the input surface representation is amenable to certain types of computations, namely, computations of the intersection points of a line and Sigma, computations of the critical points in a given direction, and computations of certain silhouette points.|
|Rights||Copyright © SIAM. This paper is made available with permission of the Society for Industrial and Applied Mathematics for limited noncommerical distribution only.|
View full-text via DOI
View full-text via Web of Science
View full-text via Scopus
Files in this item: