Topological peeling and implementation

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

Volumn 2223 LNCS, Issue , 2001, Pages 454-466

  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

[No Author keywords available]

Indexed keywords

BOUNDARY VERTICES; EXECUTION TIME; GLOBAL STRUCTURE; LOCAL STRUCTURE; NEW APPROACHES; SHORTEST PATH; SINGLE SOURCE; TOPOLOGICAL PEELING; TOPOLOGICAL SWEEP;

COMPUTATION THEORY; ALGORITHMS;

COMPUTATIONAL EFFICIENCY; TOPOLOGY;

EID: 70350635159     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45678-3_39     Document Type: Conference Paper

References (21)

1. E. G. Anagnostou, L. J. Guibas, and V. G. Polimenis, "Topological sweeping in three dimensions," Lecture Notes in Computer Science, Vol. 450, Proc. Int'l Symp. on Algorithms (SIGAL'90), Springer-Verlag, 1990, pp. 310-317. 454
2. 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. 456
3. T. Asano, L. J. Guibas, and T. Tokuyama, "Walking in an arrangement topologi-cally," International Journal of Computational Geometry and Applications, Vol. 4, No. 2, 1994, pp. 123-151. 454, 455, 456, 457, 458, 461, 462, 463, 465
4. T. Asano and T. Tokuyama, "Topological walk revisited," Proc. 6th Canadian Conf. on Computational Geometry (CCCG), 1994, pp. 1-6. 454, 456, 465
5. P. Bose, W. Evans, D. Kirkpatrick, M. McAllister, and J. Snoeyink, "Approximating shortest paths in arrangements of lines," CCCG'96, pp. 143-148. 456
6. B. Chazelle, L. J. Guibas, and D. T. Lee, "The power of geometric duality," BIT, Vol. 25, 1985, pp. 76-90. 454
7. 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 (SCG), 1999, pp. 322-331. 456
8. D. Z. Chen, O. Daescu, X. S. Hu, and J. Xu, "Finding an optimal path without growing the tree," ESA'98, pp. 356-367. 456, 464
9. H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, New York, 1987. 454
10. H. Edelsbrunner and L. J. Guibas, "Topologically sweeping an arrangement," Journal of Computer and System Sciences, Vol. 38, 1989, pp. 165-194. 454, 456
11. 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. 454
12. 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. 454
13. H. Edelsbrunner and E. Welzl, "Constructing belts in two-dimensional arrangements with applications," SIAM J. on Comp., Vol. 15, 1986, pp. 271-284. 454
14. D. Eppstein and D. Hart, "An efficient algorithm for shortest paths in vertical and horizontal segments," WADS'97, pp. 234-247. 456
15. D. Eppstein and D. Hart, "Shortest paths in an arrangement with k line orientations," Proc. 10th ACM-SIAM Symp. on Discrete Algorithms (SODA), 1999, pp. 310-316. 456
16. 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. 463
17. 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. 456
18. J. Majhi, R. Janardan, M. Smid, and P. Gupta, "On some geometric optimization problems in layered manufacturing," WADS'97, pp. 136-149. 456
19. 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. 454
20. J. Nievergelt and F. P. Preparata, "Plane-sweep algorithms for intersecting geometric figures," Comm. of the ACM, Vol. 25, No. 10, 1982, pp. 739-747. 456
21. F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, New York, 1985. 454