On the public citation graph
An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane
0 signed · 123 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/bf01530888openalex-snapshot
A new algorithm for shortest paths among obstacles in the plane
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.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(86)90045-1openalex-snapshot
Shortest paths in the plane with convex polygonal obstacles
inferredcites →https://doi.org/10.1016/0022-0000(89)90041-xopenalex-snapshot
Optimal shortest path queries in a simple polygon
inferredcites →https://doi.org/10.1016/s0019-9958(85)80044-9openalex-snapshot
Fast triangulation of the plane with respect to simple polygons
inferredcites →https://doi.org/10.1109/sfcs.1993.366836openalex-snapshot
Efficient computation of Euclidean shortest paths in the plane
inferredcites →https://doi.org/10.1137/0215014openalex-snapshot
On Shortest Paths in Polyhedral Spaces
inferredcites →https://doi.org/10.1137/0220055openalex-snapshot
An Output-Sensitive Algorithm for Computing Visibility Graphs
inferredcites →https://doi.org/10.1142/s0218195994000252openalex-snapshot
TRIANGULATING DISJOINT JORDAN CHAINS
inferredcites →https://doi.org/10.1142/s0218195996000216openalex-snapshot
SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
inferredcites →https://doi.org/10.1145/185675.185795openalex-snapshot
Shortest paths in the plane with polygonal obstacles
inferredcites →https://doi.org/10.1145/28869.28874openalex-snapshot
Fibonacci heaps and their uses in improved network optimization algorithms
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.1201/9781420035315.ch27openalex-snapshot
Shortest Paths and Networks
inferredcites →https://doi.org/10.22028/d291-26128openalex-snapshot
New algorithms for shortest paths avoiding convex polygonal obstacles
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/nme.1144openalex-snapshot
Volume determination for bulk materials in bunkers
inferred← citeshttps://doi.org/10.1006/cviu.1996.0041openalex-snapshot
Image Analysis and Computer Vision: 1995
inferred← citeshttps://doi.org/10.1006/cviu.1998.0697openalex-snapshot
Image Analysis and Computer Vision: 1997
inferred← citeshttps://doi.org/10.1007/978-0-387-88843-9_18openalex-snapshot
Optimizing Paths in the Presence of Spherical Impediments
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-1-4939-2864-4_509openalex-snapshot
Geometric Shortest Paths in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-030-04651-4_12openalex-snapshot
Computing a Rectilinear Shortest Path amid Splinegons in Plane
inferred← citeshttps://doi.org/10.1007/978-3-030-58150-3_11openalex-snapshot
Visibility Polygon Queries Among Dynamic Polygonal Obstacles in Plane
inferred← citeshttps://doi.org/10.1007/978-3-030-92681-6_1openalex-snapshot
Routing Among Convex Polygonal Obstacles in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-031-34347-6_17openalex-snapshot
Maximal Distortion of Geodesic Diameters in Polygonal Domains
inferred← citeshttps://doi.org/10.1007/978-3-540-68880-8_20openalex-snapshot
Shortest Path Queries in Polygonal Domains
inferred← citeshttps://doi.org/10.1007/978-3-540-69311-6_26openalex-snapshot
Visiting a Polygon on the Optimal Way to a Query Point
inferred← citeshttps://doi.org/10.1007/978-3-540-77050-3_34openalex-snapshot
Finding a Rectilinear Shortest Path in R 2 Using Corridor Based Staircase Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_41openalex-snapshot
A Nearly Optimal Algorithm for Finding L 1 Shortest Paths among Polygonal Obstacles in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_15-2openalex-snapshot
Applications of Geometric Spanner Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_509-1openalex-snapshot
Geometric Shortest Paths in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_19openalex-snapshot
Computing the Visibility Polygon of an Island in a Polygonal Domain
inferred← citeshttps://doi.org/10.1007/978-3-642-34203-5_17openalex-snapshot
Taxonomy of Navigation for First Responders
inferred← citeshttps://doi.org/10.1007/978-3-642-40104-6_22openalex-snapshot
Visibility and Ray Shooting Queries in Polygonal Domains
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_77openalex-snapshot
An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains
inferred← citeshttps://doi.org/10.1007/978-3-662-48971-0_4openalex-snapshot
Navigating Weighted Regions with Scattered Skinny Tetrahedra
inferred← citeshttps://doi.org/10.1007/s00453-015-0058-yopenalex-snapshot
Computing the Visibility Polygon of an Island in a Polygonal Domain
inferred← citeshttps://doi.org/10.1007/s00453-018-00540-xopenalex-snapshot
Computing $$L_1$$ Shortest Paths Among Polygonal Obstacles in the Plane
inferred← citeshttps://doi.org/10.1007/s00453-018-0446-1openalex-snapshot
An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains
inferred← citeshttps://doi.org/10.1007/s00454-016-9841-zopenalex-snapshot
Computing the $$L_1$$ Geodesic Diameter and Center of a Polygonal Domain
inferred← citeshttps://doi.org/10.1007/s00454-019-00108-8openalex-snapshot
Quickest Visibility Queries in Polygonal Domains
inferred← citeshttps://doi.org/10.1007/s10032-003-0103-2openalex-snapshot
Efficient polygon decomposition into singular and regular regions via Voronoi diagrams
inferred← citeshttps://doi.org/10.1007/s10707-014-0213-7openalex-snapshot
Querying visible points in large obstructed space
inferred← citeshttps://doi.org/10.1007/s10878-020-00524-0openalex-snapshot
Computing an $$L_1$$ shortest path among splinegonal obstacles in the plane
inferred← citeshttps://doi.org/10.1007/s10878-022-00846-1openalex-snapshot
Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane
inferred← citeshttps://doi.org/10.1007/s10878-026-01443-2openalex-snapshot
Routing among Convex Polygonal Obstacles in the Plane using a Simplified Domain
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.2009.02.004openalex-snapshot
Visibility queries in a polygonal region
inferred← citeshttps://doi.org/10.1016/j.comgeo.2009.02.005openalex-snapshot
Planar rectilinear shortest path computation using corridors
inferred← citeshttps://doi.org/10.1016/j.comgeo.2014.08.003openalex-snapshot
Visibility and ray shooting queries in polygonal domains
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.06.004openalex-snapshot
Shortest path planning for a tethered robot
inferred← citeshttps://doi.org/10.1016/j.comgeo.2019.101593openalex-snapshot
Routing in polygonal domains
inferred← citeshttps://doi.org/10.1016/j.ecolmodel.2010.03.019openalex-snapshot
A Voronoi diagram based population model for social species of wildlife
inferred← citeshttps://doi.org/10.1016/j.jestch.2021.03.002openalex-snapshot
Path planning of a mobile robot among curved obstacles through tangent drawing and trapezoidal decomposition
inferred← citeshttps://doi.org/10.1016/j.jvolgeores.2004.06.018openalex-snapshot
Numerical issues in plasticity models for granular materials
inferred← citeshttps://doi.org/10.1016/j.na.2005.10.049openalex-snapshot
Honey-pot constrained searching with local sensory information
inferred← citeshttps://doi.org/10.1016/j.robot.2005.03.003openalex-snapshot
VLSI-efficient schemes for high-speed construction of tangent graph
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.06.019openalex-snapshot
Touring a sequence of disjoint polygons: Complexity and extension
inferred← citeshttps://doi.org/10.1016/s0360-8352(03)00028-7openalex-snapshot
A global optimal approach to facility location in the presence of forbidden regions
inferred← citeshttps://doi.org/10.1080/01691864.2012.729559openalex-snapshot
Simplicial Dijkstra and A∗Algorithms: From Graphs to Continuous Spaces
inferred← citeshttps://doi.org/10.1080/0952813x.2012.741625openalex-snapshot
A framework of Voronoi diagram for planning multiple paths in free space
inferred← citeshttps://doi.org/10.1080/13658816.2010.518571openalex-snapshot
Modelling potential movement in constrained travel environments using rough space–time prisms
inferred← citeshttps://doi.org/10.1093/comjnl/bxr076openalex-snapshot
Minimizing the Range for k-Covered Paths on Sensor Networks
inferred← citeshttps://doi.org/10.1109/cdc.2003.1272863openalex-snapshot
Discrete approximations to continuous shortest-path: application to minimum-risk path planning for groups of UAVs
inferred← citeshttps://doi.org/10.1109/icacte.2010.5579834openalex-snapshot
Algorithm for finding geodesic path based on rotation tree
inferred← citeshttps://doi.org/10.1109/iccke.2017.8167897openalex-snapshot
Path planning in polygonal domains for robots with limited turning abilities
inferred← citeshttps://doi.org/10.1109/icpr.2000.903656openalex-snapshot
Efficient polygonal decomposition into singular and regular regions via Voronoi diagrams
inferred← citeshttps://doi.org/10.1109/infcom.2012.6195530openalex-snapshot
CitySee: Urban CO2 monitoring with sensors
inferred← citeshttps://doi.org/10.1109/iros.2011.6048681openalex-snapshot
Simplicial Dijkstra and A* algorithms for optimal feedback planning
inferred← citeshttps://doi.org/10.1109/iros.2011.6095032openalex-snapshot
Simplicial dijkstra and A* algorithms for optimal feedback planning
inferred← citeshttps://doi.org/10.1109/isvri.2011.5759626openalex-snapshot
Hierarchical Voronoi diagram-based path planning among polygonal obstacles for 3D virtual worlds
inferred← citeshttps://doi.org/10.1109/tmc.2011.176openalex-snapshot
OMAN: A Mobile Ad Hoc Network Design System
inferred← citeshttps://doi.org/10.1111/j.1467-8659.2009.01612.xopenalex-snapshot
Procedural Generation of Roads
inferred← citeshttps://doi.org/10.1115/1.4026183openalex-snapshot
Computation of the Shortest Path in a Bounded Domain With Free Form Boundary by Domain Partitioning
inferred← citeshttps://doi.org/10.1137/s0097539703434267openalex-snapshot
Optimal Covering Tours with Turn Costs
inferred← citeshttps://doi.org/10.1137/s0097539795253591openalex-snapshot
Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles
inferred← citeshttps://doi.org/10.1142/s0218195901000651openalex-snapshot
COMPUTATIONAL GEOMETRY COLUMN 42
inferred← citeshttps://doi.org/10.1142/s0218195902000724openalex-snapshot
KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS
inferred← citeshttps://doi.org/10.1142/s0218195905001889openalex-snapshot
EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS
inferred← citeshttps://doi.org/10.1142/s0218195917600020openalex-snapshot
Navigating Weighted Regions with Scattered Skinny Tetrahedra
inferred← citeshttps://doi.org/10.1145/1328911.1328921openalex-snapshot
Approximate distance oracles for geometric spanners
inferred← citeshttps://doi.org/10.1145/2462356.2462377openalex-snapshot
Computing shortest paths among curved obstacles in the plane
inferred← citeshttps://doi.org/10.1145/2493132.2462377openalex-snapshot
Computing shortest paths among curved obstacles in the plane
inferred← citeshttps://doi.org/10.1145/2580947openalex-snapshot
Dynamic and Robust Local Clearance Triangulations
inferred← citeshttps://doi.org/10.1145/2582112.2582125openalex-snapshot
Two-Point L1 Shortest Path Queries in the Plane
inferred← citeshttps://doi.org/10.1145/2660771openalex-snapshot
Computing Shortest Paths among Curved Obstacles in the Plane
inferred← citeshttps://doi.org/10.1145/336154.336219openalex-snapshot
Kinetic collision detection for simple polygons
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/997817.997825openalex-snapshot
Computing the visibility graph of points within a polygon
inferred← citeshttps://doi.org/10.1201/9781315370071-3openalex-snapshot
Efficient and Flexible Navigation Meshes for Virtual Worlds
inferred← citeshttps://doi.org/10.13016/m2vw24openalex-snapshot
Distributed Maze Solving By Cooperative Robotic Platforms
inferred← citeshttps://doi.org/10.20382/jocg.v6i1a14openalex-snapshot
A new algorithm for computing visibility graphs of polygonal obstacles in the plane
inferred← citeshttps://doi.org/10.21236/ada444427openalex-snapshot
Numerical Issues in Plasticity Models for Granular Flows
inferred← citeshttps://doi.org/10.22215/etd/2024-16080openalex-snapshot
Shortest Path Problems in Weighted Regions
inferred← citeshttps://doi.org/10.25904/1912/1694openalex-snapshot
The NP-Hardness of Covering Points with Lines, Paths and Tours and their Tractability with FPT-Algorithms
inferred← citeshttps://doi.org/10.3390/ijgi4042821openalex-snapshot
An Approach for Indoor Path Computation among Obstacles that Considers User Dimension
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.321-324.2260openalex-snapshot
An Identifier-Selection Method for Expressway Network Based on Toll Collection Accuracy of Multi-Path
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.94-96.1957openalex-snapshot
An Optimal Identifier-Selection Method Based on Recognition Probability of Expressway Network
inferred← citeshttps://doi.org/10.4230/lipics.isaac.2019.11openalex-snapshot
Approximate Euclidean Shortest Paths in Polygonal Domains
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2013.293openalex-snapshot
L_1 Shortest Path Queries among Polygonal Obstacles in the Plane
inferred← citeshttps://doi.org/10.48550/arxiv.1004.1588openalex-snapshot
Approximate Point-to-Face Shortest Paths in R^3
inferred← citeshttps://doi.org/10.48550/arxiv.1011.6481openalex-snapshot
A near optimal algorithm for finding Euclidean shortest path in polygonal domain
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.1504.06842openalex-snapshot
An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains
inferred← citeshttps://doi.org/10.48550/arxiv.1703.03048openalex-snapshot
Quickest Visibility Queries in Polygonal Domains
inferred← citeshttps://doi.org/10.48550/arxiv.1707.04578openalex-snapshot
An Efficient Approach to Communication-aware Path Planning for Long-range Surveillance Missions undertaken by UAVs
inferred← citeshttps://doi.org/10.48550/arxiv.2011.09925openalex-snapshot
Visibility Polygons and Visibility Graphs among Dynamic Polygonal Obstacles in the Plane
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.48550/arxiv.2109.11712openalex-snapshot
Feasibility study of urban flood mapping using traffic signs for route optimization
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0108021openalex-snapshot
Computational Geometry Column 42
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0309014openalex-snapshot
Optimal Covering Tours with Turn Costs
inferred← citeshttps://doi.org/10.5555/365411.365430openalex-snapshot
Optimal covering tours with turn costs
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.