Short-cuts on Star, Source and Planar Unfoldings

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

Volumn 3328, Issue , 2004, Pages 174-185

  Chandru, Vijay ^a   Hariharan, Ramesh ^a   Krishnakumar, Narasimha M ^a  

^a INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY; GRAPH THEORY; SOFTWARE ENGINEERING;

ADDITIONAL STRUCTURES; CONDITION; CONVEX POLYHEDRONS; END-POINTS; EXTENDED SOURCES; PROPERTY; SHORT-PATH; SHORTEST PATH ALGORITHMS; TWO-POINT; UNFOLDINGS; END POINTS; OUTPUT-SENSITIVE; SHORTEST PATH;

STARS;

EID: 35048878186     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30538-5_15     Document Type: Article

References (14)

1. A. D. Aleksandrov and V. A. Zalgaller, Intrinsic Geometry of Surfaces, American Mathematical Society, Providence, RI, 1967.
2. H. Buseman, Convex Surfaces, Interscience Publishers, 1958.
3. M. Sharir and A. Schorr, On shortest paths in polyhedral spaces, SIAM J. Comput.,15(1986), pp.193-215.
4. C. Schevon and J. O'Rourke, The number of maximal edge sequences on a convex polytope, In Proc. 26th Allerton Conf. Commun. Control Comput., pages 49-57, October 1988.
5. C. Schevon, Algorithms for geodesics on polytopes, PhD thesis, Johns Hopkins University, 1989.
6. J. Mitchell, D. M. Mount, and C. H. Papadimitriou, The discrete geodesic problem, SIAM Journal on Computing, 16(4):647-668, August 1987.
7. M. Sharir, On shortest paths amidst convex polyhedra, SIAM Journal on Computing, 16(3):561-572, June 1987.
8. D. M. Mount, The number of shortest paths on the surface of a polyhedron, SIAM Journal on Computing, 19(4):593-611, August 1990.
9. P.K. Agarwal, B. Aronov, J. O'Rourke and C. Schevon, Star Unfolding of a polytope with applications, in Proc. of 2nd Annual Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science,447, Springer-Verlag,Berlin,1990,pp.251-263.
10. B. Aronov and J. O'Rourke, Non-overlap of the Star Unfolding, Discrete Comput. Geom.,8(1992).pp. 219-250.
11. J. Chen and Y. Han, Shortest paths on a polyhedron, in Proc. 6th Annual ACM Sympos. Comput. Geom., ACM,New York, 1990, pp.360-369.
12. P. K. Agarwal, B. Aronov, J. O'Rourke, Catherine A. Schevon, Star Unfolding of a Polytope with Applications, SIAM J. Comput. 26(6): 1689-1713 (1997).
13. V. Chandru, N. Krishnakumar, R. Hariharan, Properties of Planar Unfoldings, Manuscript under preparation.
14. N. Krishnakumar Properties of Short-Cuts, PhD Thesis, IISc, 2003.