Robot motion planning and the single cell problem in arrangements

DOI10.1007/BF01258293zbMath0816.68120OpenAlexW2091930533MaRDI QIDQ1842755

Dan Halperin

Publication date: 20 April 1995

Published in: Journal of Intelligent \& Robotic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01258293

zbMATH Keywords

robot motion planning

Mathematics Subject Classification ID

Automated systems (robots, etc.) in control theory (93C85) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding the upper envelope of n line segments in O(n log n) time
• The complexity and construction of many faces in arrangements of lines and of segments
• The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis
• Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
• An optimal algorithm for the boundary of a cell in a union of rays
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• The power of geometric duality
• Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
• Planar realizations of nonlinear Davenport-Schinzel sequences by segments
• Separating two simple polygons by a sequence of translations
• On disjoint concave chains in arrangements of (pseudo) lines
• Arrangements of curves in the plane --- topology, combinatorics, and algorithms
• Counting facets and incidences
• Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom
• On the zone of a surface in a hyperplane arrangement
• On the general motion-planning problem with two degrees of freedom
• An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space
• On the complexity of a single cell in certain arrangements of surfaces related to motion planning
• On the sum of squares of cell complexities in hyperplane arrangements
• Castles in the air revisited
• Applications of random sampling in computational geometry. II
• On the two-dimensional Davenport-Schinzel problem
• Triangles in space or building (and analyzing) castles in the air
• Constructing Arrangements of Lines and Hyperplanes with Applications
• An efficient and simple motion planning algorithm for a ladder amidst polygonal barriers
• Efficient Motion Planning for an L-Shaped Object
• On the Zone Theorem for Hyperplane Arrangements
• Computing a Face in an Arrangement of Line Segments and Related Problems
• Power Diagrams: Properties, Algorithms and Applications

This page was built for publication: Robot motion planning and the single cell problem in arrangements