SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
A data reduction scheme for triangulated surfaces
Computer Aided Geometric Design
Multiresolution surface modeling based on hierarchical triangulation
Computer Vision and Image Understanding
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Simplification of Irregular Surface Meshes in 3D Medical Images
CVRMed '95 Proceedings of the First International Conference on Computer Vision, Virtual Reality and Robotics in Medicine
Invited Lecture: Interactive Exploration of Distributed 3D Databases over the Internet
CGI '98 Proceedings of the Computer Graphics International 1998
Quadric-based polygonal surface simplification
Quadric-based polygonal surface simplification
| Hi-index | 0.00 |
We describe a method to approximate a closed surface triangulation using simulated annealing. Our approach guarantees that all vertices and triangles in an approximating surface triangulation are within user-defined distance of the original surface triangulation. We introduce the idea of atomic envelopes to guarantee error bounds that are independent of the surface geometry. Atomic envelopes also allow approximation distance to be different for different parts of the surface. We start with the original triangulation and perturb it randomly and improve an approximating triangulation by locally changing the triangulation, using a simulated annealing algorithm. Our algorithm is not restricted to using only original vertices; the algorithm considers every point inside the envelope triangulation as a possible position. The algorithm attempts to minimize the total number of vertices needed to approximate the original surface triangulation within the prescribed error bound.