On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
From MaRDI portal
Recommendations
- A topological setting for obstacle collision free motions
- A unified approach for robot motion planning with moving polyhedral obstacles
- Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
- scientific article; zbMATH DE number 5250982
- Pseudo minimum translational distance between convex polyhedra. II. Robot collision-free path planning
- Sequential collision-free optimal motion planning algorithms in punctured Euclidean spaces
- Polygon-constrained motion planning problems
- Multitasking collision-free optimal motion planning algorithms in Euclidean spaces
- Planning a purely translational motion of a convex object in two- dimensional space using generalized Voronoi diagrams
Cites work
- scientific article; zbMATH DE number 3780615 (Why is no real title available?)
- scientific article; zbMATH DE number 3544865 (Why is no real title available?)
- scientific article; zbMATH DE number 3299324 (Why is no real title available?)
- A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space
- A “retraction” method for planning the motion of a disc
- Algorithms for Reporting and Counting Geometric Intersections
- An efficient and simple motion planning algorithm for a ladder amidst polygonal barriers
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
- Convexity and a certain property \(P_ m\)
- Intersection and Closest-Pair Problems for a Set of Planar Discs
- On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers
- Optimal Search in Planar Subdivisions
- Osculation vertices in arrangements of curves
- Plane-sweep algorithms for intersecting geometric figures
- Power Diagrams: Properties, Algorithms and Applications
- Voronoi Diagram in the Laguerre Geometry and Its Applications
Cited in
(only showing first 100 items - show all)- Computing push plans for disk-shaped robots
- Online bichromatic piercing set problem
- Space-aware reconfiguration
- Intersection queries in sets of disks
- On the two-dimensional Davenport-Schinzel problem
- Clique-based separators for geometric intersection graphs
- The common exterior of convex polygons in the plane
- Robot motion planning and the single cell problem in arrangements
- Approximating the k-Level in Three-Dimensional Plane Arrangements
- An Output-Sensitive Convex Hull Algorithm for Planar Objects
- The number of holes in the union of translates of a convex set in three dimensions
- Spanners for directed transmission graphs
- Bipartizing (pseudo-)disk graphs: approximation with a ratio better than 3
- Optimization of the first Dirichlet Laplacian eigenvalue with respect to a union of balls
- Improved approximation bounds for the minimum constraint removal problem
- The rectilinear convex hull of line segments
- Reaching a goal with directional uncertainty
- On critical orientations in the Kedem-Sharir motion planning algorithm
- AN ALGEBRA FOR SLOPE-MONOTONE CLOSED CURVES
- A convex polygon among polygonal obstacle: Placement and high-clearance motion
- On arrangements of Jordan arcs with three intersections per pair
- An optimal algorithm for reporting visible rectangles
- Median trajectories
- Arrangements of curves in the plane --- topology, combinatorics, and algorithms
- Computing the smallest k-enclosing circle and related problems
- Between shapes, using the Hausdorff distance
- Near-linear approximation algorithms for geometric hitting sets
- Maximum area axis-aligned square packings
- Locating two obnoxious facilities using the weighted maximin criterion
- On the union complexity of diametral disks
- A procedure for computing the symmetric difference of regions defined by polygonal curves
- scientific article; zbMATH DE number 7559226 (Why is no real title available?)
- On pseudo-disk hypergraphs
- Planning a purely translational motion of a convex object in two- dimensional space using generalized Voronoi diagrams
- Translating a convex polyhedron over monotone polyhedra
- On the number of regular vertices of the union of Jordan regions
- A survey of motion planning and related geometric algorithms
- Facility location problems in the plane based on reverse nearest neighbor queries
- Combinatorial complexity of signed discs
- CONFLICT-FREE COLORINGS OF SHALLOW DISCS
- An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space
- The Set of Admissible Positions for a Two‐DOF Linkage in the Presence of Obstacles
- On the number of touching pairs in a set of planar curves
- Combinatorial complexity of signed discs
- Motion planning in the presence of movable obstacles
- A Polynomial-Time Algorithm for Computing Shortest Paths of Bounded Curvature Amidst Moderate Obstacles
- Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
- Improved bounds on the Hadwiger-Debrunner numbers
- Reviewing extensions and solution methods of the planar Weber single facility location problem
- Coordinated motion planning for two independent robots
- Time-optimal computation of the rectilinear convex hull with arbitrary orientation of sets of segments and circles
- Optimizing a constrained convex polygonal annulus
- On the number of regular vertices of the union of Jordan regions
- Speeding up the incremental construction of the union of geometric objects in practice.
- Solving the irregular strip packing problem via guided local search for overlap minimization
- On the Richter–Thomassen Conjecture about Pairwise Intersecting Closed Curves
- The visibility-Voronoi complex and its applications
- Computing the smallest k-enclosing circle and related problems
- A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space
- On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space
- Tangencies between families of disjoint regions in the plane
- Improved bounds on the union complexity of fat objects
- Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions
- Spheres, molecules, and hidden surface removal
- On the number of tangencies among 1-intersecting curves (extended abstract)
- Inclusion-exclusion complexes for pseudodisk collections
- On the union complexity of families of axis-parallel rectangles with a low packing number
- Combinatorial complexity of translating a box in polyhedral 3-space
- Combinatorial complexity bounds for arrangements of curves and spheres
- Decomposition of Multiple Packings with Subquadratic Union Complexity
- Finding pairwise intersections inside a query range
- ON THE EXPECTED SIZE OF THE 2D VISIBILITY COMPLEX
- Algorithmic aspects of proportional symbol maps
- Improvements on geometric pattern matching problems
- The union of moving polygonal pseudodiscs -- combinatorial bounds and applications
- On regular vertices of the union of planar convex objects
- Getting around a lower bound for the minimum Hausdorff distance
- The Minkowski sum of a simple polygon and a segment
- Coloring intersection hypergraphs of pseudo-disks
- Active-learning a convex body in low dimensions
- On the union of cylinders in three dimensions
- Stable-matching Voronoi diagrams: combinatorial complexity and algorithms
- Approximation algorithms for maximum independent set of pseudo-disks
- A note on the perimeter of fat objects
- A crossing lemma for Jordan curves
- Separating two simple polygons by a sequence of translations
- Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling
- On the general motion-planning problem with two degrees of freedom
- On the complexity of a single cell in certain arrangements of surfaces related to motion planning
- A note on smaller fractional Helly numbers
- Approximate unions of lines and Minkowski sums
- Searching for the closest-pair in a query translate
- Constant-factor approximation for TSP with disks
- Efficient hidden surface removal for objects with small union size
- 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
- Finding the largest empty disk containing a query point
- A randomized parallel algorithm for Voronoi diagrams based on symmetric convex distance functions
- Locating an obnoxious line among planar objects
- On fat partitioning, fat covering and the union size of polygons
- Variations on the theme of repeated distances
This page was built for publication: On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1076976)
