On the public citation graph
Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams
0 signed · 151 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/bf02187683openalex-snapshot
On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
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/bfb0015744openalex-snapshot
A fast algorithm for polygon containment by translation
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.1109/sfcs.1983.1openalex-snapshot
A kinetic framework for computational geometry
inferredcites →https://doi.org/10.1112/blms/15.3.270openalex-snapshot
CONVEX SETS AND THEIR APPLICATIONS
inferredcites →https://doi.org/10.1137/0214034openalex-snapshot
Intersection and Closest-Pair Problems for a Set of Planar Discs
inferredcites →https://doi.org/10.1142/9789812794499_others01openalex-snapshot
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.1145/323233.323264openalex-snapshot
Voronoi diagrams based on convex distance functions
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/(sici)1520-684x(19980630)29:7<33::aid-scj4>3.0.co;2-jopenalex-snapshot
An invertible Minkowski sum of figures
inferred← citeshttps://doi.org/10.1007/3-540-19487-8_7openalex-snapshot
Intersecting line segments, ray shooting, and other applications of geometric partitioning techniques
inferred← citeshttps://doi.org/10.1007/3-540-36586-9_15openalex-snapshot
Hyperfigures and Their Interpretations
inferred← citeshttps://doi.org/10.1007/3-540-45253-2_3openalex-snapshot
Polygon Decomposition for Efficient Construction of Minkowski Sums
inferred← citeshttps://doi.org/10.1007/3-540-45986-3_31openalex-snapshot
Invertible Minkowski Sum of Polygons
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-51542-9_31openalex-snapshot
Motion planning in the CL-environment
inferred← citeshttps://doi.org/10.1007/3-540-52282-4_46openalex-snapshot
On the construction of abstract voronoi diagrams
inferred← citeshttps://doi.org/10.1007/3-540-55121-2_11openalex-snapshot
Voronoi diagrams of moving points in the plane
inferred← citeshttps://doi.org/10.1007/3-540-56287-7_96openalex-snapshot
Implicit point location in arrangements of line segments, with an application to motion planning
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_259openalex-snapshot
Computing the smallest k-enclosing circle and related problems
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-02931-3_40openalex-snapshot
Path Planning Strategy for Mobile Robot Navigation Using MANFIS Controller
inferred← citeshttps://doi.org/10.1007/978-3-319-03107-1_39openalex-snapshot
MANFIS Approach for Path Planning and Obstacle Avoidance for Mobile Robot Navigation
inferred← citeshttps://doi.org/10.1007/978-3-319-03753-0_47openalex-snapshot
Cuckoo Search Algorithm for the Mobile Robot Navigation
inferred← citeshttps://doi.org/10.1007/978-3-319-53007-9_3openalex-snapshot
Voronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function
inferred← citeshttps://doi.org/10.1007/978-3-319-94776-1_12openalex-snapshot
Computing Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons
inferred← citeshttps://doi.org/10.1007/978-3-642-11676-6_3openalex-snapshot
Design and Development of Intelligent Autonomous Robots
inferred← citeshttps://doi.org/10.1007/978-3-642-15775-2_41openalex-snapshot
Optimal Cover of Points by Disks in a Simple Polygon
inferred← citeshttps://doi.org/10.1007/978-3-642-45062-4_33openalex-snapshot
A New Intelligent Approach for Mobile Robot Navigation
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-3-642-83625-1_12openalex-snapshot
Integrating Planning and Execution for Sensor-Based Robots
inferred← citeshttps://doi.org/10.1007/bf01530886openalex-snapshot
On-line motion planning: Case of a planar rod
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/bf01840357openalex-snapshot
A sweepline algorithm for Voronoi diagrams
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/bf02187733openalex-snapshot
The upper envelope of piecewise linear functions: Algorithms and applications
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/bf02187883openalex-snapshot
On the number of critical free contacts of a convex polygonal object moving 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/bf02187902openalex-snapshot
Separating two simple polygons by a sequence of translations
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/bf02574686openalex-snapshot
On the construction of abstract voronoi diagrams
inferred← citeshttps://doi.org/10.1007/bf02574706openalex-snapshot
Onk-sets in arrangements of curves and surfaces
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/bf02733466openalex-snapshot
Stability of solutions in problems of computing geometry
inferred← citeshttps://doi.org/10.1007/pl00009402openalex-snapshot
Motion Planning in Environments with Low Obstacle Density
inferred← citeshttps://doi.org/10.1007/pl00009455openalex-snapshot
Motion Planning for a Convex Polygon in a Polygonal Environment
inferred← citeshttps://doi.org/10.1007/s002000100086openalex-snapshot
Semilinear Motion Planning in REDLOG
inferred← citeshttps://doi.org/10.1007/s00453-021-00824-9openalex-snapshot
Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons
inferred← citeshttps://doi.org/10.1007/s00454-012-9441-5openalex-snapshot
Deconstructing Approximate Offsets
inferred← citeshttps://doi.org/10.1007/s00454-015-9729-3openalex-snapshot
Kinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions
inferred← citeshttps://doi.org/10.1007/s00454-017-9958-8openalex-snapshot
On the Computation of Zone and Double Zone Diagrams
inferred← citeshttps://doi.org/10.1007/s10846-007-9190-5openalex-snapshot
Soft Computing-Based Navigation Schemes for a Real Wheeled Robot Moving Among Static Obstacles
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-8493(94)00118-iopenalex-snapshot
Modeling contact of two complex objects, with an application to characterizing dental articulations
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90115-5openalex-snapshot
Voronoi diagrams over dynamic scenes
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/0895-7177(96)00003-9openalex-snapshot
Voronoi-like partition of lattice in cellular automata
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(94)90003-5openalex-snapshot
Computing the smallest k-enclosing circle and related problems
inferred← citeshttps://doi.org/10.1016/0925-7721(94)90011-6openalex-snapshot
External polygon containment problems
inferred← citeshttps://doi.org/10.1016/0925-7721(96)00002-8openalex-snapshot
Hunting Voronoi vertices
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/j.asoc.2011.06.014openalex-snapshot
Micro air vehicle path planning in fuzzy quadtree framework
inferred← citeshttps://doi.org/10.1016/j.patrec.2003.12.008openalex-snapshot
Hyperpolygons generated by the invertible Minkowski sum of polygons
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/s0723-0869(04)80009-4openalex-snapshot
The geometry of minkowski spaces — A survey. Part II
inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00041-4openalex-snapshot
Polygon decomposition for efficient construction of Minkowski sums
inferred← citeshttps://doi.org/10.1017/s0263574713000738openalex-snapshot
A global path planning method for mobile robot based on a three-dimensional-like map
inferred← citeshttps://doi.org/10.1023/a:1007937713460openalex-snapshot
Robust Path Planning for Non-Holonomic Robots
inferred← citeshttps://doi.org/10.1023/a:1026231624387openalex-snapshot
A New Cell-subdivision Approach to Plan Free Translations in Cluttered Environments
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/21.256552openalex-snapshot
A shortest path algorithm for a nonrotating object among obstacles of arbitrary shapes
inferred← citeshttps://doi.org/10.1109/21.61213openalex-snapshot
Autonomous robot navigation in unknown terrains: incidental learning and environmental exploration
inferred← citeshttps://doi.org/10.1109/34.16713openalex-snapshot
A bibliography on digital and computational convexity (1961-1988)
inferred← citeshttps://doi.org/10.1109/70.544772openalex-snapshot
Growth distances: new measures for object separation and penetration
inferred← citeshttps://doi.org/10.1109/70.563646openalex-snapshot
Collision-free path planning for a diamond-shaped robot using two-dimensional cellular automata
inferred← citeshttps://doi.org/10.1109/cdc.1992.371783openalex-snapshot
Transversality theorem: a useful tool for establishing genericity
inferred← citeshttps://doi.org/10.1109/cec.1999.781943openalex-snapshot
Fuzzy-genetic algorithms and mobile robot navigation among static obstacles
inferred← citeshttps://doi.org/10.1109/icpr.1996.545991openalex-snapshot
Fast analytical medial-axis localization in convex polyhedra
inferred← citeshttps://doi.org/10.1109/riiss.2009.4937904openalex-snapshot
Adaptive boundary-following algorithm guided by artificial potential field for robot navigation
inferred← citeshttps://doi.org/10.1109/robot.1987.1087897openalex-snapshot
Efficient algorithms for planning purely translational collision-free motion in two and three dimensions
inferred← citeshttps://doi.org/10.1109/robot.1990.125937openalex-snapshot
A motion planner for multiple mobile robots
inferred← citeshttps://doi.org/10.1109/robot.1994.351237openalex-snapshot
New distances for the separation and penetration of objects
inferred← citeshttps://doi.org/10.1109/robot.1997.619369openalex-snapshot
A practical motion planning strategy based on a plane-sweep approach
inferred← citeshttps://doi.org/10.1109/robot.1999.770054openalex-snapshot
EquiDistance diagram-a new roadmap method for path planning
inferred← citeshttps://doi.org/10.1109/robot.2004.1308864openalex-snapshot
Motion planning for a rod-shaped robot in /spl Ropf//sup 3/: connecting the rod-HGVG using the point-HGVG
inferred← citeshttps://doi.org/10.1109/sfcs.1986.23openalex-snapshot
Geometric applications of Davenport-Schinzel sequences
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.1111/1467-8659.00692openalex-snapshot
Solving Geometric Optimization Problems using Graphics Hardware
inferred← citeshttps://doi.org/10.1115/1.4038980openalex-snapshot
Optimal Paths for Polygonal Robots in SE(2)
inferred← citeshttps://doi.org/10.1115/1.4043566openalex-snapshot
Planning the Shortest Path in Cluttered Environments: A Review and a Planar Convex Hull-Based Approach
inferred← citeshttps://doi.org/10.1115/1.4054451openalex-snapshot
Solving Three-Dimensional Path Planning Problem Using a Visibility-Based Graphical Representation of the Design Space
inferred← citeshttps://doi.org/10.1115/detc2017-67881openalex-snapshot
Optimal Paths for Polygonal Robots in SE(2)
inferred← citeshttps://doi.org/10.1117/12.676734openalex-snapshot
Method of dual space in local path planning
inferred← citeshttps://doi.org/10.1137/0219020openalex-snapshot
Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection
inferred← citeshttps://doi.org/10.1137/0221035openalex-snapshot
Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number
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.1137/100808459openalex-snapshot
Optimal Cover of Points by Disks in a Simple Polygon
inferred← citeshttps://doi.org/10.1137/s0097539792229404openalex-snapshot
On Collision-Free Placements of Simplices and the Closest Pair of Lines in 3-Space
inferred← citeshttps://doi.org/10.1137/s0097539794266602openalex-snapshot
On Translational Motion Planning of a Convex Polyhedron in 3-Space
inferred← citeshttps://doi.org/10.1137/s0097539795295936openalex-snapshot
Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
inferred← citeshttps://doi.org/10.1142/9789812797773_0004openalex-snapshot
EFFICIENT EXACT MOTION PLANNING IN REALISTIC ENVIRONMENTS
inferred← citeshttps://doi.org/10.1142/s021819590900299xopenalex-snapshot
DETERMINING A SET OF MAXIMUM INSCRIBED RECTANGLES FOR LABEL PLACEMENT IN A REGION
inferred← citeshttps://doi.org/10.1142/s0218195998000114openalex-snapshot
Approximating Voronoi Diagrams of Convex Sites in Any Dimension
inferred← citeshttps://doi.org/10.1142/s0218654397000136openalex-snapshot
AN ALGEBRA FOR SLOPE-MONOTONE CLOSED CURVES
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/10515.10549openalex-snapshot
A sweepline algorithm for Voronoi diagrams
inferred← citeshttps://doi.org/10.1145/109648.109668openalex-snapshot
Extremal polygon containment problems
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/142675.142703openalex-snapshot
Incidence and nearest-neighbor problems for lines in 3-space
inferred← citeshttps://doi.org/10.1145/142675.142737openalex-snapshot
Intersection detection and separators for simple polygons
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/160985.161009openalex-snapshot
Tentative prune-and-search for computing Voronoi vertices
inferred← citeshttps://doi.org/10.1145/1810959.1810984openalex-snapshot
Kinetic stable Delaunay graphs
inferred← citeshttps://doi.org/10.1145/1810959.1810985openalex-snapshot
A kinetic triangulation scheme for moving points in the plane
inferred← citeshttps://doi.org/10.1145/1998196.1998225openalex-snapshot
Deconstructing approximate offsets
inferred← citeshttps://doi.org/10.1145/220279.220284openalex-snapshot
Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications
inferred← citeshttps://doi.org/10.1145/220279.220289openalex-snapshot
The Voronoi diagram of curved objects
inferred← citeshttps://doi.org/10.1145/3039873openalex-snapshot
Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices, and Their Applications
inferred← citeshttps://doi.org/10.1145/380752.380815openalex-snapshot
A tight bound for the complexity of voroni diagrams under polyhedral convex distance functions in 3D
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.1145/73833.73853openalex-snapshot
Placing the largest similar copy of a convex polygon among polygonal obstacles
inferred← citeshttps://doi.org/10.1145/98524.98575openalex-snapshot
Maximin location of convex objects in a polygon and related dynamic Voronoi diagrams
inferred← citeshttps://doi.org/10.1145/98524.98599openalex-snapshot
Computing the minimum Hausdorff distance for point sets under translation
inferred← citeshttps://doi.org/10.1177/1369433221999740openalex-snapshot
Parametric study on application of Voronoi patterns in design of 2-D beams
inferred← citeshttps://doi.org/10.1201/9781439864524-17openalex-snapshot
Largest Placem ents and M otion Planning of a Convex Polygon
inferred← citeshttps://doi.org/10.12785/amis/080551openalex-snapshot
A New Intelligent Motion Planning for Mobile Robot Navigation using Multiple Adaptive Neuro-Fuzzy Inference System
inferred← citeshttps://doi.org/10.17918/etd-3638openalex-snapshot
Mathematical programming for multi-vehicle motion planning under communication constraints
inferred← citeshttps://doi.org/10.21236/ada228278openalex-snapshot
Implementation and Experimentation with Motion Planning Algorithms
inferred← citeshttps://doi.org/10.2514/6.2007-6603openalex-snapshot
Multi-Layer Approach for Motion Planning in Obstacle Rich Environments
inferred← citeshttps://doi.org/10.31274/rtd-180813-10480openalex-snapshot
Collision-free path planning
inferred← citeshttps://doi.org/10.3233/fi-1995-2243openalex-snapshot
TENTATIVE PRUNE-AND-SEARCH FOR COMPUTING FIXED-POINTS WITH APPLICATIONS TO GEOMETRIC COMPUTATION
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.1109.2158openalex-snapshot
Deconstructing Approximate Offsets
inferred← citeshttps://doi.org/10.48550/arxiv.1212.1094openalex-snapshot
The geometric stability of Voronoi diagrams in normed spaces which are not uniformly convex
inferred← citeshttps://doi.org/10.5555/1070432.1070502openalex-snapshot
Pianos are not flat: rigid motion planning in three dimensions
inferred← citeshttps://doi.org/10.5555/320176.320194openalex-snapshot
A practical algorithm for computing the Delaunay triangulation for convex distance functions
inferred← citeshttps://doi.org/10.70675/cb5349eez4b71z46efzb821z11a7ed46a96fopenalex-snapshot
Gestion de robots mobiles et redondants et collaboratifs en environnement contraint et dynamique
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.