On the public citation graph
Visibility graphs and obstacle-avoiding shortest paths
0 signed · 73 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-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/978-3-642-69897-2openalex-snapshot
Data Structures and Algorithms 2
inferredcites →https://doi.org/10.1007/978-3-642-69900-9openalex-snapshot
Data Structures and Algorithms 3
inferredcites →https://doi.org/10.1007/bf01840372openalex-snapshot
Optimal piecewise linear motion of an object among obstacles
inferredcites →https://doi.org/10.1016/0020-0190(85)90029-8openalex-snapshot
An algorithm for shortest-path motion in three dimensions
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/0196-6774(88)90003-xopenalex-snapshot
An O(n2) shortest path algorithm for a non-rotating convex body
inferredcites →https://doi.org/10.1109/sfcs.1987.1openalex-snapshot
A new algebraic method for robot motion planning and real geometry
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.1137/0215014openalex-snapshot
On Shortest Paths in Polyhedral Spaces
inferredcites →https://doi.org/10.1145/12130.12170openalex-snapshot
A linear-time algorithm for triangulating simple polygons
inferredcites →https://doi.org/10.1145/12130.12171openalex-snapshot
Topologically sweeping an arrangement
inferredcites →https://doi.org/10.1145/28395.28402openalex-snapshot
Approximation algorithms for shortest path motion planning
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/323233.323261openalex-snapshot
Planning the shortest path for a disc in O ( n 2 log n ) time
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/41958.41964openalex-snapshot
Optimal shortest path queries in a simple polygon
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.2307/2325168openalex-snapshot
Algorithms in Combinatorial Geometry.
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.1007/3-540-55488-2_20openalex-snapshot
Selected topics from computational geometry, data structures and motion planning
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-642-33218-0_3openalex-snapshot
A Two-level Path-finding Strategy for Indoor Navigation
inferred← citeshttps://doi.org/10.1007/bf01530888openalex-snapshot
A new algorithm for shortest paths among obstacles in the plane
inferred← citeshttps://doi.org/10.1007/bf01581725openalex-snapshot
A maximumb-matching problem arising from median location models with applications to the roommates problem
inferred← citeshttps://doi.org/10.1007/s10957-012-0248-6openalex-snapshot
Fastest-Path Planning for Direction-Dependent Speed Functions
inferred← citeshttps://doi.org/10.1007/s11067-013-9199-1openalex-snapshot
Maximising the Worth of Nascent Networks
inferred← citeshttps://doi.org/10.1007/s40314-016-0316-xopenalex-snapshot
A discrete mathematical model for the dynamics of a crowd of gazing pedestrians with and without an evolving environmental awareness
inferred← citeshttps://doi.org/10.1007/s42405-024-00726-4openalex-snapshot
Task Assignment for Multiple Multi-purpose Unmanned Aerial Vehicles Using Greedy Algorithm
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90092-3openalex-snapshot
Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs
inferred← citeshttps://doi.org/10.1016/0921-8890(91)90029-kopenalex-snapshot
A note on avoiding 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.cad.2012.12.003openalex-snapshot
Shortest path in a multiply-connected domain having curved boundaries
inferred← citeshttps://doi.org/10.1016/j.procs.2023.07.047openalex-snapshot
Shortest path graphs for semi-directed InDoor navigation
inferred← citeshttps://doi.org/10.1016/j.robot.2004.02.005openalex-snapshot
Mobile-robot navigation with complete coverage of unstructured environments
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70197-3openalex-snapshot
Chapter 6 Generalizations
inferred← citeshttps://doi.org/10.1016/s0305-0548(01)00078-8openalex-snapshot
Supply facility and input/output point locations in the presence of barriers
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/ccdc.2009.5192549openalex-snapshot
Study on adaptive planning strategy using ant colony algorithm based on predictive learning
inferred← citeshttps://doi.org/10.1109/iecon.2019.8927202openalex-snapshot
HLT*: Real-time and Any-angle Path Planning in 3D Environment
inferred← citeshttps://doi.org/10.1109/infcom.2009.5062091openalex-snapshot
Visibility-Graph-Based Shortest-Path Geographic Routing in Sensor Networks
inferred← citeshttps://doi.org/10.1109/iros.2018.8594209openalex-snapshot
Perception-Driven Sparse Graphs for Optimal Motion Planning
inferred← citeshttps://doi.org/10.1109/kse.2011.37openalex-snapshot
Some Advanced Techniques in Reducing Time for Path Planning Based on Visibility Graph
inferred← citeshttps://doi.org/10.1109/nca.2017.8171330openalex-snapshot
Constant stretch and load balanced routing protocol for bypassing multiple holes in wireless sensor networks
inferred← citeshttps://doi.org/10.1109/tnet.2011.2167758openalex-snapshot
Greedy Geographic Routing in Large-Scale Sensor Networks: A Minimum Network Decomposition Approach
inferred← citeshttps://doi.org/10.1117/12.25506openalex-snapshot
Algorithmic approaches to optimal route planning
inferred← citeshttps://doi.org/10.11361/journalcpij.42.3.457openalex-snapshot
A study on Voronoi diagrams with two-dimensional obstacles
inferred← citeshttps://doi.org/10.1142/s0219525912500294openalex-snapshot
MODELING THE DYNAMIC ROUTE CHOICE OF PEDESTRIANS TO ASSESS THE CRITICALITY OF BUILDING EVACUATION
inferred← citeshttps://doi.org/10.1145/1860093.1860116openalex-snapshot
Greedy geographic routing in large-scale sensor networks
inferred← citeshttps://doi.org/10.1145/3197517.3201284openalex-snapshot
Creating and chaining camera moves for quadrotor videography
inferred← citeshttps://doi.org/10.1145/3414685.3417791openalex-snapshot
Offsite aerial path planning for efficient urban scene reconstruction
inferred← citeshttps://doi.org/10.1145/3763292openalex-snapshot
Aerial Path Planning for Urban Geometry and Texture Co-Capture
inferred← citeshttps://doi.org/10.1575/1912/10824openalex-snapshot
Perception-driven optimal motion planning under resource constraints
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.3390/rs14153720openalex-snapshot
FPS: Fast Path Planner Algorithm Based on Sparse Visibility Graph and Bidirectional Breadth-First Search
inferred← citeshttps://doi.org/10.33965/ijcsis_2019140206openalex-snapshot
SOLUTION OF AN INTEGRATED TRAVELING SALESMAN AND COVERAGE PATH PLANNING PROBLEM BY USING A GENETIC ALGORITHM WITH MODIFIED OPERATORS
inferred← citeshttps://doi.org/10.3929/ethz-a-004696801openalex-snapshot
Obstacles in pedestrian simulations
inferred← citeshttps://doi.org/10.3934/jimo.2020044openalex-snapshot
Genetic algorithm for obstacle location-allocation problems with customer priorities
inferred← citeshttps://doi.org/10.4230/oasics.atmos.2015.1openalex-snapshot
Towards Realistic Pedestrian Route Planning
inferred← citeshttps://doi.org/10.48550/arxiv.1103.4080openalex-snapshot
Modelling dynamic route choice of pedestrians to assess the criticality of building evacuation
inferred← citeshttps://doi.org/10.5139/jksas.2010.38.5.427openalex-snapshot
Task Assignment of Multiple UAVs using MILP and GA
inferred← citeshttps://doi.org/10.55417/fr.2022029openalex-snapshot
Swarms of Pirates: Red Team Exercises using Autonomous High-Speed Maneuvering Surface Vessels
inferred← citeshttps://doi.org/10.70675/1bf1d2a1z83e3z40fbz9a62z51cd6594780eopenalex-snapshot
An ontology-based approach towards coupling task and path planning for the simulation of manipulation tasks
inferred← citeshttps://doi.org/10.7480/abe.2017.17openalex-snapshot
A+BE | Architecture and the Built Environment, No. 17 (2017): Indoor Semantic Modelling for Routing
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.