메뉴 건너뛰기




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

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

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
Times cited : (2)

References (27)
  • 2
    • 0019683897 scopus 로고
    • An optimal algorithm for determining the visibility polygon from an edge
    • 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.
    • (1981) IEEE Transactions on Computers , vol.C-30 , pp. 910-914
    • Avis, D.1    Toussaint, G.2
  • 5
    • 0028092565 scopus 로고
    • Optimal Linear-Time Algorithm for the Shortest Illuminating Line Segment in a Polygon
    • 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.
    • (1994) Proc. 10th Annu. ACM Sympos. Comput. Geom.
    • Das, G.1    Narasimhan, G.2
  • 6
    • 0012916872 scopus 로고
    • An O(n log n) algorithm for computing the link center of a simple polygon
    • 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.
    • (1992) Discrete and Computational Geometry , vol.8 , pp. 131-152
    • Djidjev, H.1    Lingas, A.2    Sack, J.-R.3
  • 7
    • 0001961759 scopus 로고    scopus 로고
    • Link distance problems
    • J.-R. Sack and J. Urrutia, editors, Elsevier Science Publishers B.V. North-Holland, Amsterdam
    • 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.
    • (2000) Handbook of Computational Geometry , pp. 519-558
    • Djidjev, H.1    Maheshwari, A.2    Sack, J.-R.3
  • 8
    • 0004535292 scopus 로고
    • An algorithm for determining visibility of a simple polygon from an internal line segment
    • 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.
    • (1993) Journal of Algorithms , vol.14 , pp. 139-168
    • Doh, J.-I.1    Chwa, K.-Y.2
  • 9
    • 0023247608 scopus 로고
    • Linear algorithms for visibility and shortest path problems inside triangulated simple polygons
    • 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.
    • (1987) Algorithmica , vol.2 , pp. 209-233
    • Guibas, L.1    Hershberger, J.2    Leven, D.3    Sharir, M.4    Tarjan, R.5
  • 15
    • 0345874844 scopus 로고
    • On the number of links and placement of telescoping manipulators in an environment with obstacles
    • 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.
    • (1991) Proc. International Conference on Advanced Robotics
    • Kolarov, K.1    Roth, B.2
  • 16
  • 19
    • 0347136063 scopus 로고
    • Optimal parallel algorithms for rectilinear link distance problems
    • A. Lingas, A. Maheshwari and J.-R. Sack, Optimal parallel algorithms for rectilinear link distance problems, Algorithmica, 14, 261-289, 1995.
    • (1995) Algorithmica , vol.14 , pp. 261-289
    • Lingas, A.1    Maheshwari, A.2    Sack, J.-R.3
  • 21
    • 0003009072 scopus 로고
    • Automated line generalization
    • R. B. McMaster. Automated line generalization. Cartographica, 26:74-111, 1987.
    • (1987) Cartographica , vol.26 , pp. 74-111
    • McMaster, R.B.1
  • 24
    • 0023366691 scopus 로고
    • Minimizing turns for discrete movement in the interior of a polygon
    • 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.
    • (1987) IEEE Journal of Robotics and Automation , vol.3 , pp. 182-193
    • Reif, J.1    Storer, J.A.2
  • 25
    • 0025508881 scopus 로고
    • An optimal algorithm for detecting weak visibility of a polygon
    • 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.
    • (1990) IEEE Transactions on Computers , vol.39 , pp. 1213-1219
    • Sack, J.-R.1    Suri, S.2
  • 26
    • 0003828759 scopus 로고
    • Ph.D. Thesis, Department of Computer Science, Johns Hopkins University, Baltimore
    • S. Suri, Minimum link paths in polygons and related problems. Ph.D. Thesis, Department of Computer Science, Johns Hopkins University, Baltimore, 1987.
    • (1987) Minimum Link Paths in Polygons and Related Problems
    • Suri, S.1
  • 27
    • 0023366861 scopus 로고
    • On embedding a graph in the grid with minimum number of bends
    • R. T. Tamassia. On embedding a graph in the grid with minimum number of bends. SIAM Journal on Computing, 16, pp. 421-444, 1987.
    • (1987) SIAM Journal on Computing , vol.16 , pp. 421-444
    • Tamassia, R.T.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.