On the public citation graph
Motion Planning for a Convex Polygon in a Polygonal Environment
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.1006/jagm.1994.1038openalex-snapshot
Applications of Parametric Searching in Geometric Optimization
inferredcites →https://doi.org/10.1007/3-540-51683-2_25openalex-snapshot
A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles
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/bf01758854openalex-snapshot
Quasi-optimal upper bounds for simplex range searching and new zone theorems
inferredcites →https://doi.org/10.1007/bf01840348openalex-snapshot
Generalized Voronoi diagrams for a ladder: II. Efficient construction of the diagram
inferredcites →https://doi.org/10.1007/bf01840368openalex-snapshot
A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space
inferredcites →https://doi.org/10.1007/bf02187740openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1007/bf02187867openalex-snapshot
Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams
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/bf02712871openalex-snapshot
Efficient randomized algorithms for some geometric optimization problems
inferredcites →https://doi.org/10.1007/bfb0015247openalex-snapshot
Algorithmic techniques for geometric optimization
inferredcites →https://doi.org/10.1007/bfb0015744openalex-snapshot
A fast algorithm for polygon containment by translation
inferredcites →https://doi.org/10.1007/pl00009337openalex-snapshot
Largest Placement of One Convex Polygon Inside Another
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.1093/comjnl/36.5.504openalex-snapshot
Computing Roadmaps of General Semi-Algebraic Sets
inferredcites →https://doi.org/10.1109/robot.1988.12304openalex-snapshot
A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles
inferredcites →https://doi.org/10.1137/0221020openalex-snapshot
Efficient Point Location in a Convex Spatial Cell-Complex
inferredcites →https://doi.org/10.1137/0221035openalex-snapshot
Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number
inferredcites →https://doi.org/10.1137/0222077openalex-snapshot
Computing a Face in an Arrangement of Line Segments and Related Problems
inferredcites →https://doi.org/10.1137/s0097539793250755openalex-snapshot
The Union of Convex Polyhedra in Three Dimensions
inferredcites →https://doi.org/10.1137/s0097539794265724openalex-snapshot
Computing Envelopes in Four Dimensions with Applications
inferredcites →https://doi.org/10.1145/109648.109668openalex-snapshot
Extremal polygon containment problems
inferredcites →https://doi.org/10.1145/177424.177445openalex-snapshot
On translational motion planning in 3-space
inferredcites →https://doi.org/10.1145/177424.177574openalex-snapshot
Spheres, molecules, and hidden surface removal
inferredcites →https://doi.org/10.1145/195058.195113openalex-snapshot
On lazy randomized incremental construction
inferredcites →https://doi.org/10.1145/2157.322410openalex-snapshot
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
inferredcites →https://doi.org/10.1145/220279.220299openalex-snapshot
The overlay of lower envelopes in three dimensions and its applications
inferredcites →https://doi.org/10.1145/323233.323262openalex-snapshot
An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers (extended abstract)
inferredcites →https://doi.org/10.1145/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4166610openalex-extracted
Largest Similar Copies of Convex Polygons in Polygonal Domains
inferred← citeshttps://doi.org/10.1002/rob.20285openalex-snapshot
Differentially constrained mobile robot motion planning in state lattices
inferred← citeshttps://doi.org/10.1006/cviu.2000.0835openalex-snapshot
Image Analysis and Computer Vision: 1999
inferred← citeshttps://doi.org/10.1007/978-1-4471-4282-9openalex-snapshot
From Linear Operators to Computational Biology
inferred← citeshttps://doi.org/10.1007/978-1-4471-4282-9_6openalex-snapshot
Jack Schwartz and Robotics: The Roaring Eighties
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_6openalex-snapshot
Randomized Algorithms for Geometric Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_5openalex-snapshot
Stabbing Convex Polygons with a Segment or a Polygon
inferred← citeshttps://doi.org/10.1007/pl00009337openalex-snapshot
Largest Placement of One Convex Polygon Inside Another
inferred← citeshttps://doi.org/10.1007/s00454-006-1263-xopenalex-snapshot
On the Union of κ-Round Objects in Three and Four Dimensions
inferred← citeshttps://doi.org/10.1007/s004540010064openalex-snapshot
Pipes, Cigars, and Kreplach: the Union of Minkowski Sums in Three Dimensions
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50002-4openalex-snapshot
Davenport–Schinzel Sequences and Their Geometric Applications**Both authors have been supported by a grant from the U.S.–Israeli Binational Science Foundation. Pankaj Agarwal has also been supported by a National Science Foundation Grant CCR-93–01259, by an Army Research Office MURI grant…
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.comgeo.2011.01.001openalex-snapshot
Witness (Delaunay) graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115685openalex-snapshot
Largest similar copies of convex polygons in polygonal domains
inferred← citeshttps://doi.org/10.1016/s0925-7721(99)00006-1openalex-snapshot
Rotational polygon containment and minimum enclosure using only robust 2D constructions
inferred← citeshttps://doi.org/10.1017/cbo9780511546877.008openalex-snapshot
Combinatorial Motion Planning
inferred← citeshttps://doi.org/10.1109/icde.2012.44openalex-snapshot
A Foundation for Efficient Indoor Distance-Aware Query Processing
inferred← citeshttps://doi.org/10.1109/icra.2018.8460665openalex-snapshot
An Automated Reactive Approach to Single Robot Exogeneous Planar Assembly
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/tro.2004.829479openalex-snapshot
A Geometric Method for Determining Intersection Relations Between a Movable Convex Object and a Set of Planar Polygons
inferred← citeshttps://doi.org/10.1137/1.9781611977073.124openalex-snapshot
Polygon Placement Revisited: (Degree of Freedom + 1)-SUM Hardness and an Improvement via Offline Dynamic Rectangle Union
inferred← citeshttps://doi.org/10.1145/262839.262996openalex-snapshot
Rotational polygon overlap minimization
inferred← citeshttps://doi.org/10.1145/276884.276885openalex-snapshot
Rotational polygon containment and minimum enclosure
inferred← citeshttps://doi.org/10.1145/299917.299918openalex-snapshot
Efficient algorithms for geometric optimization
inferred← citeshttps://doi.org/10.1145/997817.997875openalex-snapshot
On the union of κ-round objects
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2021.19openalex-snapshot
Largest Similar Copies of Convex Polygons in Polygonal Domains
inferred← citeshttps://doi.org/10.48550/arxiv.1709.06601openalex-snapshot
Parameterization of configuration space obstacles in three-dimensional rotational motion planning
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.