On the public citation graph

Shortest paths on polyhedral surfaces

https://doi.org/10.1007/bfb0024013
0 signed · 45 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1017/cbo9780511779534openalex-snapshot
Graphs, Surfaces and Homology
inferredcites →https://doi.org/10.1137/0215014openalex-snapshot
On Shortest Paths in Polyhedral Spaces
inferredcites →https://doi.org/10.1145/359156.359164openalex-snapshot
An algorithm for planning collision-free paths among polyhedral obstacles
inferredcites →https://doi.org/10.1145/800057.808676openalex-snapshot
On shortest paths in polyhedral spaces
inferredcites →https://doi.org/10.21236/ada166246openalex-snapshot
On Finding Shortest Paths on Convex Polyhedra.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-17179-7_9openalex-snapshot
Shortest-path motion
inferred← citeshttps://doi.org/10.1007/978-3-319-09779-4_4openalex-snapshot
Visibility-Based Optimal Path Planning
inferred← citeshttps://doi.org/10.1007/978-3-642-84574-1_39openalex-snapshot
Shortest Paths in 3-Space, Voronoi Diagrams with Barriers, and Related Complexity and Algebraic Issues
inferred← citeshttps://doi.org/10.1007/bf01898357openalex-snapshot
Voronoi diagrams with barriers and on polyhedra for minimal path planning
inferred← citeshttps://doi.org/10.1007/bfb0017133openalex-snapshot
3-dimensional shortest paths in the presence of polyhedral obstacles
inferred← citeshttps://doi.org/10.1007/s00454-007-9031-0openalex-snapshot
An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions
inferred← citeshttps://doi.org/10.1007/s00454-009-9136-8openalex-snapshot
An Optimal-Time Algorithm for Shortest Paths on Realistic Polyhedra
inferred← citeshttps://doi.org/10.1016/0004-3702(88)90054-9openalex-snapshot
An algorithmic approach to some problems in terrain navigation
inferred← citeshttps://doi.org/10.1016/j.comgeo.2011.05.006openalex-snapshot
A survey of geodesic paths on 3D surfaces
inferred← citeshttps://doi.org/10.1016/j.engappai.2024.108821openalex-snapshot
Obtaining the optimal shortest path between two points on a quasi-developable Bézier-type surface using the Geodesic-based Q-learning algorithm
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80124-0openalex-snapshot
Chapter 7 A survey of computational geometry
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)59974-7openalex-snapshot
Locus Techniques for Shortest Path Problems in Robotics
inferred← citeshttps://doi.org/10.1023/a:1023660608695openalex-snapshot
Optimal Path Planning Based on Visibility
inferred← citeshttps://doi.org/10.1109/34.35505openalex-snapshot
Computing minimal distances on polyhedral surfaces
inferred← citeshttps://doi.org/10.1109/34.35506openalex-snapshot
A numerical solution to the generalized mapmaker's problem: flattening nonconvex polyhedral surfaces
inferred← citeshttps://doi.org/10.1109/70.56665openalex-snapshot
Path planning in the presence of vertical obstacles
inferred← citeshttps://doi.org/10.1109/70.781966openalex-snapshot
Motion planning in R/sup 3/ for multiple tethered robots
inferred← citeshttps://doi.org/10.1109/iccda.2010.5540779openalex-snapshot
Fast approximation of geodesic based on heuristic estimate
inferred← citeshttps://doi.org/10.1109/iccre.2016.7476149openalex-snapshot
Shortest path-planning on polygonal surfaces with O (nlog n) time
inferred← citeshttps://doi.org/10.1109/tpami.2008.213openalex-snapshot
Exact Geodesics and Shortest Paths on Polyhedral Surfaces
inferred← citeshttps://doi.org/10.1137/0216045openalex-snapshot
The Discrete Geodesic Problem
inferred← citeshttps://doi.org/10.1142/s0218195999000297openalex-snapshot
COMPUTATIONAL GEOMETRY COLUMN 35
inferred← citeshttps://doi.org/10.1145/1137856.1137862openalex-snapshot
An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
inferred← citeshttps://doi.org/10.1145/1247069.1247081openalex-snapshot
Shortest paths on realistic polyhedra
inferred← citeshttps://doi.org/10.1145/136035.136037openalex-snapshot
Gross motion planning—a survey
inferred← citeshttps://doi.org/10.1145/152992.152994openalex-snapshot
Computational geometry column 18
inferred← citeshttps://doi.org/10.1145/185675.185811openalex-snapshot
A single-exponential upper bound for finding shortest paths in three dimensions
inferred← citeshttps://doi.org/10.1145/262839.262984openalex-snapshot
Approximating weighted shortest paths on polyhedral surfaces
inferred← citeshttps://doi.org/10.1145/41958.41976openalex-snapshot
Compliant motion planning with geometric models
inferred← citeshttps://doi.org/10.1145/42282.214094openalex-snapshot
On the shortest paths between two convex polyhedra
inferred← citeshttps://doi.org/10.1145/568547.568559openalex-snapshot
Computational geometry column 35
inferred← citeshttps://doi.org/10.1177/027836498800700105openalex-snapshot
Generalized Unfoldings for Shortest Paths
inferred← citeshttps://doi.org/10.1360/n112014-00018openalex-snapshot
网格模型上的离散测地线
inferred← citeshttps://doi.org/10.14711/thesis-b1115261openalex-snapshot
Finding shortest gentle paths
inferred← citeshttps://doi.org/10.21236/ada210015openalex-snapshot
Computing Minimal Distances on Arbitrary Polyhedral Surfaces
inferred← citeshttps://doi.org/10.32657/10356/143580openalex-snapshot
Parallel discrete geodesic algorithms
inferred← citeshttps://doi.org/10.4224/16931693openalex-snapshot
Geodesic Paths On 3D Surfaces: Survey and Open Problems
inferred← citeshttps://doi.org/10.48550/arxiv.2007.10430openalex-snapshot
A Survey of Algorithms for Geodesic Paths and Distances
inferred← citeshttps://doi.org/10.5220/0005260903710378openalex-snapshot
Faster Approximations of Shortest Geodesic Paths on Polyhedra Through Adaptive Priority Queue
inferred← citeshttps://doi.org/10.68381/jca26060openalex-snapshot
Shortest Paths along a Sequence of Line Segments in Euclidean Spaces
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.