Hierarchical triangulation using terrain features

This publication has 13 references indexed in Scilit:

• Nonobtuse triangulation of polygons
  Discrete & Computational Geometry, 1988
• A faster divide-and-conquer algorithm for constructing delaunay triangulations
  Algorithmica, 1987
• Computational Geometry
  Published by Springer Nature ,1985
• Triangulating Simple Polygons and Equivalent Problems
  ACM Transactions on Graphics, 1984
• A hierarchical structure for surface approximation
  Computers & Graphics, 1984
• The Radial Sweep Algorithm for Constructing Triangulated Irregular Networks
  IEEE Computer Graphics and Applications, 1982
• Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes
  The Computer Journal, 1981
• Automatic extraction of Irregular Network digital terrain models
  ACM SIGGRAPH Computer Graphics, 1979
• Neither the greedy nor the delaunay triangulation of a planar point set approximates the optimal triangulation
  Information Processing Letters, 1979
• Conversion of complex contour line definitions into polygonal element mosaics
  Published by Association for Computing Machinery (ACM) ,1978