On the public citation graph

Separating two simple polygons by a sequence of translations

https://doi.org/10.1007/bf02187902
0 signed · 102 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

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/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/bfb0015744openalex-snapshot
A fast algorithm for polygon containment by translation
inferredcites →https://doi.org/10.1016/0734-189x(86)90127-1openalex-snapshot
A linear time algorithm for minimum link paths inside a simple polygon
inferredcites →https://doi.org/10.1016/b978-0-444-87806-9.50018-9openalex-snapshot
Movable Separability of Sets
inferredcites →https://doi.org/10.1017/s0263574700009644openalex-snapshot
Separability of pairs of polygons through single translations
inferredcites →https://doi.org/10.1109/jra.1987.1087093openalex-snapshot
How to move a chair through a door
inferredcites →https://doi.org/10.1109/sfcs.1982.58openalex-snapshot
A theorem on polygon cutting with applications
inferredcites →https://doi.org/10.1109/sfcs.1983.1openalex-snapshot
A kinetic framework for computational geometry
inferredcites →https://doi.org/10.1145/10515.10516openalex-snapshot
Linear time algorithms for visibility and shortest path problems inside simple polygons
inferredcites →https://doi.org/10.1145/12130.12170openalex-snapshot
A linear-time algorithm for triangulating simple polygons
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.323252openalex-snapshot
Visibility and intersectin problems in plane geometry
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/323233.323264openalex-snapshot
Voronoi diagrams based on convex distance functions
inferredcites →https://doi.org/10.1145/359156.359164openalex-snapshot
An algorithm for planning collision-free paths among polyhedral obstacles

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/cpa.3160480910openalex-snapshot
Robot motion planning
inferred← citeshttps://doi.org/10.1006/cviu.1996.0045openalex-snapshot
On the Area of Overlap of Translated Polygons
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-19488-6_117openalex-snapshot
Geometric structures in computational geometry
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_118openalex-snapshot
Arrangements of curves in the plane — topology, combinatorics, and algorithms
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-51683-2_25openalex-snapshot
A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles
inferred← citeshttps://doi.org/10.1007/3-540-51683-2_34openalex-snapshot
An optimal algorithm for the boundary of a cell in a union of rays
inferred← citeshttps://doi.org/10.1007/3-540-51859-2_14openalex-snapshot
Disassembling two-dimensional composite parts via translations
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-60607-6_27openalex-snapshot
Geometrical and Physical Reasoning for Stable Assembly Sequence Planning
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-4-431-68093-2_3openalex-snapshot
Computational Geometry: Recent Developments
inferred← citeshttps://doi.org/10.1007/bf01189068openalex-snapshot
Assembly sequences for polyhedra
inferred← citeshttps://doi.org/10.1007/bf01258293openalex-snapshot
Robot motion planning and the single cell problem in arrangements
inferred← citeshttps://doi.org/10.1007/bf01285815openalex-snapshot
The number of edges of many faces in a line segment arrangement
inferred← citeshttps://doi.org/10.1007/bf01530889openalex-snapshot
Coordinated motion planning for two independent robots
inferred← citeshttps://doi.org/10.1007/bf01758854openalex-snapshot
Quasi-optimal upper bounds for simplex range searching and new zone theorems
inferred← citeshttps://doi.org/10.1007/bf01840405openalex-snapshot
An optimal algorithm for the boundary of a cell in a union of rays
inferred← citeshttps://doi.org/10.1007/bf01931656openalex-snapshot
Storing line segments in partition trees
inferred← citeshttps://doi.org/10.1007/bf02123007openalex-snapshot
Triangles in space or building (and analyzing) castles in the air
inferred← citeshttps://doi.org/10.1007/bf02187729openalex-snapshot
On separating two simple polygons by a single translation
inferred← citeshttps://doi.org/10.1007/bf02187732openalex-snapshot
The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis
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/bf02187745openalex-snapshot
On arrangements of Jordan arcs with three intersections per pair
inferred← citeshttps://doi.org/10.1007/bf02187784openalex-snapshot
The complexity and construction of many faces in arrangements of lines and of segments
inferred← citeshttps://doi.org/10.1007/bf02187894openalex-snapshot
Planar realizations of nonlinear davenport-schinzel sequences by segments
inferred← citeshttps://doi.org/10.1007/bf02570705openalex-snapshot
On lazy randomized incremental construction
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/bf02574043openalex-snapshot
Arrangements of segments that share endpoints: Single face results
inferred← citeshttps://doi.org/10.1007/bfb0028974openalex-snapshot
On the boundary of a union of Rays
inferred← citeshttps://doi.org/10.1007/s004539910018openalex-snapshot
Visibility-Based Planning of Sensor Control Strategies
inferred← citeshttps://doi.org/10.1007/s11227-020-03299-7openalex-snapshot
Windowing queries using Minkowski sum and their extension to MapReduce
inferred← citeshttps://doi.org/10.1007/s13366-016-0323-5openalex-snapshot
On the separability of quadrilaterals in the plane by translations and rotations
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/0004-3702(94)90048-5openalex-snapshot
Geometric reasoning about mechanical assembly
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90085-nopenalex-snapshot
On the complexity of assembly partitioning
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00083-oopenalex-snapshot
Partitioning a planar assembly into two connected parts is NP-complete
inferred← citeshttps://doi.org/10.1016/0020-0255(92)90026-5openalex-snapshot
On movable separability and isotheticity
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/b978-0-444-88071-0.50013-8openalex-snapshot
Algorithmic Motion Planning in Robotics
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/j.comgeo.2014.12.001openalex-snapshot
On the zone of the boundary of a convex body
inferred← citeshttps://doi.org/10.1016/s0004-3702(98)00076-9openalex-snapshot
Detecting geometric infeasibility
inferred← citeshttps://doi.org/10.1016/s0010-4485(96)00044-9openalex-snapshot
Assembly sequencing with toleranced parts
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.1051/ita/1992260503871openalex-snapshot
Enumerating Davenport-Schinzel sequences
inferred← citeshttps://doi.org/10.1063/1.4952257openalex-snapshot
Quadrangles which cannot be separated with two hands
inferred← citeshttps://doi.org/10.1088/1757-899x/435/1/012043openalex-snapshot
Moving a Chair through a Door: A Tutorial on Local Spatial Reasoning in Algorithmic Robotics
inferred← citeshttps://doi.org/10.1109/2.16221openalex-snapshot
Algorithmic motion planning in robotics
inferred← citeshttps://doi.org/10.1109/ijsis.1996.565061openalex-snapshot
/sup High/LAP: a high level system for generating, representing, and evaluating assembly sequences
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.1988.12304openalex-snapshot
A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles
inferred← citeshttps://doi.org/10.1109/robot.1992.220106openalex-snapshot
Assembling polyhedra with single translations
inferred← citeshttps://doi.org/10.1109/robot.1996.506982openalex-snapshot
Compiling assembly plans into hard automation
inferred← citeshttps://doi.org/10.1109/robot.1997.620104openalex-snapshot
General translational assembly planning
inferred← citeshttps://doi.org/10.1109/robot.2001.932829openalex-snapshot
C-space cell defragmentation for general translational assembly planning
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.1115/cie1995-0800openalex-snapshot
An Efficient System for Geometric Assembly Sequence Generation and Evaluation
inferred← citeshttps://doi.org/10.1117/12.165000openalex-snapshot
Area of overlap of translated polygons
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/0222077openalex-snapshot
Computing a Face in an Arrangement of Line Segments and Related 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/109648.109684openalex-snapshot
Arrangements of segments that share endpoints
inferred← citeshttps://doi.org/10.1145/160985.160990openalex-snapshot
On lines missing polyhedral sets in 3-space
inferred← citeshttps://doi.org/10.1145/195058.195113openalex-snapshot
On lazy randomized incremental construction
inferred← citeshttps://doi.org/10.1145/218013.218037openalex-snapshot
Assembly sequencing with toleranced parts
inferred← citeshttps://doi.org/10.1145/225058.225285openalex-snapshot
Computing faces in segment and simplex arrangements
inferred← citeshttps://doi.org/10.1145/3711823openalex-snapshot
On Two-Handed Planar Assembly Partitioning with Connectivity Constraints
inferred← citeshttps://doi.org/10.1145/73393.73399openalex-snapshot
The complexity of many faces in arrangements of lines of segments
inferred← citeshttps://doi.org/10.1145/73393.73401openalex-snapshot
Red-Blue intersection detection algorithms, with applications to motion planning and collision detection
inferred← citeshttps://doi.org/10.1145/73393.73420openalex-snapshot
On arrangements of Jordan arcs with three intersections per pair
inferred← citeshttps://doi.org/10.1145/73393.73426openalex-snapshot
Coordinated motion planning for two independent robots
inferred← citeshttps://doi.org/10.1145/73393.73432openalex-snapshot
Triangles in space or building (and analyzing) castles in the Air
inferred← citeshttps://doi.org/10.1145/73833.73868openalex-snapshot
Ray shooting and other applications of spanning trees with low stabbing number
inferred← citeshttps://doi.org/10.1145/98524.98532openalex-snapshot
Quasi-optimal upper bounds for simplex range searching and new zone theorems
inferred← citeshttps://doi.org/10.1163/156855397x00272openalex-snapshot
Generating and evaluating stable assembly sequences
inferred← citeshttps://doi.org/10.1163/156855397x00281openalex-snapshot
Assembly partitioning along simple paths: the case of multiple translations
inferred← citeshttps://doi.org/10.1201/9781439864524-26openalex-snapshot
Robust Geometric Algorithms for Sensor Planning
inferred← citeshttps://doi.org/10.21236/ada326085openalex-snapshot
On the Complexity of Partitioning an Assembly.
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.