Article

Free access

Shortest path queries in rectilinear worlds of higher dimension (extended abstract)

Authors:

Mark de Berg,

Marc van Kreveld, and

Bengt J. NilssonAuthors Info & Claims

SCG '91: Proceedings of the seventh annual symposium on Computational geometry

June 1991

Pages 51 - 60

https://doi.org/10.1145/109648.109654

Published: 01 June 1991 Publication History

PDF eReader

References

[1]

Canny, J.F., The Complexity of Robot Motion Planning. ACM Doctoral Dissertation Award, MIT Press, 1987.

Digital Library

Google Scholar

[2]

Canny, J., and J. Reif, New Lower Bound Techniques for Robot Motion Planning Problems. Proc. 29th FOCS (1987), pp. 49-60.

Digital Library

Google Scholar

[3]

Chazelle, B., A theorem on polygon cutting with applications. Proc. 23rd FOCS (1982), pp. 339-349.

Digital Library

Google Scholar

[4]

Chazelle, B., Triangulating a Simple Polygon in Linear Time. Proc. 31st FOCS (1990), pp. 220-230.

Google Scholar

[5]

Chazelle, B., and L.J. Guibas, Fractional Cascading: I. A Data Structuring Technique. Algorithmica 1 (1986), pp. 133-162.

Digital Library

Google Scholar

[6]

Chen, J., and Y. Han, Shortest Paths on a Polyhedron. Proc. 6th ACM Syrup. on Comp. Geom. (1990), pp. 360-369.

Digital Library

Google Scholar

[7]

Clarkson, K., S. Kapoor, and P. Vaidya, Rectilinear Shortest Paths through Polygonal Obstacles in O(n log2 n) Time. Proc. 3rd ACM Syrup. on Comp. Geom. (1987), pp. 251-257.

Digital Library

Google Scholar

[8]

de Berg, M., On Rectilinear Link Distance. To appear in: Comp. Geom.: Theory and Applications.

Digital Library

Google Scholar

[9]

de Berg, M., M. van Kreveld, B. Nilsson, and M. Overmars, Finding Shortest Paths in the Presence of Orthogonal Obstacles using a Combined L ~ and Link Metric. SWAT 1990, Lect. Notes in Comp. :Science 447 (1990), pp. 213-224.

Digital Library

Google Scholar

[10]

de Rezende, P.J., D.T. Lee, and Y.F. Wu, Rectilinear Shortest Paths with Rectangular Barriers. Discr. & Comp. Geom. 4 (1989), pp. 41-53.

Digital Library

Google Scholar

[11]

Dijkstra, E.W., A Note on Two Problems in Connection with Graphs. Numer. Math. 1 (1959), pp. 269- 271.

Digital Library

Google Scholar

[12]

Ke, Y., An Efficient Algorithm for Link Distance Problems. Proc. 5th ACM Syrup. on Comp. Geom. (1989), pp. 69-78.

Digital Library

Google Scholar

[13]

Larson, R.C., and V.O. Li, Finding Minimum Rectilinear Distance Paths in the Presence of Barriers. Networks 11 (1981), pp. 285-304.

Crossref

Google Scholar

[14]

Lee, D.T., Proximity and Reachability in the Plane. Ph.D. Thesis, University of illinois, 1978.

Digital Library

Google Scholar

[15]

Lee, D.T., and F.P. Preparata, Euclidean Shortest Paths in the Presence of Rectilinear Barriers. Networks 14 (1984), pp. 393-410.

Crossref

Google Scholar

[16]

LenharI, W., R. Pollack, J. Sack, R. Seidel, M. Sharir, S. S uri, O. Toussaint, S. Whitesides, and C. Yap, Computing the Link Center of a Simple Polygon. Proc. 3rd ACM Syrup. on Comp. Geom. (1987), pp. 1-10.

Digital Library

Google Scholar

[17]

Mehlhom, K., Data Structures and Algorithms 3: multi-dimensional searching and computational geometry. Springer-Verlag, Berlin, 1984.

Digital Library

Google Scholar

[18]

Mitchell, J.S.B., An Optimal Algorithm for Shortest Rectilinear Paths Among Obstacles in the Plane. Abstracts of the 1st Canad. Conf. on Comp. Geom. (1989), p. 22.

Google Scholar

[19]

Mitchell, J.S.B., D.M. Mount, and C.H. Papadimitriou, The Discrete Geodesic Problem. SIAM J. Cornput. 16 (1987), pp. 647-668.

Digital Library

Google Scholar

[20]

Mitchell, J.S.B., G. Rote and O. W0ginger, Computing the Minimum Link Path Among a Set of Obstacles in the Plane. Proc. 6th ACM Syrup. on Comp. Geom. (1990), pp. 63-72.

Digital Library

Google Scholar

[21]

O'Rourke, J., and C. Schevon, Computing the Geodesic Diameter of a 3-Polytope. Proc. 5th ACM Syrup. on Comp. Geom. (1989), pp. 370-379.

Digital Library

Google Scholar

[22]

Reif, J., and J.A. Storer, Shortest Paths in Euclidian Space with Polyhedral Obstacles. Techn. Rep. CS- 85-121, Comp. Science Dept., Brandeis University, Waltham, MA, 1985.

Google Scholar

[23]

Shamos, M.I., Computational Geometry. Ph.D. Thesis, Yale University, New Haven, CN, 1978.

Digital Library

Google Scholar

[24]

Sharir, M., and A. Schorr. On Shortest Paths in Polyhedral Spaces. SiAM J. Comput. 15 (1986), pp. 193- 215.

Digital Library

Google Scholar

[25]

Suri, S., Minimum Link Paths in Polygons and Related Problems. Ph.D. Thesis, Johns Hopkins University, 1986.

Digital Library

Google Scholar

Cited By

View all

Abam MRezaei Seraji M(2020) Geodesic Spanners for Points in amid Axis-parallel Boxes Information Processing Letters10.1016/j.ipl.2020.106063(106063)Online publication date: Nov-2020
https://doi.org/10.1016/j.ipl.2020.106063
Scholtes IBotev JEsch MHöhfeld ASchloss HZech BMolnár SHeath J(2008)TopGen - internet router-level topology generation based on technology constraintsProceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops10.5555/1416222.1416257(1-10)Online publication date: 3-Mar-2008
https://dl.acm.org/doi/10.5555/1416222.1416257
Atallah MChen D(2005)Applications of a numbering scheme for polygonal obstacles in the planeAlgorithms and Computation10.1007/BFb0009476(1-24)Online publication date: 11-Oct-2005
https://doi.org/10.1007/BFb0009476
Show More Cited By

Index Terms

Shortest path queries in rectilinear worlds of higher dimension (extended abstract)
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Paths and connectivity problems
2. Theory of computation
  1. Randomness, geometry and discrete structures
    1. Computational geometry

Recommendations

Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane

We study the problems of processing single-source and two-point shortest path queries among weighted polygonal obstacles in the rectilinear plane. For the single-source case, we construct a data structure in O ( n log ^3/2 n ) time and O ( n log n )...
Read More
Rectilinear Path Problems Among Rectilinear ObstaclesRevisited

Efficient algorithms are presented for finding rectilinear collision-free paths between two given points among a set of rectilinear obstacles. The results improve the time complexity of previous results for finding the shortest rectilinear path, the ...
Read More
Computing a Rectilinear Shortest Path amid Splinegons in Plane
Combinatorial Optimization and Applications
Abstract
We reduce the problem of computing a rectilinear shortest path between two given points s and t in the given splinegonal domain to the problem of computing a rectilinear shortest path between two points in the polygonal domain. Our reduction ...
Read More

Comments

Information & Contributors

Information

Published In

SCG '91: Proceedings of the seventh annual symposium on Computational geometry

June 1991

373 pages

ISBN:0897914260

DOI:10.1145/109648

Chairman:
R. L. Scot Drysdale

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 June 1991

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SOCG91

Sponsor:

SOCG91: 7th Annual Symposium on Computational Geometry 1991

June 10 - 12, 1991

New Hampshire, North Conway, USA

Acceptance Rates

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
408
Total Downloads

Downloads (Last 12 months)41
Downloads (Last 6 weeks)4

Other Metrics

View Author Metrics

Citations

Cited By

View all

Abam MRezaei Seraji M(2020) Geodesic Spanners for Points in amid Axis-parallel Boxes Information Processing Letters10.1016/j.ipl.2020.106063(106063)Online publication date: Nov-2020
https://doi.org/10.1016/j.ipl.2020.106063
Scholtes IBotev JEsch MHöhfeld ASchloss HZech BMolnár SHeath J(2008)TopGen - internet router-level topology generation based on technology constraintsProceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops10.5555/1416222.1416257(1-10)Online publication date: 3-Mar-2008
https://dl.acm.org/doi/10.5555/1416222.1416257
Atallah MChen D(2005)Applications of a numbering scheme for polygonal obstacles in the planeAlgorithms and Computation10.1007/BFb0009476(1-24)Online publication date: 11-Oct-2005
https://doi.org/10.1007/BFb0009476
Mitchell JSharir MSnoeyink JBoissonnat J(2004)New results on shortest paths in three dimensionsProceedings of the twentieth annual symposium on Computational geometry10.1145/997817.997839(124-133)Online publication date: 8-Jun-2004
https://dl.acm.org/doi/10.1145/997817.997839
Dror MEfrat ALubiw AMitchell JLarmore LGoemans M(2003)Touring a sequence of polygonsProceedings of the thirty-fifth annual ACM symposium on Theory of computing10.1145/780542.780612(473-482)Online publication date: 9-Jun-2003
https://dl.acm.org/doi/10.1145/780542.780612
ATALLAH MCHEN D(2001)ON CONNECTING RED AND BLUE RECTILINEAR POLYGONAL OBSTACLES WITH NONINTERSECTING MONOTONE RECTILINEAR PATHSInternational Journal of Computational Geometry & Applications10.1142/S021819590100054711:04(373-400)Online publication date: Aug-2001
https://doi.org/10.1142/S0218195901000547
Hetzel ADewilde PRammig FMusgrave G(1998)A sequential detailed router for huge grid graphsProceedings of the conference on Design, automation and test in Europe10.5555/368058.368167(332-339)Online publication date: 23-Feb-1998
https://dl.acm.org/doi/10.5555/368058.368167
Hetzel A(1998)A sequential detailed router for huge grid graphsProceedings Design, Automation and Test in Europe10.1109/DATE.1998.655877(332-338)Online publication date: 1998
https://doi.org/10.1109/DATE.1998.655877
Chen DKlenk KTu HSnoeyink J(1995)Shortest path queries among weighted obstacles in the rectilinear planeProceedings of the eleventh annual symposium on Computational geometry10.1145/220279.220319(370-379)Online publication date: 1-Sep-1995
https://dl.acm.org/doi/10.1145/220279.220319

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 Path Queries Among Weighted Obstacles in the Rectilinear Plane

Rectilinear Path Problems Among Rectilinear ObstaclesRevisited

Computing a Rectilinear Shortest Path amid Splinegons in Plane

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane

Rectilinear Path Problems Among Rectilinear ObstaclesRevisited

Computing a Rectilinear Shortest Path amid Splinegons in Plane

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations