An O(n log n) algorithm for finding a shortest central link segment

International Journal of Computational Geometry and Applications

Volumn 10, Issue 2, 2000, Pages 157-188

  Aleksandrov, Lyudmil G ^a   Djidjev, Hristo N ^b   Sack, Jörg Rüdiger ^c  

^a BULGARIAN ACADEMY OF SCIENCES   (Bulgaria)

^b UNIVERSITY OF WARWICK   (United Kingdom)

^c CARLETON UNIVERSITY   (Canada)

Author keywords

Algorithm design and analysis; Computational geometry; Link distance; Shortest segment; Simple polygon

Indexed keywords

EID: 0034395609     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195900000103     Document Type: Article

References (27)

1. L. Aleksandrov, H. Djidjev, and J.-R. Sack, Finding a central link segment of a simple polygon in O(n log n) time, Technical Report TR89-7, Bulgarian Academy of Sciences; also Technical Report SCS-TR-163, School of Computer Science, Carleton University, 1989.
2. D. Avis and G. Toussaint, An optimal algorithm for determining the visibility polygon from an edge, IEEE Transactions on Computers, C-30, pp. 910-914, 1981.
3. E. M. Arkin, J. S. B. Mitchell, and S. Suri. Logarithmic-time link path queries in a simple polygon. Internat. J. Comput. Geom. Appl., 5(4):369-395, 1995.
4. B. Bhattacharya, P. Egyed, and G. Toussaint. Computing the wingspan of a butterfly, Proceedings of the Third Canadian Conference on Computational Geometry, pp. 88-91, 1991.
5. G. Das and G. Narasimhan, Optimal Linear-Time Algorithm for the Shortest Illuminating Line Segment in a Polygon, Proc. 10th Annu. ACM Sympos. Comput. Geom., 1994.
6. H. Djidjev, A. Lingas and J.-R. Sack, An O(n log n) algorithm for computing the link center of a simple polygon, Discrete and Computational Geometry, 8, pp. 131-152, 1992.
7. H. Djidjev, A. Maheshwari, and J.-R. Sack, Link distance problems, in J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, Elsevier Science Publishers B.V. North-Holland, Amsterdam, pp. 519-558, 2000.
8. J.-I. Doh and K.-Y. Chwa, An algorithm for determining visibility of a simple polygon from an internal line segment, Journal of Algorithms, 14, pp. 139-168, 1993.
9. L. Guibas, J. Hershberger, D. Leven, M. Sharir, and R. Tarjan, Linear algorithms for visibility and shortest path problems inside triangulated simple polygons, Algorithmica, 2, pp. 209-233, 1987.
10. L. J. Guibas, J. E. Hershberger, J. S. B. Mitchell, and J. S. Snoeyink. Approximating polygons and subdivisions with minimum link paths. Internat. J. Comput. Geom. Appl., 3(4):383-415, December 1993.
11. L. Guibas, J. Hershberger, and J. Snoeyink, Compact interval trees: a data structure for convex hulls, Intern. J. of Computational Geometry & Applications, 1, pp. 1-22, 1991
12. L. Guibas, J. Hershberger, Optimal shortest path queries in a simple polygon, Journal of Computer and Systems Sciences, vol. 39, pp. 126-152, 1989.
13. Y. Ke, Polygon visibility algorithms for weak visibility and link distance problems, Ph.D. Thesis, Johns Hopkins University, 1989.
14. Y. Ke, An efficient algorithm for link distance problems inside a simple polygon, In Proceedings of the Fifth Annual ACM Symposium on Computational Geometry, pp. 69-78, 1989.
15. K. Kolarov and B. Roth. On the number of links and placement of telescoping manipulators in an environment with obstacles. In Proc. International Conference on Advanced Robotics, 1991.
16. S. Kahan and J. Snoeyink, On the bit complexity of minimum link paths: Superquadratic algorithms for problems solvable in linear time, in Proceedings of the 12-th Annual ACM Symposium on Computational Geometry, pp. 151-158, 1996.
17. D. Kirkpatrick and J. Snoeyink, Computing constrained shortest segments: butterfly wingspans in logarithmic time, in Proceedings of the Fifth Canadian Conference on Computational Geometry, pp. 163-168, 1993.
18. W. Lenhart, R. Pollack, J.-R. Sack, R. Seidel, M. Sharir, S. Suri, G. Toussaint, S. Whitesides and C. Yap, Computing the link center of a simple polygon, Discrete and Computational Geometry, 3, pp. 281-293, 1988.
19. A. Lingas, A. Maheshwari and J.-R. Sack, Optimal parallel algorithms for rectilinear link distance problems, Algorithmica, 14, 261-289, 1995.
20. A. Maheshwari. Parallel algorithms for minimum link path and related problems. Ph.D. thesis, Tata Institute of Fundamental Research, Bombay, India, 1993.
21. R. B. McMaster. Automated line generalization. Cartographica, 26:74-111, 1987.
22. B. Natarajan. On comparing and compressing piece-wise linear curves. Report, Hewlett Packward, 1991.
23. F. Preparata and M. Shamos, Computational Geometry, Springer-Verlag, New York, Heidelberg, 1985.
24. J. Reif and J. A. Storer. Minimizing turns for discrete movement in the interior of a polygon. IEEE Journal of Robotics and Automation, 3:182-193, 1987.
25. J.-R. Sack and S. Suri, An optimal algorithm for detecting weak visibility of a polygon, IEEE Transactions on Computers, 39, pp. 1213-1219, 1990.
26. S. Suri, Minimum link paths in polygons and related problems. Ph.D. Thesis, Department of Computer Science, Johns Hopkins University, Baltimore, 1987.
27. R. T. Tamassia. On embedding a graph in the grid with minimum number of bends. SIAM Journal on Computing, 16, pp. 421-444, 1987.