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
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
Surface simplification using quadric error metrics
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Control of polygonal mesh resolution for 3-D computer vision
Graphical Models and Image Processing
Convexity rule for shape decomposition based on discrete contour evolution
Computer Vision and Image Understanding
Constructing Hierarchies for Triangle Meshes
IEEE Transactions on Visualization and Computer Graphics
Delaunay Triangulation in Three Dimensions
IEEE Computer Graphics and Applications
| Hi-index | 0.00 |
This paper presents a novel technique for simplifying a triangulated surface at different levels of resolution. While most existing algorithms, based on iterative vertex decimation, employ the distance for error metric, the proposed algorithm utilizes an edge criterion for removing a vertex. An interior angle of a vertex is defined as the maximum value of all possible angles formed by combinations of edges connected to a vertex. Since the surface curvature examined with the interior angle provides more information for decision of vertex removal than the conventional distance measure, the proposed algorithm can approximate the surface with less computation. The height of a triangle, which is formed by the pair of edges, is also used for an additional constraint. The computational complexity can thus be greatly alleviated to logarithmic scale from the exponential scale required for the conventional algorithms, while yielding the comparable error level.