Another proof of polynomial-time recognizability of delaunay graphs

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E83-A, Issue 4, 2000, Pages 627-638

  Hiroshima, Tetsuya ^a,b   Miyamoto, Yuichiro ^a   Sugihara, Kokichi ^a  

^a UNIVERSITY OF TOKYO   (Japan)

^b JAPAN DEFENSE AGENCY   (Japan)

Author keywords

Delaunay diagram; Delaunay graph; Graph recognition; Linear programming; Voronoi diagram

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; POLYNOMIALS; THEOREM PROVING;

DELAUNAY GRAPH; DELAUNAY TRIANGULATION; POLYNOMIAL-TIME ALGORITHMS;

GRAPH THEORY;

EID: 0033701929     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (29)

1. A.V. Aho, J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
2. P.F. Ash and E.D. Volker, "Recognizing Dirichlet tessellations," Geometriae Dedicata, vol.19, pp.175-206, 1985.
3. F. Aurenhammer, "Recognizing polytopical cell complexes and constructing projection polyhedra," Journal of Symbolic Computation, vol.3, pp.249-255, 1987.
4. F. Aurenhammer, "Voronoi diagram - A survey of a fundamental geometric data structure," ACM Computing Surveys, vol.23, pp.345-405, 1991.
5. M.B. Dillencourt, "A non-Hamiltonian nondegenerate Delaunay triangulation," Information Processing Letters, vol.25, pp.149-151, 1987.
6. M.B. Dillencourt, "Toughness and Delaunay triangulations," Discrete and Computational Geometry, vol.5, pp.575-601, 1990.
7. M.B. Dillencourt, "Realizability of Delaunay triangulations," Information Processing Letters, vol.33, pp.283-287, 1990.
8. M.B. Dillencourt and W.D. Smith, "A linear-time algorithm for testing the inscribability of trivalent polyhedra," International Journal of Computational Geometry and Applications, vol.5, pp.21-36, 1995.
9. H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, Berlin, 1987.
10. H. Edelsbrunner, "The computational geometry column," EATCS (European Association for Theoretical Computer Science) Bulletin, vol.37, pp. 109-116, 1988.
11. D. Hartvigsen, "Recognizing Voronoi diagrams with linear programming," ORSA Journal on Computing, vol.4, pp.369-374, 1992.
12. T. Hiroshima, "Recognizing Delaunay graphs," Master's Dissertation, Department of Mathematical Engineering and Information Physics of the University of Tokyo, 1994.
13. C.D. Hodgson, I. Rivin, and W.D. Smith, "A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere," Bulletin of the American Mathematical Society, vol.27, pp.246-251, 1992.
14. idem, Erratum, ibid., vol.28, p.13, 1993.
15. N. Karmarkar, "A new polynomial-time algorithm for linear programming," Combinatorica, vol.4, pp.373-395, 1984.
16. L.G. Khachian, "Polynomial algorithms in linear programming," USSR Computational Mathematics and Mathematical Physics, vol.20, pp.53-72, 1980.
17. N.E. Mnev, "The universality theorems on the classification problem of configuration varieties and convex polytope varieties," in Topology and Geometry-Rohlin Seminar, Lecture Notes in Mathematics, vol.1340, ed. O.T. Viro, pp.527-543, Springer Verlag, 1989.
18. Y. Oishi and K. Sugihara, "Topology-oriented divide-and-conquer algorithm for Voronoi diagrams," Computer Vision, Graphics, and Image Processing: Graphical Models and Image Processing, vol.57, pp.303-314, 1995.
19. A. Okabe, B. Boots, and K. Sugihara, Spatial Tessellations - Concepts and Applications of Voronoi Diagrams, John Wiley and Sons, London, 1992.
20. F.P. Preparata and M.I. Shamos, Computational Geometry - An Introduction, Springer-Verlag, New York, 1985.
21. I. Rivin, "Euclidean structures on simplicial surfaces and hyperbolic volume," Annals of Mathematics, vol.139, pp.553-580, 1994.
22. I. Rivin, "A characterization of ideal polyhedra in hyperbolic 3-space," Annals of Mathematics, vol.143, pp.51-70, 1996.
23. M.I. Shamos, Computational Geometry, Ph.D. Dissertation, Yale University, New Haven, 1978.
24. P.W. Shor, "Stretchability of pseudolines is NP-hard," in DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.4, eds. P. Gritzmann and B. Strumfels, pp.531-554, 1991.
25. R. Sibson, "Locally equiangular triangulation," The Computer Journal, vol.21, pp.243-245, 1978.
26. K. Sugihara, "Simpler proof of a realizability theorem on Delaunay triangulations," Information Processing Letters, vol.50, pp.173-176, 1994.
27. K. Sugihara and M. Iri, "Construction of the Voronoi diagram for "one million"generators in single-precision arithmetic," Proc. IEEE, vol.80, pp. 1471-1484, 1992.
28. K. Sugihara and M. Iri, "A robust topology-oriented incremental algorithm for Voronoi diagrams," International Journal of Computational Geometry and Applications, vol.4, pp. 179-228, 1994.
29. A. Suzuki and M. Iri, "Approximation of a tessellation of the plane by a Voronoi diagram," Journal of the Operations Research Society of Japan, vol.29, pp.69-97, 1986.