Topological peeling and applications

International Journal of Computational Geometry and Applications

Volumn 13, Issue 2, 2003, Pages 135-172

  Chen, Danny Z ^a   Luan, Shuang ^a   Xu, Jinhui ^b  

^a University of Notre Dame   (United States)

^b the State University of New York   (United States)

Author keywords

Arrangement; Shortest path; Space efficient algorithms; Topological walk

Indexed keywords

EID: 0038367606     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195903001104     Document Type: Article

References (26)

1. A. Aggarwal, B. Schieber, and T. Tokuyama, "Finding a minimum weight k-link path in graphs with the concave Monge property and applications," Discrete & Computational Geometry, Vol. 12, 1994, pp. 263-280.
2. E.G. Anagnostou, L.J. Guibas, and V.G. Polimenis, "Topological sweeping in three dimensions," Lecture Notes in Computer Science, Vol. 450, Proc. International Symp. on Algorithms (SIGAL'90), Springer-Verlag, 1990, pp. 310-317.
3. E.M. Arkin, Y.-J. Chiang, M. Held, J.S.B. Mitchell, V. Sacristan, S.S. Skiena, and T.-C. Yang, "On minimum-area hulls," Algorithmica, Vol. 21, 1998, pp. 119-136.
4. T. Asano, L.J. Guibas, and T. Tokuyama, "Walking in an arrangement topologically," International Journal of Computational Geometry and Applications, Vol. 4, No. 2, 1994, pp. 123-151.
5. T. Asano and T. Tokuyama, "Topological walk revisited," Proc. 6th Canadian Conf. on Computational Geometry, 1994, pp. 1-6.
6. P. Bose, W. Evans, D. Kirkpatrick, M. McAllister, and J. Snoeyink, "Approximating shortest paths in arrangements of lines," Proc. 8th Canadian Conf. on Computational Geometry, 1996, pp. 143-148.
7. B. Chazelle, L.J. Guibas, and D.T. Lee, "The power of geometric duality," BIT, Vol. 25, 1985, pp. 76-90.
8. D.Z. Chen, O. Daescu, X.S. Hu, X. Wu, and J. Xu, "Determining an optimal penetration among weighted regions in two and three dimensions," Proc. 15th Annual ACM Symp. on Computational Geometry, pp. 322-331, 1999.
9. D.Z. Chen, O. Daescu, X.S. Hu, and J. Xu, "Finding an optimal path without growing the tree," to appear in the special issue of Journal of Algorithms on selected papers from 6th Annual European Symp. on Algorithms.
10. D.Z. Chen, S. Luan, and J. Xu, "Topological peeling and implementation," Proc. 12th Annual International Symposium on Algorithms And Computation (ISAAC), Lecture Notes in Computer Science, Vol. 2223, Springer Verlag, 2001, pp.454-466.
11. D.Z. Chen, S. Luan, and J. Xu, "An Experimental Study and Comparison of Topological Peeling and Topological Walk," Lecture Notes in Computer Science, Vol. 2387, Springer Verlag, Proc. of the Eighth Annual International Computing and Combinatorics Conference (COCOON), Singapore, August, 2002, pp. 456-466.
12. H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, New York, 1987.
13. H. Edelsbrunner and L.J. Guibas, "Topologically sweeping an arrangement," Journal of Computer and System Sciences, Vol. 38, 1989, pp. 165-194.
14. H. Edelsbrunner and E.P. Mücke, "Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms," ACM Trans, on Graphics, Vol. 9, 1990, pp. 66-104.
15. H. Edelsbrunner, and J. O'Rourke, and R. Seidel, "Constructing arrangements of lines and hyperplanes with applications," SIAM J. Computing, Vol. 15, 1986, pp. 341-363.
16. H. Edelsbrunner and E. Welzl, "Constructing belts in two-dimensional arrangements with applications," SIAM J. on Computing, Vol. 15, 1986, pp. 271-284.
17. H. Edelsbrunner and D. Souvaine, "'Computing Median-of-Squares Regression Lines and Guided Topological Sweep," Journal of the American Statistical Association, Vol. 85, 1990, pp. 115-119.
18. D. Eppstein and D. Hart, "An efficient algorithm for shortest paths in vertical and horizontal segments," Lecture Notes in Computer Science, Vol. 1272, Proc. 5th International Workshop on Algorithms and Data Structures, Springer-Verlag, 1997, pp. 234-247.
19. D. Eppstein and D. Hart, "Shortest paths in an arrangement with k line orientations," Proc. 10th Annual ACM-SIAM Symp. Discrete Algorithms, 1999, pp. 310-316.
20. K. Hoffman, K. Mehlhorn, R. Rosenstiehl, and R. Tarjan, "Sorting Jordan sequences in linear time using level-linked search trees," Information and Control, Vol. 68, 1986, pp. 170-184.
21. P.N. Klein, S. Rao, M.H. Rauch, and S. Subramanian, "Faster shortest-path algorithms for planar graphs," Proc. 26th Annual ACM Symp. Theory of Computing, 1994, pp. 27-37.
22. J. Majhi, R. Janardan, M. Smid, and P. Gupta, "On some geometric optimization problems in layered manufacturing," Proc. 5th Workshop on Algorithms and Data Structures, Springer-Verlag, 1997, pp. 136-149.
23. K. Miller, S. Ramaswami, P. Rousseeuw, T. Sellares, D. Souvaine, I. Streinu, and A. Struyf, "Fast implementation of depth contours using topological sweep," Proc. 12th SODA, 2001, pp. 690-699.
24. J. Nievergelt and F.P. Preparata, "Plane-sweep algorithms for intersecting geometric figures," Communications of the ACM, Vol. 25, No. 10, 1982, pp. 739-747.
25. F.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, New York, 1985.
26. B. Schieber, "Computing a minimum-weight k-link path in graphs with the concave Monge property," Proc. 6th Annual ACM-SIAM Symposium on Discrete Algorithms, 1995, pp. 405-411.