Hamiltonian triangulations for fast rendering

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

Volumn 855 LNCS, Issue , 1994, Pages 36-47

  Arkin, Esther M ^a   Held, Martin ^a,b   Mitchell, Joseph S B ^a   Skiena, Steven S ^a  

^a STONY BROOK UNIVERSITY   (United States)

^b UNIVERSITY OF SALZBURG   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

HAMILTONIANS; TRIANGULATION;

DATA RATES; DUAL GRAPHS; HAMILTONIAN PATH; RENDERING ENGINE;

RENDERING (COMPUTER GRAPHICS);

EID: 84955561809     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0049395     Document Type: Conference Paper

References (20)

1. D. Avis and H. ElGindy. Triangulating point sets in space. Discrete Comput. Geom., 2:99-111, 1987.
2. M. Bern and D. Eppstein. Mesh generation and optimal triangulation. In D.-Z. Du and F. K. Hwang, editors, Computing in Euclidean Geometry, LNCS Vol. 1, pp. 23-90. World Scientific, Singapore, 1992.
3. R. Cassidy, E. Gregg, R. Reeves, and J. Turmelle. IGL: The graphics library for the i860, March 22, 1991.
4. N. Christofides. Worst-case analysis of a new heuristic for the traveling salesman problem. In J. F. Traub, editor, Sympos. on New Directions and Recent Results in Algorithms and Complexity, page 441, New York, NY, 1976. Academic Press.
5. H. Crapo and J-P. Laumond. Hamiltonian cycles in Delaunay complexes. Geometry and Robotics Workshop Proceedings, Springer-Verlag LNCS Vol. 391, pp. 292-305, 1989.
6. G. Das, P. Heffernan, and G. Narasimhan. LR-Visibility in polygons. In Proc. 5th Canad. Conf. Comput. Geom., pages 303-308, Waterloo, Canada, 1993.
7. M. B. Dillencourt. A non-Hamiltonian, nondegenerate Delaunay triangulation. Inform. Process. Lett, 25:149-151, 1987.
8. M. B. Dillencourt. Hamiltonian cycles in planar triangulations with no separating triangles. J. Graph Theory, 14:31-49, 1990.
9. M. B. Dillencourt. Finding Hamiltonian cycles in Delaunay triangulations is NP-complete. In Proc. 4th Canad. Conf. Comput. Geom., pages 223-228, 1992.
10. M. Garey, D. Johnson, and R. Tarjan. The planar Hamiltonian circuit problem is NP-complete. SIAM J. Computing, 5:704-714, 1976.
11. F. Gray. Pulse code communication. United States Patent Number 2,632,058, March 17, 1953.
12. J. Hershberger. An optimal visibility graph algorithm for triangulated simple polygons. Algorithmica, 4:141-155, 1989.
13. J. O'Rourke, H. Booth, and R. Washington. Connect-the-dots: a new heuristic. Comput. Vision Graph. Image Process., 39:258-266, 1987.
14. N. Prabhu. Hamiltonian simple polytopes. Technical Report 90-17, DIMACS, Rutgers Univ., 1990.
15. C. Savage. Gray code sequences of partitions. J. Algorithms, 10:577-595, 1989.
16. T. Shermer, private communication, April 1994.
17. Silicon Graphics, Inc. Graphics library programming guide, 1991.
18. L. H. Tseng and D. T. Lee, “Two-Guard Walkability of Simple Polygons”, manuscript, 1992.
19. H. Wilf. Combinatorial Algorithms: An Update. Society for Industrial and Applied Mathematics, Philadelphia, 1989.
20. M. Yvinec. Triangulation in 2D and 3D space. Geometry and Robotics Workshop Proceedings, Springer-Verlag LNCS Vol. 391, pp. 275-291, 1989.