On the public citation graph
Generalized Voronoi diagrams for a ladder: II. Efficient construction of the diagram
0 signed · 63 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/cpa.3160360305openalex-snapshot
On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers
inferredcites →https://doi.org/10.1007/978-1-4613-8997-2_22openalex-snapshot
Solving the Find-Path Problem by Good Representation of Free Space
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.1007/bf02579209openalex-snapshot
Almost linear upper bounds on the length of general davenport—schinzel sequences
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.1016/0196-8858(83)90014-3openalex-snapshot
On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds
inferredcites →https://doi.org/10.1109/sfcs.1979.15openalex-snapshot
Efficient computation of continuous skeletons
inferredcites →https://doi.org/10.1109/tsmc.1983.6313112openalex-snapshot
Solving the find-path problem by good representation of free space
inferredcites →https://doi.org/10.2307/2373068openalex-snapshot
A Combinatorial Problem Connected with Differential Equations
inferredcites →https://doi.org/10.4064/aa-17-4-363-372openalex-snapshot
A combinatorial problem connected with differential equations II
inferredcites →https://doi.org/10.4064/aa-25-2-213-224openalex-snapshot
On a problem of Davenport and Schinzel
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/978-1-4613-8997-2_26openalex-snapshot
An Automatic Motion Planning System for a Convex Polygonal Mobile Robot in 2-Dimensional Polygonal Space
inferred← citeshttps://doi.org/10.1007/978-3-319-16595-0_21openalex-snapshot
Resolution-Exact Algorithms for Link Robots
inferred← citeshttps://doi.org/10.1007/978-3-642-58043-7_2openalex-snapshot
Combinatorics and Algorithms of Arrangements
inferred← citeshttps://doi.org/10.1007/978-3-642-83539-1_9openalex-snapshot
Davenport-Schinzel Sequences and their Geometric Applications
inferred← citeshttps://doi.org/10.1007/978-94-011-2648-9_5openalex-snapshot
Robot Motion Planning: A Survey
inferred← citeshttps://doi.org/10.1007/bf01530886openalex-snapshot
On-line motion planning: Case of a planar rod
inferred← citeshttps://doi.org/10.1007/bf01530889openalex-snapshot
Coordinated motion planning for two independent robots
inferred← citeshttps://doi.org/10.1007/bf01553882openalex-snapshot
On the geodesic voronoi diagram of point sites in a simple polygon
inferred← citeshttps://doi.org/10.1007/bf01840368openalex-snapshot
A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space
inferred← citeshttps://doi.org/10.1007/bf02122559openalex-snapshot
Improved lower bounds on the length of Davenport-Schinzel sequences
inferred← citeshttps://doi.org/10.1007/bf02187683openalex-snapshot
On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
inferred← citeshttps://doi.org/10.1007/bf02187744openalex-snapshot
On the general motion-planning problem with two degrees of freedom
inferred← citeshttps://doi.org/10.1007/bf02187779openalex-snapshot
An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space
inferred← citeshttps://doi.org/10.1007/bf02187890openalex-snapshot
AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segments
inferred← citeshttps://doi.org/10.1007/bf02187894openalex-snapshot
Planar realizations of nonlinear davenport-schinzel sequences by segments
inferred← citeshttps://doi.org/10.1007/bf02367771openalex-snapshot
Construction of optimal programmed paths for the motion of a robotic manipulator
inferred← citeshttps://doi.org/10.1007/bf02733466openalex-snapshot
Stability of solutions in problems of computing geometry
inferred← citeshttps://doi.org/10.1007/pl00009455openalex-snapshot
Motion Planning for a Convex Polygon in a Polygonal Environment
inferred← citeshttps://doi.org/10.1016/0004-3702(88)90053-7openalex-snapshot
A survey of motion planning and related geometric algorithms
inferred← citeshttps://doi.org/10.1016/0097-3165(89)90032-0openalex-snapshot
Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
inferred← citeshttps://doi.org/10.1016/0196-6774(87)90038-1openalex-snapshot
An efficient and simple motion planning algorithm for a ladder amidst polygonal barriers
inferred← citeshttps://doi.org/10.1016/0196-6774(89)90026-6openalex-snapshot
Finding feasible paths for a two-point body
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00191-kopenalex-snapshot
An augmented Voronoi roadmap for 3D translational motion planning for a convex polyhedron moving amidst convex polyhedral obstacles
inferred← citeshttps://doi.org/10.1016/0925-7721(93)90001-mopenalex-snapshot
A convex polygon among polygonal obstacles: placement and high-clearance motion
inferred← citeshttps://doi.org/10.1016/0952-1976(93)90036-wopenalex-snapshot
A new heuristic approach to the robot free-path problem by stepwise path improvement
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50013-8openalex-snapshot
Algorithmic Motion Planning in Robotics
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50006-1openalex-snapshot
Voronoi Diagrams**Partially supported by the Deutsche Forschungsgemeinschaft, grant K1 655 2-2.
inferred← citeshttps://doi.org/10.1016/j.aej.2020.03.045openalex-snapshot
Intelligent traffic analysis: A heuristic high-dimensional image search algorithm based on spatiotemporal probability for constrained environments
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.04.002openalex-snapshot
On soft predicates in subdivision motion planning
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80124-0openalex-snapshot
Chapter 7 A survey of computational geometry
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/03052159908941294openalex-snapshot
FUZZY-GENETIC ALGORITHMS AND TIME-OPTIMAL OBSTACLE-FREE PATH GENERATION FOR MOBILE ROBOTS
inferred← citeshttps://doi.org/10.1109/2.16221openalex-snapshot
Algorithmic motion planning in robotics
inferred← citeshttps://doi.org/10.1109/34.295902openalex-snapshot
Collision detection of a moving polygon in the presence of polygonal obstacles in the plane
inferred← citeshttps://doi.org/10.1109/3468.686708openalex-snapshot
Two algorithms for a reachability problem in one-dimensional space
inferred← citeshttps://doi.org/10.1109/sfcs.1986.23openalex-snapshot
Geometric applications of Davenport-Schinzel sequences
inferred← citeshttps://doi.org/10.1109/sfcs.1986.43openalex-snapshot
Planar realizations of nonlinear Davenport-Schinzel sequences by segments
inferred← citeshttps://doi.org/10.1109/sfcs.1987.44openalex-snapshot
On the lower envelope of bivariate functions and its applications
inferred← citeshttps://doi.org/10.1145/10515.10535openalex-snapshot
A new efficient motion-planning algorithm for a rod in polygonal space
inferred← citeshttps://doi.org/10.1145/116873.116880openalex-snapshot
Voronoi diagrams—a survey of a fundamental geometric data structure
inferred← citeshttps://doi.org/10.1145/237218.237394openalex-snapshot
d 1 -optimal motion for a rod (extended abstract)
inferred← citeshttps://doi.org/10.1145/2462356.2462386openalex-snapshot
On soft predicates in subdivision motion planning
inferred← citeshttps://doi.org/10.1145/41958.41963openalex-snapshot
On the geodesic Voronoi diagram of point sites in a simple polygon
inferred← citeshttps://doi.org/10.1145/513400.513422openalex-snapshot
Pseudo approximation algorithms, with applications to optimal motion planning
inferred← citeshttps://doi.org/10.1145/73393.73426openalex-snapshot
Coordinated motion planning for two independent robots
inferred← citeshttps://doi.org/10.1145/73393.73427openalex-snapshot
An automatic motion planning system for a convex polygonal mobile robot in 2-dimensional polygonal space
inferred← citeshttps://doi.org/10.31274/rtd-180813-10480openalex-snapshot
Collision-free path planning
inferred← citeshttps://doi.org/10.3233/aic-1993-6101openalex-snapshot
From Geometric Motion Planning to Neural Motor Control in Robotics
inferred← citeshttps://doi.org/10.5555/1070432.1070502openalex-snapshot
Pianos are not flat: rigid motion planning in three dimensions
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.