J. Canny and J. H. Reif, New lower bound techniques for robot motion planning problems, Proc. 28th Annu. IEEE Syrup. Found. Comput. $ci., 1987, 49-60.

Digital Library

Google Scholar

[6]

J. Chen and Y. Han, Shortest paths on a polyhedron, Proc. 6th A CM $yrap. on Computational Geometry, 1990, 360-369.

Digital Library

Google Scholar

[7]

K.L. Clarkson, Approximation algorithms for shortest path motion planning, Proc. 19th A CM Syrup. on Theory of Computing, 1987, 56-65.

Digital Library

Google Scholar

[8]

D. Dobkin and D. Kirkpatrick, A linear algorithm for determining the separation of convex polyhodra, J. Algorithms 6 (1985), 381-392.

Crossref

Google Scholar

[9]

H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, Heidelberg, 1987.

Digital Library

Google Scholar

[10]

J. Hershberger and S. Suri, Practical methods for approximating shortest paths on a convex polytope in IRs, Proc. 6th A CM-SIAM Syrup. on D~screte Algorithms, 1995, 447-456.

Digital Library

Google Scholar

[11]

J.S.B. Mitchell, D.M. Mount, and C.H. Papadimitriou, The discrete geodesm problem, SIAM J. Corn.- put. 16 (1987). 647-668.

Digital Library

Google Scholar

[12]

C.H. Papadimitriou. An algorithm for shortest-path motion in three dimensions. Inform. Process. Lett. 2O (1985), 259-263.

Google Scholar

[13]

A. V. Pogorelov, Extrinsic Geometry of Convex Surfaces, Volume 35 of Translations of Mathematical Monographs, American Mathematical Society, Providence, RI, 1973.

Google Scholar

[14]

F.P. Preparata and M.I. Shamos, Uornputat~onal Geometry: An Introduction, Springer-Verlag, Berlin 1985.

Digital Library

Google Scholar

[15]

J. Reif and J. Storer, Shortest paths ill Euclidean space with polyhedral obstacles, J. Assoc. Comput. Mach. 41 (1994), 1013-1019.

Digital Library

Google Scholar

[16]

M. Shaxir, On shortest paths amidst convex polyhedra, SIAM J. Comput. 16 (1987), 561-572.

Digital Library

Google Scholar

[17]

M. Sharir and A. Schorr, On shortest paths in polyhedral spaces, SIAM J. Comput. 15 (1986), 193-215.

Digital Library

Google Scholar

Cited By

View all

Bose PMaheshwari AShu CWuhrer S(2011)A survey of geodesic paths on 3D surfacesComputational Geometry: Theory and Applications10.1016/j.comgeo.2011.05.00644:9(486-498)Online publication date: 1-Nov-2011
https://dl.acm.org/doi/10.1016/j.comgeo.2011.05.006
Lanthier MNussbaum DSack J(2003)Parallel implementation of geometric shortest path algorithmsParallel Computing10.1016/j.parco.2003.05.00429:10(1445-1479)Online publication date: 1-Oct-2003
https://dl.acm.org/doi/10.1016/j.parco.2003.05.004
Suits FKlosowski JHorn WLecina GMoorhead R(2000)Simplification of surface annotationsProceedings of the conference on Visualization '0010.5555/375213.375247(235-242)Online publication date: 1-Oct-2000
https://dl.acm.org/doi/10.5555/375213.375247
Show More Cited By

Index Terms

Approximating shortest paths on a convex polytope in three dimensions
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Paths and connectivity problems
  2. Mathematical analysis
    1. Functional analysis
      1. Approximation
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
  2. Randomness, geometry and discrete structures
    1. Computational geometry

Recommendations

Approximating shortest paths on a convex polytope in three dimensions

Given a convex polytope P with n faces in ℝ³, points ∈ ∂P, and a parameter 0 < ϵ ≤ 1, we present an algorithm that constructs a path on ∂P from s to t whose length is at most (1 + ϵ)d_p(s, t), where d_p(s, t) is the length of the shortest path between s ...
An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions

We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dimensions. Our algorithm runs in O(nlogźn) time and requires O(nlogźn) space, ...
An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
SCG '06: Proceedings of the twenty-second annual symposium on Computational geometry

We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dimensions. Our algorithm runs in O(nlog n) time and requires O(nlog n) space, ...

Comments

Information & Contributors

Information

Published In

SCG '96: Proceedings of the twelfth annual symposium on Computational geometry

May 1996

406 pages

ISBN:0897918045

DOI:10.1145/237218

Chairman:
Sue Whitesides
McGill Univ.

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 1996

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SoCG96

Sponsor:

SoCG96: 12th ACM Symposium on Computational Geometry

May 24 - 26, 1996

Pennsylvania, Philadelphia, USA

Acceptance Rates

SCG '96 Paper Acceptance Rate 48 of 93 submissions, 52%;

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

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
291
Total Downloads

Downloads (Last 12 months)27
Downloads (Last 6 weeks)8

Reflects downloads up to 01 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bose PMaheshwari AShu CWuhrer S(2011)A survey of geodesic paths on 3D surfacesComputational Geometry: Theory and Applications10.1016/j.comgeo.2011.05.00644:9(486-498)Online publication date: 1-Nov-2011
https://dl.acm.org/doi/10.1016/j.comgeo.2011.05.006
Lanthier MNussbaum DSack J(2003)Parallel implementation of geometric shortest path algorithmsParallel Computing10.1016/j.parco.2003.05.00429:10(1445-1479)Online publication date: 1-Oct-2003
https://dl.acm.org/doi/10.1016/j.parco.2003.05.004
Suits FKlosowski JHorn WLecina GMoorhead R(2000)Simplification of surface annotationsProceedings of the conference on Visualization '0010.5555/375213.375247(235-242)Online publication date: 1-Oct-2000
https://dl.acm.org/doi/10.5555/375213.375247
Suits FKlosowski JHorn WLecina G(2000)Simplification of surface annotationsProceedings Visualization 2000. VIS 2000 (Cat. No.00CH37145)10.1109/VISUAL.2000.885700(235-242,)Online publication date: 2000
https://doi.org/10.1109/VISUAL.2000.885700
Har-Peled SJanardan R(1998)An output sensitive algorithm for discrete convex hullsProceedings of the fourteenth annual symposium on Computational geometry10.1145/276884.276924(357-364)Online publication date: 7-Jun-1998
https://dl.acm.org/doi/10.1145/276884.276924
Lanthier MMaheshwari ASack JBoissonnat J(1997)Approximating weighted shortest paths on polyhedral surfacesProceedings of the thirteenth annual symposium on Computational geometry10.1145/262839.262984(274-283)Online publication date: 1-Aug-1997
https://dl.acm.org/doi/10.1145/262839.262984

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

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

Approximating shortest paths on a convex polytope in three dimensions

An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions

An optimal-time algorithm for shortest paths on a convex polytope in three dimensions

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

Approximating shortest paths on a convex polytope in three dimensions

An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions

An optimal-time algorithm for shortest paths on a convex polytope in three dimensions

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

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations