Hierarchical triangulation using cartographic coherence
Authors:
- Lori ScarlatosLSLori Scarlatos
- Theo PavlidisTPTheo Pavlidis
- 1 March 1992
- journal article
- Published by Elsevier in CVGIP: Graphical Models and Image Processing
- Vol. 54 (2) , 147-161
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- A fast las vegas algorithm for triangulating a simple polygonDiscrete & Computational Geometry, 1989
- Nonobtuse triangulation of polygonsDiscrete & Computational Geometry, 1988
- EXPERIMENTS TO LOCATE RIDGES AND CHANNELS TO CREATE A NEW TYPE OF DIGITAL ELEVATION MODELCartographica, 1986
- Two-Dimensional Critical Point Configuration GraphsIEEE Transactions on Pattern Analysis and Machine Intelligence, 1984
- Systematic triangulationsComputer Vision, Graphics, and Image Processing, 1984
- Triangulating Simple Polygons and Equivalent ProblemsACM Transactions on Graphics, 1984
- The Radial Sweep Algorithm for Constructing Triangulated Irregular NetworksIEEE Computer Graphics and Applications, 1982
- Neither the greedy nor the delaunay triangulation of a planar point set approximates the optimal triangulationInformation Processing Letters, 1979
- Triangulating a simple polygonInformation Processing Letters, 1978
- Detection of Surface-Specific Points by Local Parallel Processing of Discrete Terrain Elevation DataComputer Graphics and Image Processing, 1975