Linear-time reconstruction of delaunay triangulations with applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1284, Issue , 1997, Pages 459-471

  Snoeyink, Jack ^a   van Kreveldt, Marc ^b  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; DATA STRUCTURES; GRAPHIC METHODS;

CONSTRAINED VORONOI DIAGRAMS; DELAU-NAY TRIANGULATIONS; GEOMETRIC DATA; GEOMETRIC STRUCTURE; INCREMENTAL ALGORITHM; MODEL-BASED OPC; PLANAR GRAPH; TERRAIN MODEL;

TRIANGULATION;

EID: 84949235808     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63397-9_35     Document Type: Conference Paper

References (23)

1. Franz Aurenhammer. Voronoi diagrams-A survey of a fundamental geometric data structure. ACM Computing Surveys, 23(3):345-405, 1991.
2. Marshall Bern and David Eppstein. Mesh generation and optimal triangulation. In F. K. Hwang and D.-Z. Du, editors, Computing in Euclidean Geometry. World Scientific, March 1992.
3. Norishige Chiba, Takao Nishizeki, and Nobuji Saito. A linear 5-coloring algorithm of planar graphs. Journal of Algorithms, 2:317-327, 1981.
4. M. de Berg, M. van Kreveld, E. van Oostrum, and M. Overmars. Simple traversal of a subdivision without extra storage, Int. J. of CIS, 11, 1997.
5. M. Deering. Geometry compression. Computer Graphics, pages 13-20, 1995. Proceedings of SIGGRAPH '95.
6. H. Djidjev and A. Lingas. On computing the Voronoi diagram for restricted planar figures. In WADS '91: Second Workshop on Data Structures and Algorithms, number 519 in Lecture Notes in Computer Science, pages 54-64. Springer-Verlag, 1991.
7. Herbert Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, Berlin, 1987.
8. Herbert Edelsbrunner and Ernst Peter Mucke. Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Graphics, 9(1):66-104, 1990.
9. Michael T. Goodrich and Roberto Tamassia. Dynamic trees and dynamic point location. In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, pages 523-533, 1991. To appear in SIAM Journal on Computing, 1997.
10. L. J. Guibas, D. E. Knuth, and M. Sharir. Randomized incremental construction of Delaunay and Voronoi diagrams. Algorithmica, 7:381-413, 1992.
11. Leonidas Guibas and Jorge Stolfi. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams. ACM Transactions on Graphics, 4(2):74-123, 1985.
12. H. Hoppe. Progressive meshes. Computer Graphics, pages 99-108, 1996. Proceedings of SIGGRAPH '96.
13. D. Kirkpatrick. Optimal search in planar subdivisions. SIAM Journal on Computing, 12:28-35, 1983.
14. D. T. Lee and P. P. Prepaxata. Computational geometry: a survey. IEEE Trans. Comput., 0-33:1072-1101, 1984.
15. Ketan Mulmuley. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice-Hall, Englewood Cliffs, N.J., 1993.
16. Atsuyuki Okabe, Barry Boots, and Kokichi Sugihara. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. John Wiley & Sons, 1992.
17. Joseph O’Rourke. Computational Geometry in C. Cambridge University Press, 1994.
18. T. K. Peucker, R. J. Fowler, J. J. Little, and D. M. Mark. The triangulated irregular network. In Amer. Soc. Photogrammetry Proc. Digital Terrain Models Symposium, pages 516-532, 1978.
19. Franco P. Preparata and Michael I. Shamos. Computational Geometry-An Introduction. Springer-Verlag, New York, 1985.
20. Neil Robertson, Daniel P. Sanders, Paul Seymour, and Robin Thomas. Efficiently four-coloring planar graphs. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pages 571-575, 1996.
21. R. Seidel. Backwards analysis of randomized geometric algorithms. In J. Pach, editor, New Trends in Discrete and Computational Geometry, volume 10 of Algorithms and Combinatorics, pages 37-68. Springer-Verlag, 1993.
22. Raimund Seidel. A method for proving lower bounds for certain geometric problems. In Godfried T. Toussaint, editor, Computational Geometry, pages 319-334. North Holland, Amsterdam, 1985.
23. Cao An Wang and Francis Chin. Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear time. In Paul Spirakis, editor, Algorithms-ESA '95, number 979 in Lecture Notes in Computer Science, pages 280-294. Springer-Verlag, 1995.