On the public citation graph
Computing minimum length paths of a given homotopy class
0 signed · 72 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.3230110307openalex-snapshot
Finding minimum rectilinear distance paths in the presence of barriers
inferredcites →https://doi.org/10.1002/net.3230140304openalex-snapshot
Euclidean shortest paths in the presence of rectilinear barriers
inferredcites →https://doi.org/10.1007/3-540-50335-8_24openalex-snapshot
On continuous homotopic one layer routing
inferredcites →https://doi.org/10.1007/3-540-52846-6_78openalex-snapshot
Translating polygons with applications to hidden surface removal
inferredcites →https://doi.org/10.1007/978-3-642-62035-5openalex-snapshot
An Introduction to the Geometry of Numbers
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/bf02187714openalex-snapshot
Rectilinear shortest paths in the presence of rectangular barriers
inferredcites →https://doi.org/10.1007/bf02187729openalex-snapshot
On separating two simple polygons by a single translation
inferredcites →https://doi.org/10.1016/0020-0190(72)90045-2openalex-snapshot
An efficient algorith for determining the convex hull of a finite planar set
inferredcites →https://doi.org/10.1016/0020-0190(91)90189-oopenalex-snapshot
The intersection searching problem for c-oriented polygons
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/0196-6774(91)90024-sopenalex-snapshot
Computing the visibility polygon from a convex set and related problems
inferredcites →https://doi.org/10.1016/0734-189x(86)90127-1openalex-snapshot
A linear time algorithm for minimum link paths inside a simple polygon
inferredcites →https://doi.org/10.1016/0890-5401(87)90045-9openalex-snapshot
Optimal computation of finitely oriented convex hulls
inferredcites →https://doi.org/10.1016/0890-5401(89)90049-7openalex-snapshot
Finding minimal convex nested polygons
inferredcites →https://doi.org/10.1016/b978-0-444-87806-9.50018-9openalex-snapshot
Movable Separability of Sets
inferredcites →https://doi.org/10.1016/s0734-189x(87)80114-7openalex-snapshot
New algorithms for special cases of the hidden line elimination problem
inferredcites →https://doi.org/10.1109/fscs.1990.89541openalex-snapshot
Triangulating a simple polygon in linear time
inferredcites →https://doi.org/10.1109/sfcs.1982.58openalex-snapshot
A theorem on polygon cutting with applications
inferredcites →https://doi.org/10.1109/sfcs.1987.6openalex-snapshot
An output sensitive algorithm for computing visibility graphs
inferredcites →https://doi.org/10.1145/22145.22153openalex-snapshot
Algorithms for routing and testing routability of planar VLSI layouts
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/41958.41985openalex-snapshot
Rectilinear shortest paths through polygonal obstacles in O ( n (log n ) 2 ) time
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.1145/73393.73433openalex-snapshot
On continuous Homotopic one layer routing
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-54945-5_59openalex-snapshot
Approximating polygons and subdivisions with minimum link paths
inferred← citeshttps://doi.org/10.1007/3-540-56287-7_96openalex-snapshot
Implicit point location in arrangements of line segments, with an application to motion planning
inferred← citeshttps://doi.org/10.1007/3-540-56503-5_29openalex-snapshot
Rectilinear path queries in a simple rectilinear polygon
inferred← citeshttps://doi.org/10.1007/3-540-63938-1_68openalex-snapshot
Implementing a general-purpose edge router
inferred← citeshttps://doi.org/10.1007/978-3-642-18638-7_6openalex-snapshot
Graphviz and Dynagraph — Static and Dynamic Graph Drawing Tools
inferred← citeshttps://doi.org/10.1007/bf02570717openalex-snapshot
Efficient piecewise-linear function approximation using the uniform metric
inferred← citeshttps://doi.org/10.1007/pl00009500openalex-snapshot
Efficient Algorithms for Approximating Polygonal Chains
inferred← citeshttps://doi.org/10.1007/s00454-003-2949-yopenalex-snapshot
Testing Homotopy for Paths in the Plane
inferred← citeshttps://doi.org/10.1007/s00454-004-1150-2openalex-snapshot
Optimal System of Loops on an Orientable Surface
inferred← citeshttps://doi.org/10.1007/s10472-018-9596-8openalex-snapshot
Path Homotopy Invariants and their Application to Optimal Trajectory Planning
inferred← citeshttps://doi.org/10.1007/s10514-012-9304-1openalex-snapshot
Topological constraints in search-based robot path planning
inferred← citeshttps://doi.org/10.1007/s10846-020-01247-4openalex-snapshot
Searching Multiple Approximate Solutions in Configuration Space to Guide Sampling-Based Motion Planning
inferred← citeshttps://doi.org/10.1016/0921-8890(95)00042-9openalex-snapshot
Landmark selection strategies for path execution
inferred← citeshttps://doi.org/10.1016/j.robot.2014.10.021openalex-snapshot
A comparison of homotopic path planning algorithms for robotic applications
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/cdc.2012.6425970openalex-snapshot
Optimal trajectory generation under homology class constraints
inferred← citeshttps://doi.org/10.1109/icar46387.2019.8981589openalex-snapshot
Computing multiple guiding paths for sampling-based motion planning
inferred← citeshttps://doi.org/10.1109/icra.2014.6906996openalex-snapshot
Path planning for a tethered mobile robot
inferred← citeshttps://doi.org/10.1109/icra.2019.8794192openalex-snapshot
Dynamic Channel: A Planning Framework for Crowd Navigation
inferred← citeshttps://doi.org/10.1109/iros.1993.583772openalex-snapshot
Landmark selection for path execution
inferred← citeshttps://doi.org/10.1109/iros.2013.6697226openalex-snapshot
Generation of diverse paths in 3D environments
inferred← citeshttps://doi.org/10.1109/iros.2015.7354040openalex-snapshot
Path planning for a tethered robot using Multi-Heuristic A* with topology-based heuristics
inferred← citeshttps://doi.org/10.1109/iros.2018.8594325openalex-snapshot
A Topology-Based Path Similarity Metric and its Application to Sampling-Based Motion Planning
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/smi.2009.5170145openalex-snapshot
Canonical homotopy class representative using hyperbolic structure
inferred← citeshttps://doi.org/10.1111/cgf.142632openalex-snapshot
Layout Embedding via Combinatorial Optimization
inferred← citeshttps://doi.org/10.1115/1.4055055openalex-snapshot
Toward Holistic Design of Spatial Packaging of Interconnected Systems With Physical Interactions (SPI2)
inferred← citeshttps://doi.org/10.1145/142675.142687openalex-snapshot
Optimal parallel algorithms for triangulated simple polygons
inferred← citeshttps://doi.org/10.1145/177424.178040openalex-snapshot
Efficient piecewise-linear function approximation using the uniform metric
inferred← citeshttps://doi.org/10.1145/276884.276935openalex-snapshot
A path router for graph drawing
inferred← citeshttps://doi.org/10.1145/3580475openalex-snapshot
A New Algorithm for Euclidean Shortest Paths in the Plane
inferred← citeshttps://doi.org/10.11606/d.45.2019.tde-22082019-134801openalex-snapshot
Single source shortest paths in simple polygons
inferred← citeshttps://doi.org/10.15607/rss.2011.vii.002openalex-snapshot
Identification and Representation of Homotopy Classes of Trajectories for Search-based Path Planning in 3D
inferred← citeshttps://doi.org/10.15607/rss.2013.ix.046openalex-snapshot
A Topological Approach to Using Cables to Separate and Manipulate Sets of Objects
inferred← citeshttps://doi.org/10.1609/aaai.v24i1.7735openalex-snapshot
Search-Based Path Planning with Homotopy Class Constraints
inferred← citeshttps://doi.org/10.1609/socs.v1i1.18155openalex-snapshot
Search-Based Path Planning with Homotopy Class Constraints
inferred← citeshttps://doi.org/10.22215/etd/2014-10404openalex-snapshot
Obstacle-Avoiding Path Existence Queries in a Simple Polygon
inferred← citeshttps://doi.org/10.22215/etd/2019-13533openalex-snapshot
Shortest Paths Among Dynamic Obstacles
inferred← citeshttps://doi.org/10.33915/etd.12209openalex-snapshot
Exploiting the Advantages and Overcoming the Challenges of the Cable in a Tethered Drone System
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0209007openalex-snapshot
A Survey and a New Competitive Method for the Planar min-# Problem
inferred← citeshttps://doi.org/10.52842/conf.ecaade.2014.1.053openalex-snapshot
Agents' movement_towards the reformation of public space - Step 1: select | implement | observe crowd rules
inferred← citeshttps://doi.org/10.5821/dissertation-2117-106282openalex-snapshot
A framework for navigation of autonomous characters in complex virtual environments
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.