Article

Free access

Minimum-link paths among obstacles in the plane

Authors:

Joseph S. B. Mitchell,

Günter Rote,

Gerhard WoegingerAuthors Info & Claims

SCG '90: Proceedings of the sixth annual symposium on Computational geometry

Pages 63 - 72

https://doi.org/10.1145/98524.98537

Published: 01 May 1990 Publication History

PDF eReader

Abstract

Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path connecting s to t that avoids all obstacles. We present an algorithm that computes the link distance (and a corresponding minimum-link path) between two points in time Ο(Eα(n) log² n) (and space Ο(E)), where n is the total number of edges of the obstacles, E is the size of the visibility graph, and α(n) denotes the extremely slowly growing inverse of Ackermann's function.

References

[1]

P.K. Agarwal, Intersection and decomposition algorithms for arrangements of curves in the plane, Ph.D. Dissertation, Robotics Report No. 207, New York University, Dept. of Computer Science, August, 1989.

Digital Library

Google Scholar

[2]

J. Canny, J. Reif, New lower bound techniques for robot motion planning and real geometry, Proceedings of the 28th IEEE Symposium on Foundations of Computer Science, 1987, pp. 39-48.

Google Scholar

[3]

B. Chazelle and H. Edelsbrunner, An optimal algorithm for intersecting line segments in the plane, Tech. Report UIUCDCS-R-1419, Department of Computer Science, University of Illinois at Urbana Champaign, March 1988.

Digital Library

Google Scholar

[4]

It. Edelsbrunner, L.J. Guibas, J. Hershberger, R. Seidel, M. Sharir, J. Snoeyink, and E. Welzl, implicitly representing arrangements of lines or segments, Proc. 4th Annual A CM Symposium on Computational Geometry, 1988, pp. 56-69.

Digital Library

Google Scholar

[5]

It. Edelsbrunner, L. Guibas, and M. Sharir, The complexity of many faces in arrangements of lines and segments, Proc. 4th Annual A CM Symposium on Computational Geometry, 1988, pp. 44-55.

Digital Library

Google Scholar

[6]

S.K. Ghosh and D.M. Mount, An output sensitive algorithm for computing visibility graphs, Proceedings of the 28th IEEE Symposium on Foundations of Computer Science, 1987, pp. 11-19.

Digital Library

Google Scholar

[7]

S. Hart and M. Sharir, Nonlinearity of Davenport- Schinzel sequences and of generalized path compression schemes, Combinatorica 6, 1986, 151-177.

Digital Library

Google Scholar

[8]

S. Kapoor and S.N. Maheshwari, Efficient algorithms for Euclidean shortest path and visibility problems with polygonal obstacles, Proc. 4th Annum A CM Symposium on Computational Geometry, 1988, pp. 172-182.

Digital Library

Google Scholar

[9]

Y. Ke, An efficient Algorithm for link distance problems, Proc. 5th Annual ACM Symposium on Computational Geometry, 1989, pp. 69-78.

Digital Library

Google Scholar

[10]

J.S.B. Mitchell, An efficient algorithm for minimum link distance paths among obstacles in the plane, Manuscript, Cornell University, 1989.

Google Scholar

[11]

J.S.B. Mitchell and E. Welzl, Dynamic methods for visibility graphs, Manuscript, Corneil University, 1989.

Google Scholar

[12]

G. Rote and G. Woeginger, Computing a minimum link path among a set of obstacles in the plane, Manuscript, Technische Universit~t Graz, 1989.

Google Scholar

[13]

S. Suri and J. O'Rourke, Worst-case optimal algorithms for constructing visibility polygons with holes, Proc. 2nd Annum ACM Symposium on Computational Geometry, 1986, pp. 14-23.

Digital Library

Google Scholar

[14]

S. Suri, A linear time algorithm for minimum link paths inside a simple polygon, Computer Vision, Graphics, and Image Processing 35, 1986, 99-110.

Digital Library

Google Scholar

Cited By

View all

Bitner SCheung YCook ADaescu OKurdia AWenk C(2010)Visiting a sequence of points with a bevel-tip needleProceedings of the 9th Latin American conference on Theoretical Informatics10.1007/978-3-642-12200-2_43(492-502)Online publication date: 19-Apr-2010
https://dl.acm.org/doi/10.1007/978-3-642-12200-2_43
Shih F(2010)Distance Transformation and Shortest Path PlanningImage Processing and Pattern Recognition10.1002/9780470590416.ch6(179-218)Online publication date: 4-Aug-2010
https://doi.org/10.1002/9780470590416.ch6
Cook AWenk C(2009)Link Distance and Shortest Path Problems in the PlaneProceedings of the 5th International Conference on Algorithmic Aspects in Information and Management10.1007/978-3-642-02158-9_13(140-151)Online publication date: 18-Jun-2009
https://dl.acm.org/doi/10.1007/978-3-642-02158-9_13
Show More Cited By

Index Terms

Minimum-link paths among obstacles in the plane

Recommendations

Shortest paths among obstacles in the plane
SCG '93: Proceedings of the ninth annual symposium on Computational geometry

We give a subquadratic (O(n^5/3+ε) time and space) algorithm for computing Euclidean shortest paths in the plane in the presence of polygonal obstacles; previous time bounds were at least quadratic in n, in the worst-case. The method avoids use of ...
Minimum-link paths among obstacles in the plane
Abstract
Given a set of nonintersecting polygonal obstacles in the plane, thelink distance between two pointss andt is the minimum number of edges required to form a polygonal path connectings tot that avoids all obstacles. We present an algorithm that ...
Minimum-link shortest paths for polygons amidst rectilinear obstacles
Abstract
We compute shortest paths connecting two axis-aligned rectilinear simple polygons in the domain consisting of axis-aligned rectilinear obstacles in the plane. The bounding boxes, one defined for each polygon and one defined for each ...

Comments

Information & Contributors

Information

Published In

SCG '90: Proceedings of the sixth annual symposium on Computational geometry

May 1990

371 pages

ISBN:0897913620

DOI:10.1145/98524

Chairman:
Raimund Seidel

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1990

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SOCG

Sponsor:

SOCG: 6th Annual Conference on Computational Geometry

June 7 - 9, 1990

California, Berkley, USA

Acceptance Rates

Overall Acceptance Rate 625 of 1,685 submissions, 37%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

20
Total Citations
View Citations
86
Total Downloads

Downloads (Last 12 months)32
Downloads (Last 6 weeks)3

Reflects downloads up to 26 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bitner SCheung YCook ADaescu OKurdia AWenk C(2010)Visiting a sequence of points with a bevel-tip needleProceedings of the 9th Latin American conference on Theoretical Informatics10.1007/978-3-642-12200-2_43(492-502)Online publication date: 19-Apr-2010
https://dl.acm.org/doi/10.1007/978-3-642-12200-2_43
Shih F(2010)Distance Transformation and Shortest Path PlanningImage Processing and Pattern Recognition10.1002/9780470590416.ch6(179-218)Online publication date: 4-Aug-2010
https://doi.org/10.1002/9780470590416.ch6
Cook AWenk C(2009)Link Distance and Shortest Path Problems in the PlaneProceedings of the 5th International Conference on Algorithmic Aspects in Information and Management10.1007/978-3-642-02158-9_13(140-151)Online publication date: 18-Jun-2009
https://dl.acm.org/doi/10.1007/978-3-642-02158-9_13
Stifter S(2005)Shortest non-synchronized motions parallel versions for shared memory crew modelsParallel Computation10.1007/3-540-57314-3_8(87-104)Online publication date: 29-May-2005
https://doi.org/10.1007/3-540-57314-3_8
Lee D(2005)Rectilinear paths among rectilinear obstaclesAlgorithms and Computation10.1007/3-540-56279-6_53(5-20)Online publication date: 9-Jun-2005
https://doi.org/10.1007/3-540-56279-6_53
Berg MKreveld MNilsson BOvermars M(2005)Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metricSWAT 9010.1007/3-540-52846-6_91(213-224)Online publication date: 8-Jun-2005
https://doi.org/10.1007/3-540-52846-6_91
Yang CLee DWong C(1997)The Smallest Pair of Noncrossing Paths in a Rectilinear PolygonIEEE Transactions on Computers10.1109/12.60928046:8(930-941)Online publication date: 1-Aug-1997
https://dl.acm.org/doi/10.1109/12.609280
Stifter S(1997)Optimal Collision Free Path Planning for Non-Synchronized MotionsJournal of Intelligent and Robotic Systems10.1023/A:100798202342719:2(187-205)Online publication date: 1-Jun-1997
https://dl.acm.org/doi/10.1023/A%3A1007982023427
Sellen J(1995)Direction weighted shortest path planningProceedings of 1995 IEEE International Conference on Robotics and Automation10.1109/ROBOT.1995.525552(1970-1975)Online publication date: 1995
https://doi.org/10.1109/ROBOT.1995.525552
Goodrich M(1995)Efficient piecewise-linear function approximation using the uniform metricDiscrete & Computational Geometry10.1007/BF0257071714:4(445-462)Online publication date: 1-Dec-1995
https://dl.acm.org/doi/10.1007/BF02570717
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Shortest paths among obstacles in the plane