Constrained Delaunay triangulation for multiresolution surface description
- 6 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Surface representations based on triangular gridsThe Visual Computer, 1987
- An optimal algorithm for constructing the Delaunay triangulation of a set of line segmentsPublished by Association for Computing Machinery (ACM) ,1987
- Constrained Delaunay triangulationsPublished by Association for Computing Machinery (ACM) ,1987
- Generalized delaunay triangulation for planar graphsDiscrete & Computational Geometry, 1986
- Delaunay-based representation of surfaces defined over arbitrarily shaped domainsComputer Vision, Graphics, and Image Processing, 1985
- Computational GeometryPublished by Springer Nature ,1985
- Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopesThe Computer Journal, 1981
- Triangulating a simple polygonInformation Processing Letters, 1978