Hierarchical triangulation using cartographic coherence
CVGIP: Graphical Models and Image Processing
A note on minimal length polygonal approximation to a digitized contour
Communications of the ACM
A Pyramidal Data Structure for Triangle-Based Surface Description
IEEE Computer Graphics and Applications
Automatic extraction of Irregular Network digital terrain models
SIGGRAPH '79 Proceedings of the 6th annual conference on Computer graphics and interactive techniques
Automatic generation of triangular irregular networks using greedy cuts
VIS '95 Proceedings of the 6th conference on Visualization '95
| Hi-index | 0.00 |
Triangulated irregular networks (TINs) are an attractive form of surface approximation because triangle vertices and edges may be adaptively selected to produce a good fit with a minimal number of triangles. Finding methods for selecting these vertices and edges, however, is still an active area of research. Numerous refinement algorithms have been proposed, but these may produce more triangles than necessary. In this paper we present an algorithm that attempts to improve a triangulation by shifting the vertices so that curvature within the triangles is nearly equal. In addition, unnecessary triangles are removed. We finish with results produced by running this algorithm on simple geometric surfaces and real terrain data.