Pages that link to "Item:Q1076976"
From MaRDI portal
The following pages link to On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles (Q1076976):
Displayed 50 items.
- Reaching a goal with directional uncertainty (Q673767) (← links)
- On critical orientations in the Kedem-Sharir motion planning algorithm (Q677023) (← links)
- A convex polygon among polygonal obstacle: Placement and high-clearance motion (Q685605) (← links)
- Variations on the theme of repeated distances (Q756139) (← links)
- The visibility-Voronoi complex and its applications (Q870429) (← links)
- Combinatorial complexity bounds for arrangements of curves and spheres (Q917017) (← links)
- The upper envelope of piecewise linear functions: Algorithms and applications (Q919830) (← links)
- Improved bounds on the union complexity of fat objects (Q946687) (← links)
- The Minkowski sum of a simple polygon and a segment (Q1007520) (← links)
- On regular vertices of the union of planar convex objects (Q1017923) (← links)
- Finding the \(\Theta \)-guarded region (Q1037785) (← links)
- Facility location problems in the plane based on reverse nearest neighbor queries (Q1038383) (← links)
- Planning a purely translational motion of a convex object in two- dimensional space using generalized Voronoi diagrams (Q1084674) (← links)
- A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space (Q1102109) (← links)
- Separating two simple polygons by a sequence of translations (Q1104080) (← links)
- A survey of motion planning and related geometric algorithms (Q1123032) (← links)
- Constructing the relative neighborhood graph in 3-dimensional Euclidean space (Q1175789) (← links)
- A role of lower semicontinuous functions in the combinatorial complexity of geometric problems (Q1179028) (← links)
- On \(k\)-sets in arrangements of curves and surfaces (Q1179129) (← links)
- Arrangements of curves in the plane --- topology, combinatorics, and algorithms (Q1185003) (← links)
- Intersection queries in sets of disks (Q1196457) (← links)
- Approximate motion planning and the complexity of the boundary of the union of simple geometric figures (Q1201745) (← links)
- Efficient hidden surface removal for objects with small union size (Q1208434) (← links)
- On the general motion-planning problem with two degrees of freedom (Q1262130) (← links)
- On arrangements of Jordan arcs with three intersections per pair (Q1262864) (← links)
- An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space (Q1263972) (← links)
- The union of moving polygonal pseudodiscs -- combinatorial bounds and applications (Q1272309) (← links)
- Spheres, molecules, and hidden surface removal (Q1272310) (← links)
- On the complexity of a single cell in certain arrangements of surfaces related to motion planning (Q1314439) (← links)
- Computing the smallest \(k\)-enclosing circle and related problems (Q1328752) (← links)
- Inclusion-exclusion complexes for pseudodisk collections (Q1355193) (← links)
- Coordinated motion planning for two independent robots (Q1356168) (← links)
- Motion planning in the presence of movable obstacles (Q1356169) (← links)
- The common exterior of convex polygons in the plane (Q1367170) (← links)
- 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects (Q1370928) (← links)
- Combinatorial complexity of translating a box in polyhedral 3-space (Q1384201) (← links)
- On fat partitioning, fat covering and the union size of polygons (Q1384209) (← links)
- Getting around a lower bound for the minimum Hausdorff distance (Q1392850) (← links)
- Speeding up the incremental construction of the union of geometric objects in practice. (Q1421031) (← links)
- Optimizing a constrained convex polygonal annulus (Q1775012) (← links)
- On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space (Q1821354) (← links)
- Robot motion planning and the single cell problem in arrangements (Q1842755) (← links)
- An optimal algorithm for reporting visible rectangles (Q1847392) (← links)
- Translating a convex polyhedron over monotone polyhedra (Q1862129) (← links)
- Piecewise linear paths among convex obstacles (Q1894717) (← links)
- Combinatorial complexity of signed discs (Q1917033) (← links)
- Computing the intersection-depth to polyhedra (Q2366234) (← links)
- Approximate unions of lines and Minkowski sums (Q2369877) (← links)
- One-way and round-trip center location problems (Q2568335) (← links)
- Locating two obnoxious facilities using the weighted maximin criterion (Q2583716) (← links)