On the public citation graph
A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment
0 signed · 41 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.1007/978-3-642-58043-7_2openalex-snapshot
Combinatorics and Algorithms of Arrangements
inferredcites →https://doi.org/10.1007/978-3-642-83539-1_9openalex-snapshot
Davenport-Schinzel Sequences and their Geometric Applications
inferredcites →https://doi.org/10.1007/bf02123007openalex-snapshot
Triangles in space or building (and analyzing) castles in the air
inferredcites →https://doi.org/10.1007/bf02187779openalex-snapshot
An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space
inferredcites →https://doi.org/10.1007/bf02187883openalex-snapshot
On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space
inferredcites →https://doi.org/10.1007/bf02570705openalex-snapshot
On lazy randomized incremental construction
inferredcites →https://doi.org/10.1007/bf02570714openalex-snapshot
Almost tight upper bounds for the single cell and zone problems in three dimensions
inferredcites →https://doi.org/10.1016/0925-7721(93)90001-mopenalex-snapshot
A convex polygon among polygonal obstacles: placement and high-clearance motion
inferredcites →https://doi.org/10.1016/0925-7721(94)90011-6openalex-snapshot
External polygon containment problems
inferredcites →https://doi.org/10.1016/s0747-7171(08)80070-3openalex-snapshot
On the two-dimensional davenport-schinzel problem
inferredcites →https://doi.org/10.1090/s0894-0347-1988-0928904-4openalex-snapshot
Rotation distance, triangulations, and hyperbolic geometry
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1145/103418.103470openalex-snapshot
Approximations and optimal geometric divide-and-conquer
inferredcites →https://doi.org/10.1145/177424.177436openalex-snapshot
Almost tight upper bounds for the single cell and zone problems in three dimensions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/cviu.1997.0602openalex-snapshot
Image Analysis and Computer Vision: 1996
inferred← citeshttps://doi.org/10.1007/3-540-46691-6_1openalex-snapshot
Recent Developments in the Theory of Arrangements of Surfaces
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_42openalex-snapshot
Motion Planning via Manifold Samples
inferred← citeshttps://doi.org/10.1007/978-3-642-36279-8_19openalex-snapshot
On the Power of Manifold Samples in Exploring Configuration Spaces and the Dimensionality of Narrow Passages
inferred← citeshttps://doi.org/10.1007/978-3-642-41610-1_166-1openalex-snapshot
Complexity of Planning
inferred← citeshttps://doi.org/10.1007/pl00009319openalex-snapshot
Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces
inferred← citeshttps://doi.org/10.1007/s00453-012-9736-1openalex-snapshot
Motion Planning via Manifold Samples
inferred← citeshttps://doi.org/10.1007/s10514-018-9743-4openalex-snapshot
On the relationship between dynamics and complexity in multi-agent collision avoidance
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50003-6openalex-snapshot
Arrangements and Their Applications**Work by PA. was supported by Army Research Office MURI grant DAAH04-96-1-0013, by a Sloan fellowship, by an NYI award, and by a grant from the U.S.–Israeli Binational Science Foundation. Work by M.S. was supported by NSF Grants CCR-91-22103 and CCR-93-11127, by…
inferred← citeshttps://doi.org/10.1016/j.cad.2011.06.021openalex-snapshot
Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space
inferred← citeshttps://doi.org/10.1090/conm/453/08794openalex-snapshot
State of the union (of geometric objects)
inferred← citeshttps://doi.org/10.1109/coase.2017.8256076openalex-snapshot
On the separation of a polyhedron from its single-part mold
inferred← citeshttps://doi.org/10.1109/icra55743.2025.11127599openalex-snapshot
Asymptotically-Optimal Multi-Query Path Planning for a Polygonal Robot
inferred← citeshttps://doi.org/10.1109/tase.2014.2331983openalex-snapshot
On the Power of Manifold Samples in Exploring Configuration Spaces and the Dimensionality of Narrow Passages
inferred← citeshttps://doi.org/10.1137/s0097539793250755openalex-snapshot
The Union of Convex Polyhedra in Three Dimensions
inferred← citeshttps://doi.org/10.1145/1839778.1839780openalex-snapshot
Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space
inferred← citeshttps://doi.org/10.1177/02783649922067753openalex-snapshot
Motion Planning: A Journey of Robots, Molecules, Digital Actors, and Other Artifacts
inferred← citeshttps://doi.org/10.15607/rss.2016.xii.030openalex-snapshot
A Novel Relationship Between Dynamics and Complexity in Multi-agent Collision Avoidance
inferred← citeshttps://doi.org/10.25100/iyc.v2i2.2340openalex-snapshot
Sobre los Algoritmos de Planificación del Movimiento de Robots
inferred← citeshttps://doi.org/10.48550/arxiv.1607.02770openalex-snapshot
Sampling-based bottleneck pathfinding with applications to Frechet matching
inferred← citeshttps://doi.org/10.48550/arxiv.1708.04203openalex-snapshot
Optimal Algorithms for Separating a Polyhedron from Its Single-Part Mold
inferred← citeshttps://doi.org/10.5539/cis.v4n2p102openalex-snapshot
A Novel Implementation of G-Fuzzy Logic Controller Algorithm on Mobile Robot Motion Planning Problem
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.