Article

Free access

Matrix searching with the shortest path metric

Authors:

John Hershberger,

Subhash SuriAuthors Info & Claims

STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing

Pages 485 - 494

https://doi.org/10.1145/167088.167220

Published: 01 June 1993 Publication History

PDF eReader

References

[1]

P. K. Agarwal, A. Aggarwal, B. Aronov, S. R. Kosaraju, B. Schieber, and S. Suri. Computing external-furthest neighbors for a simple polygon. Discrete Applied Mathematics, 31:97-111, 1991.

Digital Library

Google Scholar

[2]

A. Aggarwal, H. Edeisbrunner, P. Raghavan, and P. Tiwari. Optimal time bounds for some proximity problems in the plane. Information Processing Letters, 42:55-60, 1992.

Digital Library

Google Scholar

[3]

A. Aggarwal, M. Klawe, S. Moran, P. Shot, and R. Wilber. Geometric applications of a matrix searching algorithm. Algorithmica, 2"195-208, 1987.

Google Scholar

[4]

A. Aggarwal, S. Moran, P. Shot, and S. Suri. Computing the minimum visible vertex distance between two polygons. In Proc. of 1st Workshop on Algorithms and Data Structures, pages 115-134. Springer-Verlag, 1989.

Digital Library

Google Scholar

[5]

L. Guibas and J. Hershberger. Optimal shortest path queries in a simple polygon. Journal of Computer and System Sciences, 39(2):126-152, 1989.

Digital Library

Google Scholar

[6]

L. Guibas, J. Hershberger, D. Leven, M. Sharir, and R. Tarjan. Linear time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica, 2:209-233, 1987.

Digital Library

Google Scholar

[7]

L. Guibas, J. Hershberger, and J. Snoeyink. Compact interval trees: A data structure for convex hulls. International Journal of Computational Geometry Cj Applications, 1(1):1-22, t991.

Google Scholar

[8]

D. Harel and R. E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing, 13(2):338-355, 1984.

Digital Library

Google Scholar

[9]

J. Hershberger. A new data structure for shortest path queries in a simple polygon. Information Processing Letters, 38:231-235, 1991.

Digital Library

Google Scholar

[10]

J. Hershberger and J. Snoeyink. Computing minimum length paths of a given homotopy class. In Proceedings of the 2rid Workshop on Algorithms and Data Structures, pages 331-342. Springer- Verlag, 1991. Lecture Notes in Computer Science 519.

Crossref

Google Scholar

[11]

A. Lingas. Voronoi diagrams with barriers and the shortest diagonal problem. Information Processing Letters, 32(4):191-198, 1989.

Digital Library

Google Scholar

[12]

O. Marcotte and S. Suri. Fast matching algorithms for points on a polygon. SIAM Journal on Cornpuling, 20:405-422, 1991.

Digital Library

Google Scholar

[13]

J. O'Rourke. Computational geometry column 8. SIGACT News, 20(4):30, 1989.

Digital Library

Google Scholar

[14]

M. Overmars and J. van Leeuwen. Maintenance of configurations in the plane. Journal of Computer and Sys~em Sciences, 23:166-204, 1981.

Crossref

Google Scholar

[15]

B. Schieber and U. Vishkin. On finding lowest common ancestors" Simplification and parallelization. In Proceedings of the Third Aegean Workshop on Computing, pages 111-123. Springer-Verlag, 1988. Lecture Notes in Computer Science 319.

Digital Library

Google Scholar

[16]

S. Suri. Computing geodesic furthest neighbors in simple polygons. Journal of Computer and Syslem Sciences, 39:220-235, 1989.

Digital Library

Google Scholar

[17]

B. Zhu. Computing the shortest diagonal of a monotone polygon in linear time. Information Processing Lel#ers, 42:303-307, 1992.

Digital Library

Google Scholar

Cited By

View all

Bae SChwa KHershberger JFogel E(2009)The geodesic farthest-site Voronoi diagram in a polygonal domain with holesProceedings of the twenty-fifth annual symposium on Computational geometry10.1145/1542362.1542402(198-207)Online publication date: 8-Jun-2009
https://dl.acm.org/doi/10.1145/1542362.1542402
Schuierer S(2005)Computing the L 1-diameter and center of a simple rectilinear polygon in parallelAlgorithm Theory — SWAT '9410.1007/3-540-58218-5_30(326-337)Online publication date: 30-May-2005
https://doi.org/10.1007/3-540-58218-5_30
Chen DXu JYao FLuks E(2000)Shortest path queries in planar graphsProceedings of the thirty-second annual ACM symposium on Theory of computing10.1145/335305.335359(469-478)Online publication date: 1-May-2000
https://dl.acm.org/doi/10.1145/335305.335359
Show More Cited By

Index Terms

Matrix searching with the shortest path metric
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Paths and connectivity problems
  2. Mathematical analysis
    1. Numerical analysis
      1. Computations on matrices
2. Theory of computation
  1. Randomness, geometry and discrete structures
    1. Computational geometry

Recommendations

A Multiple Pairs Shortest Path Algorithm

The multiple pairs shortest path problem (MPSP) arises in many applications where the shortest paths and distances between only some specific pairs of origin-destination (OD) nodes in a network are desired. The traditional repeated single-source shortest ...
Generalization of Shortest Path Map
ITNG '10: Proceedings of the 2010 Seventh International Conference on Information Technology: New Generations

We consider the problem of constructing shortest path maps in two dimensions under angle constraint. Shortest path maps are used for planning short length paths from a fixed source point s to varying goal points. In the standard shortest path map the ...
Acceleration of shortest path and constrained shortest path computation
WEA'05: Proceedings of the 4th international conference on Experimental and Efficient Algorithms

We study acceleration methods for point-to-point shortest path and constrained shortest path computations in directed graphs, in particular in road and railroad networks. Our acceleration methods are allowed to use a preprocessing of the network data to ...

Comments

Information & Contributors

Information

Published In

STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing

June 1993

812 pages

ISBN:0897915917

DOI:10.1145/167088

Chairmen:
Rao Kosaraju
John Hopkins Univ., Baltimore, MD
,
David Johnson
AT&T Bell Lab.
,
Alok Aggarwal
IBM T. J. Watson Research Center,Yorktown Heights, NY

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 1993

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC93

Sponsor:

SIGACT

STOC93: 25th Annual ACM Symposium on the Theory of Computing

May 16 - 18, 1993

California, San Diego, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
457
Total Downloads

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

Reflects downloads up to 02 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bae SChwa KHershberger JFogel E(2009)The geodesic farthest-site Voronoi diagram in a polygonal domain with holesProceedings of the twenty-fifth annual symposium on Computational geometry10.1145/1542362.1542402(198-207)Online publication date: 8-Jun-2009
https://dl.acm.org/doi/10.1145/1542362.1542402
Schuierer S(2005)Computing the L 1-diameter and center of a simple rectilinear polygon in parallelAlgorithm Theory — SWAT '9410.1007/3-540-58218-5_30(326-337)Online publication date: 30-May-2005
https://doi.org/10.1007/3-540-58218-5_30
Chen DXu JYao FLuks E(2000)Shortest path queries in planar graphsProceedings of the thirty-second annual ACM symposium on Theory of computing10.1145/335305.335359(469-478)Online publication date: 1-May-2000
https://dl.acm.org/doi/10.1145/335305.335359
Tamir AMitchell J(1998)A maximumb-matching problem arising from median location models with applications to the roommates problemMathematical Programming10.1007/BF0158172580:2(171-194)Online publication date: Jan-1998
https://doi.org/10.1007/BF01581725
Chepoi V(1996)On Distances in Benzenoid SystemsJournal of Chemical Information and Computer Sciences10.1021/ci960086936:6(1169-1172)Online publication date: 21-Nov-1996
https://doi.org/10.1021/ci9600869
Amato N(1995)Finding a closest visible vertex pair between two polygonsAlgorithmica10.1007/BF0129366814:2(183-201)Online publication date: 1-Aug-1995
https://dl.acm.org/doi/10.1007/BF01293668

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

A Multiple Pairs Shortest Path Algorithm

Generalization of Shortest Path Map

Acceleration of shortest path and constrained shortest path computation