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
Constructing Hierarchies for Triangle Meshes
IEEE Transactions on Visualization and Computer Graphics
Delaunay Triangulation in Three Dimensions
IEEE Computer Graphics and Applications
An efficient algorithm for the compression of time-dependent data from scientific simulations
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartI
| 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 relies on distance as 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 gives more information for deciding the removal of a vertex than the conventional distance measure, the proposed algorithm can approximate the surface with less computation. The height of a triangle that the pair of edges fonns is also used as an additional constraint. The computational overload can thus be greatly reduced to linear scale from the exponential scale of the conventional algorithms while yielding a comparable error level.