On the public citation graph

Moving a disc between polygons

https://doi.org/10.1007/bf01759040
0 signed · 25 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.1007/bf02187890openalex-snapshot
AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segments
inferredcites →https://doi.org/10.1016/0020-0190(88)90203-7openalex-snapshot
A tight lower bound for the complexity of path-planning for a disc
inferredcites →https://doi.org/10.1016/0196-6774(85)90021-5openalex-snapshot
A “retraction” method for planning the motion of a disc
inferredcites →https://doi.org/10.1109/sfcs.1979.15openalex-snapshot
Efficient computation of continuous skeletons
inferredcites →https://doi.org/10.1137/0206043openalex-snapshot
Location of a Point in a Planar Subdivision and Its Applications
inferredcites →https://doi.org/10.1137/0210006openalex-snapshot
Generalization of Voronoi Diagrams in the Plane
inferredcites →https://doi.org/10.1137/0213024openalex-snapshot
Fast Algorithms for Finding Nearest Common Ancestors
inferredcites →https://doi.org/10.1137/0215023openalex-snapshot
Optimal Point Location in a Monotone Subdivision
inferredcites →https://doi.org/10.1145/10515.10549openalex-snapshot
A sweepline algorithm for Voronoi diagrams

What points at this work

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

inferred← citeshttps://doi.org/10.1002/mma.1670180105openalex-snapshot
Connectivity graphs on two‐dimensional surfaces and their application in robotics
inferred← citeshttps://doi.org/10.1007/3-540-54891-2_17openalex-snapshot
Dynamic Voronoi diagrams in motion planning
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-3-642-77810-0_28openalex-snapshot
Motion Planning in Dynamically Changing Environments: A Robust On-Line Approach
inferred← citeshttps://doi.org/10.1007/bf02716580openalex-snapshot
A compact piecewise-linear voronoi diagram for convex sites in the plane
inferred← citeshttps://doi.org/10.1007/bfb0113277openalex-snapshot
Dynamic voronoi diagrams in motion planning
inferred← citeshttps://doi.org/10.1016/j.comgeo.2005.11.007openalex-snapshot
The visibility–Voronoi complex and its applications
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)48602-2openalex-snapshot
Connectivity Graphs on Two-Dimensional Surfaces and Their Application in Robotics †
inferred← citeshttps://doi.org/10.1080/2165347x.2013.872586openalex-snapshot
The Minimum Energy Expenditure Shortest Path Method
inferred← citeshttps://doi.org/10.1109/itsc.2001.948834openalex-snapshot
Conflict detection and planar resolution for air traffic control
inferred← citeshttps://doi.org/10.1109/robot.2010.5509263openalex-snapshot
Planning short paths with clearance using explicit corridors
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366829openalex-snapshot
A compact piecewise-linear Voronoi diagram for convex sites in the plane
inferred← citeshttps://doi.org/10.1145/1064092.1064104openalex-snapshot
The visibility--voronoi complex and its applications
inferred← citeshttps://doi.org/10.1145/160985.161170openalex-snapshot
Moving a disc between polygons
inferred← citeshttps://doi.org/10.1145/177424.178100openalex-snapshot
GASP
inferred← citeshttps://doi.org/10.2312/pe.vriphys.vriphys13.035-039openalex-snapshot
Rethinking Shortest Path: An Energy Expenditure Approach
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.