Two algorithms for constructing a Delaunay triangulation

International Journal of Computer & Information Sciences

Volumn 9, Issue 3, 1980, Pages 219-242

  Lee, D T ^a   Schachter, B J ^b  

^a NORTHWESTERN UNIVERSITY   (United States)

^b GENERAL ELECTRIC COMPANY   (United States)

Author keywords

analysis of algorithms; computational geometry; Delaunay triangulation; divide and conquer; triangulation; Voronoi tessellation

Indexed keywords

EID: 0000029675     PISSN: 00917036     EISSN: 15737640     Source Type: Journal    
DOI: 10.1007/BF00977785     Document Type: Article

References (37)

1. Spatial interaction and the statistical analysis of lattice systems
2. The Structure of the Metropolitan Community
3. Triangulating a simple polygon
4. Random subdivision of space into crystals
5. Computing Dirichlet tesselations in the plane
6. Random fragmentation in two and three dimensions
7. Software for C1 surface interpolation
8. Proximity and Reachability in the Plane
9. Triangulation of planar regions with applications
10. Spatial variation
11. Two dimensional interpolation from random data
12. Solution to problem 67-15 (Probability distribution of a network of triangles)
13. On the homogeneous planar Poisson point-process
14. Packing of congruent spheres in a strip
15. A triangulation algorithm for arbitrary planar domains
16. Piecewise quadratic approximations on triangles
17. Convex hulls of finite sets of points in two and three dimensions
18. Analytic delineation of Thiessen polygons
19. Random mosaic models for textures
20. Decomposition of polygons into convex sets
21. Locally equiangular triangulations
22. Probability distribution of a network of triangles (Problem 67-15)
23. Reconstructing patterns from sampled data
24. Precipitation averages for large areas
25. Nouvelles applications des parametres continus à la théorie des formes quadratiques. Deuxième Mémoire: Recherches sur les parallelloedres primitifs