Constrained delaunay triangulations

Proceedings of the 3rd Annual Symposium on Computational Geometry, SCG 1987

Volumn , Issue , 1987, Pages 215-222

  Chew, L Paul ^a  

^a DARTMOUTH COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; FINITE ELEMENT METHOD; MOTION PLANNING; ROAD CONSTRUCTION; SURVEYING;

CONSTRAINED DELAUNAY TRIANGULATION; CONSTRAINED DELAUNAY TRIANGULATIONS; DELAU-NAY TRIANGULATIONS; DIVIDE-AND-CONQUER TECHNIQUE; EUCLIDEAN MINIMUM SPANNING TREES; NON-CROSSING EDGES; SPANNING TREE;

TRIANGULATION;

EID: 85029375384     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/41958.41981     Document Type: Conference Paper

References (9)

1. L. P. Chew and R. L. Drysdale, Voronoi diagrams based on convex distance functions, Proceedings of the 1st Symposium on Computational Geometry, Baltimore (1985), 235-244. (Revised version submitted to Discrete and Computational Geometry.)
2. L. P. Chew, There is a planar graph almost as good as the complete graph, Proceedings of the Second Annual Symposium on Computational Geometry, Yorktown Heights (1986), 169-177.
3. L. P. Chew, Planar graphs and sparse graphs for efficient motion planning in the plane, manuscript.
4. S. Fortune, A sweepline algorithm for Voronoi diagrams, Proceedings of the Second Annual Symposium on Computational Geometry, Yorktown Heights (1986), 313-322.
5. D. G. Kirkpatrick, Efficient computation of continuous skeletons, Proceedings of the 20th Annual Symposium on the Foundations of Computer Science, IEEE Computer Society (1979), 18-27.
6. D. T. Lee, Proximity and reachability in the plane, Technical Report R-831, Coordinated Science Laboratory, University of Illinois (1978).
7. D. T. Lee and B. Schachter, Two algorithms for constructing Delaunay triangulations, International Journal of Computer and Information Sciences, 9:3 (1980), 219-242.
8. F. P. Preparata and M. I. Shamos, Computational Geometry, Springer-Verlag (1985).
9. C. K. Yap, An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments, Technical Report, Courant Institute, New York University (Oct. 1984).