On the public citation graph
A new algorithm for shortest paths among obstacles in the plane
0 signed · 80 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/net.3230140304openalex-snapshot
Euclidean shortest paths in the presence of rectilinear barriers
inferredcites →https://doi.org/10.1007/978-3-662-09438-9openalex-snapshot
Principles of Artificial Intelligence
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/bf01553882openalex-snapshot
On the geodesic voronoi diagram of point sites in a simple polygon
inferredcites →https://doi.org/10.1007/bf01840360openalex-snapshot
Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
inferredcites →https://doi.org/10.1007/bf01928918openalex-snapshot
Visibility graphs and obstacle-avoiding shortest paths
inferredcites →https://doi.org/10.1007/bf02187744openalex-snapshot
On the general motion-planning problem with two degrees of freedom
inferredcites →https://doi.org/10.1007/bfb0017133openalex-snapshot
3-dimensional shortest paths in the presence of polyhedral obstacles
inferredcites →https://doi.org/10.1016/0004-3702(88)90054-9openalex-snapshot
An algorithmic approach to some problems in terrain navigation
inferredcites →https://doi.org/10.1016/0020-0190(85)90044-4openalex-snapshot
Constructing the visibility graph for n-line segments in O(n2) time
inferredcites →https://doi.org/10.1016/0020-0190(88)90022-1openalex-snapshot
Time and space efficient algorithms for shortest paths between convex polygons
inferredcites →https://doi.org/10.1109/sfcs.1987.42openalex-snapshot
New lower bound techniques for robot motion planning problems
inferredcites →https://doi.org/10.1109/sfcs.1987.6openalex-snapshot
An output sensitive algorithm for computing visibility graphs
inferredcites →https://doi.org/10.1109/tpami.1981.4767059openalex-snapshot
Principles of Artificial Intelligence
inferredcites →https://doi.org/10.1137/0215014openalex-snapshot
On Shortest Paths in Polyhedral Spaces
inferredcites →https://doi.org/10.1137/0215023openalex-snapshot
Optimal Point Location in a Monotone Subdivision
inferredcites →https://doi.org/10.1137/0220055openalex-snapshot
An Output-Sensitive Algorithm for Computing Visibility Graphs
inferredcites →https://doi.org/10.1145/282918.282923openalex-snapshot
Primitives for the manipulation of general subdivisions and the computation of Voronoi
inferredcites →https://doi.org/10.1145/28395.28402openalex-snapshot
Approximation algorithms for shortest path motion planning
inferredcites →https://doi.org/10.1145/41958.41985openalex-snapshot
Rectilinear shortest paths through polygonal obstacles in O ( n (log n ) 2 ) time
inferredcites →https://doi.org/10.1145/73393.73410openalex-snapshot
New methods for computing visibility graphs
inferredcites →https://doi.org/10.1145/73393.73411openalex-snapshot
Efficient algorithms for Euclidean shortest path and visibility problems with polygonal obstacles
inferredcites →https://doi.org/10.5957/jsr.1974.18.1.46openalex-snapshot
Minimum-Trajectory Pipe Routing
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/nav.21492openalex-snapshot
Optimal path finding in direction, location, and time dependent environments
inferred← citeshttps://doi.org/10.1002/nav.21702openalex-snapshot
An exact method for finding shortest routes on a sphere, avoiding obstacles
inferred← citeshttps://doi.org/10.1007/3-540-56279-6_53openalex-snapshot
Rectilinear paths among rectilinear obstacles
inferred← citeshttps://doi.org/10.1007/978-1-4614-6243-9_10openalex-snapshot
Dynamic Navigation in Direction-Dependent Environments
inferred← citeshttps://doi.org/10.1007/978-3-030-36412-0_14openalex-snapshot
Approximate Shortest Paths in Polygons with Violations
inferred← citeshttps://doi.org/10.1007/bf01758836openalex-snapshot
L 1 shortest paths among polygonal obstacles in the plane
inferred← citeshttps://doi.org/10.1007/bfb0028263openalex-snapshot
Finding optimal bipartitions of points and polygons
inferred← citeshttps://doi.org/10.1007/pl00009323openalex-snapshot
An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane
inferred← citeshttps://doi.org/10.1007/s00453-020-00673-yopenalex-snapshot
Shortest Paths in the Plane with Obstacle Violations
inferred← citeshttps://doi.org/10.1007/s00454-019-00108-8openalex-snapshot
Quickest Visibility Queries in Polygonal Domains
inferred← citeshttps://doi.org/10.1007/s10514-020-09917-wopenalex-snapshot
Planar max flow maps and determination of lanes with clearance
inferred← citeshttps://doi.org/10.1016/0166-218x(96)80467-7openalex-snapshot
Rectilinear paths among rectilinear obstacles
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50016-4openalex-snapshot
Geometric Shortest Paths and Network Optimization
inferred← citeshttps://doi.org/10.1016/j.comgeo.2019.101593openalex-snapshot
Routing in polygonal domains
inferred← citeshttps://doi.org/10.1016/j.ejor.2003.03.003openalex-snapshot
L1 cheapest paths in “Fjord Scenery”
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00408-4openalex-snapshot
Time-minimal paths amidst moving obstacles in three dimensions
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80124-0openalex-snapshot
Chapter 7 A survey of computational geometry
inferred← citeshttps://doi.org/10.1109/12.286304openalex-snapshot
On bends and distances of paths among obstacles in two-layer interconnection model
inferred← citeshttps://doi.org/10.1109/12.609280openalex-snapshot
The smallest pair of noncrossing paths in a rectilinear polygon
inferred← citeshttps://doi.org/10.1109/cdc.2009.5400828openalex-snapshot
On the general characteristics of 2D optimal obstacle-field guidance solution
inferred← citeshttps://doi.org/10.1109/infocom.2008.173openalex-snapshot
Light-Weight Contour Tracking in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/iros.2011.6094903openalex-snapshot
Foundations of formal language for humans and artificial systems based on intrinsic structure in spatial behavior
inferred← citeshttps://doi.org/10.1109/robot.1990.126289openalex-snapshot
Path planning by optimal-path-map construction for homogeneous-cost two-dimensional regions
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267794openalex-snapshot
Computing a shortest k-link path in a polygon
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366836openalex-snapshot
Efficient computation of Euclidean shortest paths in the plane
inferred← citeshttps://doi.org/10.1109/tvcg.2019.2904271openalex-snapshot
Optimal Path Maps on the GPU
inferred← citeshttps://doi.org/10.1117/12.25506openalex-snapshot
Algorithmic approaches to optimal route planning
inferred← citeshttps://doi.org/10.1137/110840030openalex-snapshot
Computing Shortest Paths amid Convex Pseudodisks
inferred← citeshttps://doi.org/10.1137/20m1384804openalex-snapshot
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon
inferred← citeshttps://doi.org/10.1137/s0097539795289604openalex-snapshot
An Optimal Algorithm for Euclidean Shortest Paths in the Plane
inferred← citeshttps://doi.org/10.1142/s0218195920500041openalex-snapshot
Approximate Shortest Paths in Polygons with Violations
inferred← citeshttps://doi.org/10.1145/1161089.1161104openalex-snapshot
Boundary recognition in sensor networks by topological methods
inferred← citeshttps://doi.org/10.1145/160985.161156openalex-snapshot
Shortest paths among obstacles in the plane
inferred← citeshttps://doi.org/10.1145/1824777.1824787openalex-snapshot
Geodesic delaunay triangulations in bounded planar domains
inferred← citeshttps://doi.org/10.1145/220279.220319openalex-snapshot
Shortest path queries among weighted obstacles in the rectilinear plane
inferred← citeshttps://doi.org/10.1145/2582112.2582125openalex-snapshot
Two-Point L1 Shortest Path Queries in the Plane
inferred← citeshttps://doi.org/10.1145/2614028.2615399openalex-snapshot
Navigation meshes and real-time dynamic planning for virtual worlds
inferred← citeshttps://doi.org/10.1145/2897826.2927310openalex-snapshot
Geometric and discrete path planning for interactive virtual worlds
inferred← citeshttps://doi.org/10.1145/336154.336182openalex-snapshot
On the continuous Weber and k -median problems (extended abstract)
inferred← citeshttps://doi.org/10.1145/3406325.3451037openalex-snapshot
A new algorithm for Euclidean shortest paths in the plane
inferred← citeshttps://doi.org/10.1145/3580475openalex-snapshot
A New Algorithm for Euclidean Shortest Paths in the Plane
inferred← citeshttps://doi.org/10.1145/98524.98595openalex-snapshot
Shortest rectilinear paths among weighted obstacles
inferred← citeshttps://doi.org/10.1287/opre.1040.0137openalex-snapshot
On the Continuous Fermat-Weber Problem
inferred← citeshttps://doi.org/10.15607/rss.2018.xiv.052openalex-snapshot
GPU-Based Max Flow Maps in the Plane
inferred← citeshttps://doi.org/10.1609/aiide.v8i3.12545openalex-snapshot
Adversarial Planning for Multi-Agent Pursuit-Evasion Games in Partially Observable Euclidean Space
inferred← citeshttps://doi.org/10.22215/etd/2016-11226openalex-snapshot
Discrete Geometric Path Analysis in Computational Geometry
inferred← citeshttps://doi.org/10.22215/etd/2019-13533openalex-snapshot
Shortest Paths Among Dynamic Obstacles
inferred← citeshttps://doi.org/10.48550/arxiv.1210.7638openalex-snapshot
Finding Efficient Region in The Plane with Line segments
inferred← citeshttps://doi.org/10.48550/arxiv.1403.3458openalex-snapshot
Two-Point $L_1$ Shortest Path Queries in the Plane
inferred← citeshttps://doi.org/10.48550/arxiv.1703.03048openalex-snapshot
Quickest Visibility Queries in Polygonal Domains
inferred← citeshttps://doi.org/10.48550/arxiv.1805.08500openalex-snapshot
Improved Shortest Path Maps with GPU Shaders
inferred← citeshttps://doi.org/10.48550/arxiv.2102.12589openalex-snapshot
A New Algorithm for Euclidean Shortest Paths in the Plane
inferred← citeshttps://doi.org/10.5555/2133036.2133062openalex-snapshot
Computing shortest paths amid pseudodisks
inferred← citeshttps://doi.org/10.55653/forma.2022.001.005openalex-snapshot
Spatial Distribution of Traffic Flow in a Rectangular City with a Grid Network and a Rectangular Barrier
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.