On the public citation graph
An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space
0 signed · 82 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.1002/cpa.3160390402openalex-snapshot
Generalized voronoi diagrams for moving a ladder. I: Topological analysis
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/bf02122559openalex-snapshot
Improved lower bounds on the length of Davenport-Schinzel sequences
inferredcites →https://doi.org/10.1007/bf02187683openalex-snapshot
On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
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/bf02579170openalex-snapshot
Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes
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-6774(87)90038-1openalex-snapshot
An efficient and simple motion planning algorithm for a ladder amidst polygonal barriers
inferredcites →https://doi.org/10.1016/0196-6774(88)90012-0openalex-snapshot
Solving the two-dimensional findpath problem using a line-triangle representation of the robot
inferredcites →https://doi.org/10.1109/sfcs.1983.1openalex-snapshot
A kinetic framework for computational geometry
inferredcites →https://doi.org/10.1145/323233.323244openalex-snapshot
An efficient algorithm for planning collision-free translational motion of a convex polygonal object in 2-dimensional space amidst polygonal obstacles
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.2139/ssrn.4166610openalex-extracted
Largest Similar Copies of Convex Polygons in Polygonal Domains
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/3-540-47738-1_28openalex-snapshot
On the complexity of the union of geometric objects
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_55openalex-snapshot
Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications
inferred← citeshttps://doi.org/10.1007/978-1-4612-0963-8_8openalex-snapshot
General Geometric Problems
inferred← citeshttps://doi.org/10.1007/978-1-4615-3176-0_5openalex-snapshot
Singularities and Topological Aspects in Nonholonomic Motion Planning
inferred← citeshttps://doi.org/10.1007/978-3-031-43111-1_13openalex-snapshot
Study of Path Planning Methods in Two-Dimensional Mapped Environments
inferred← citeshttps://doi.org/10.1007/978-3-032-20325-0_16openalex-snapshot
Potential Control Strategy of Mobile Robot in Dynamic Environment Based on Modified Bug Algorithm
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-77810-0_28openalex-snapshot
Motion Planning in Dynamically Changing Environments: A Robust On-Line Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-83957-3_30openalex-snapshot
Collision-Free Path Planning for a Reconfigurable Robot
inferred← citeshttps://doi.org/10.1007/bf00339662openalex-snapshot
Planning of collision-free paths for a reconfigurable dual manipulator equipped mobile robot
inferred← citeshttps://doi.org/10.1007/bf01258292openalex-snapshot
The complexity of the free space for motion planning amidst fat obstacles
inferred← citeshttps://doi.org/10.1007/bf01258293openalex-snapshot
Robot motion planning and the single cell problem in arrangements
inferred← citeshttps://doi.org/10.1007/bf01530889openalex-snapshot
Coordinated motion planning for two independent robots
inferred← citeshttps://doi.org/10.1007/bf01758853openalex-snapshot
Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
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/bf02573992openalex-snapshot
On the complexity of a single cell in certain arrangements of surfaces related to motion planning
inferred← citeshttps://doi.org/10.1007/bf02716803openalex-snapshot
A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment
inferred← citeshttps://doi.org/10.1007/bf02770875openalex-snapshot
On critical orientations in the kedem-sharir motion planning algorithm
inferred← citeshttps://doi.org/10.1007/pl00009345openalex-snapshot
How to Cut Pseudoparabolas into Segments
inferred← citeshttps://doi.org/10.1007/s11768-011-0272-3openalex-snapshot
A model-based approximate λ-policy iteration approach to online evasive path planning and the video game Ms. Pac-Man
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/0925-7721(92)90008-gopenalex-snapshot
Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom
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/0925-7721(93)90007-sopenalex-snapshot
The complexity of the free space for a robot moving amidst fat obstacles
inferred← citeshttps://doi.org/10.1016/0925-7721(94)90011-6openalex-snapshot
External polygon containment problems
inferred← citeshttps://doi.org/10.1016/1049-9660(91)90020-popenalex-snapshot
Image analysis and computer vision: 1990
inferred← citeshttps://doi.org/10.1016/b978-0-12-812305-8.00005-3openalex-snapshot
Graphic-Analytical Approaches to Vehicle's Motion Planning
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.tcs.2025.115685openalex-snapshot
Largest similar copies of convex polygons in polygonal domains
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)00030-8openalex-snapshot
Combinatorial complexity of translating a box in polyhedral 3-space
inferred← citeshttps://doi.org/10.1109/2.16221openalex-snapshot
Algorithmic motion planning in robotics
inferred← citeshttps://doi.org/10.1109/21.148422openalex-snapshot
Path planning for two planar robots moving in unknown environment
inferred← citeshttps://doi.org/10.1109/21.214789openalex-snapshot
Determining the collision-free joint space graph for two cooperating robot manipulators
inferred← citeshttps://doi.org/10.1109/71.980023openalex-snapshot
On computing the upper envelope of segments in parallel
inferred← citeshttps://doi.org/10.1109/cdc.2010.5717137openalex-snapshot
A cell decomposition approach to cooperative path planning and collision avoidance via disjunctive programming
inferred← citeshttps://doi.org/10.1109/iccas.2015.7364986openalex-snapshot
Research of graph-analytical methods for a vehicle motion planning
inferred← citeshttps://doi.org/10.1109/icpp.1998.708493openalex-snapshot
On computing the upper envelope of segments in parallel
inferred← citeshttps://doi.org/10.1109/iros.1990.262494openalex-snapshot
A motion planner for car-like robots based on a mixed global/local approach
inferred← citeshttps://doi.org/10.1109/isic.2011.6045414openalex-snapshot
A cell decomposition approach to online evasive path planning and the video game Ms. Pac-Man
inferred← citeshttps://doi.org/10.1109/mra.2008.921540openalex-snapshot
Roadmap-Based Path Planning - Using the Voronoi Diagram for a Clearance-Based Shortest Path
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366849openalex-snapshot
Near-quadratic bounds for the motion planning problem for a polygon in a polygonal environment
inferred← citeshttps://doi.org/10.1109/tai.1990.130302openalex-snapshot
Collision-free path planning for a shape-changeable mobile robot in a 3-dimensional environment
inferred← citeshttps://doi.org/10.1109/tai.1996.560398openalex-snapshot
Incremental Markov-model planning
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.1109/tvcg.2020.2976922openalex-snapshot
A Review of Methods to Compute Minkowski Operations for Geometric Overlap Detection
inferred← citeshttps://doi.org/10.1137/0221001openalex-snapshot
Efficient Motion Planning for an L -Shaped Object
inferred← citeshttps://doi.org/10.1137/s0097539797326289openalex-snapshot
Motion Planning of Legged Robots
inferred← citeshttps://doi.org/10.1145/109648.109668openalex-snapshot
Extremal polygon containment problems
inferred← citeshttps://doi.org/10.1145/109648.109683openalex-snapshot
On the complexity of a single cell in certain arrangements of surfaces in 3-space (extended abstract)
inferred← citeshttps://doi.org/10.1145/1341012.1341064openalex-snapshot
Geometric algorithms for clearance based optimal path computation
inferred← citeshttps://doi.org/10.1145/160985.160992openalex-snapshot
Combinatorial complexity of translating a box in polyhedral 3-space
inferred← citeshttps://doi.org/10.1145/220279.220304openalex-snapshot
How to cut pseudo-parabolas into segments
inferred← citeshttps://doi.org/10.1145/73393.73426openalex-snapshot
Coordinated motion planning for two independent robots
inferred← citeshttps://doi.org/10.1145/73833.73852openalex-snapshot
Efficient motion planning for an L-shaped object
inferred← citeshttps://doi.org/10.1145/73833.73853openalex-snapshot
Placing the largest similar copy of a convex polygon among polygonal obstacles
inferred← citeshttps://doi.org/10.21236/ada228278openalex-snapshot
Implementation and Experimentation with Motion Planning Algorithms
inferred← citeshttps://doi.org/10.21236/ada325994openalex-snapshot
Nonholonomic Motion Planning versus Controllability via the Multibody Car System Example,
inferred← citeshttps://doi.org/10.31274/rtd-180813-10480openalex-snapshot
Collision-free path planning
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2021.19openalex-snapshot
Largest Similar Copies of Convex Polygons in Polygonal Domains
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.