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.
- 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)
- On the union complexity of families of axis-parallel rectangles with a low packing number (Q1627208) (← links)
- A crossing lemma for Jordan curves (Q1647400) (← links)
- Improved bounds on the Hadwiger-Debrunner numbers (Q1650467) (← links)
- On the number of touching pairs in a set of planar curves (Q1693324) (← links)
- Finding pairwise intersections inside a query range (Q1755743) (← 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)
- Deconstructing approximate offsets (Q1930550) (← links)
- Improved algorithms for placing undesirable facilities (Q1941958) (← links)
- Algorithmic aspects of proportional symbol maps (Q1957642) (← links)
- Active-learning a convex body in low dimensions (Q2032355) (← links)
- The \(\varepsilon\)-\(t\)-net problem (Q2167320) (← links)
- Improved approximation bounds for the minimum constraint removal problem (Q2206735) (← links)
- Conflict-free coloring of intersection graphs of geometric objects (Q2207603) (← links)
- Coloring intersection hypergraphs of pseudo-disks (Q2207604) (← links)
- Computing the intersection-depth to polyhedra (Q2366234) (← links)
- Approximate unions of lines and Minkowski sums (Q2369877) (← links)
- Median trajectories (Q2375955) (← links)
- Near-linear approximation algorithms for geometric hitting sets (Q2429345) (← links)
- A procedure for computing the symmetric difference of regions defined by polygonal curves (Q2437305) (← links)
- One-way and round-trip center location problems (Q2568335) (← links)
- Locating two obnoxious facilities using the weighted maximin criterion (Q2583716) (← links)
- On the two-dimensional Davenport-Schinzel problem (Q2638785) (← links)
- Optimization of the first Dirichlet Laplacian eigenvalue with respect to a union of balls (Q2698557) (← links)
- FINDING THE LARGEST EMPTY DISK CONTAINING A QUERY POINT (Q2875646) (← links)
- Solving the irregular strip packing problem via guided local search for overlap minimization (Q3401324) (← links)
- Finding Pairwise Intersections Inside a Query Range (Q3449820) (← links)
- The Offset Filtration of Convex Objects (Q3452834) (← links)
- COMPUTING PUSH PLANS FOR DISK-SHAPED ROBOTS (Q3459360) (← links)
- CONFLICT-FREE COLORINGS OF SHALLOW DISCS (Q3604140) (← links)
- AN ALGEBRA FOR SLOPE-MONOTONE CLOSED CURVES (Q4223755) (← links)
- An Output-Sensitive Convex Hull Algorithm for Planar Objects (Q4513200) (← links)
- Spanners for Directed Transmission Graphs (Q4581909) (← links)
- Constant-Factor Approximation for TSP with Disks (Q4604382) (← links)
- Approximating the k-Level in Three-Dimensional Plane Arrangements (Q4604386) (← links)
- A Polynomial-Time Algorithm for Computing Shortest Paths of Bounded Curvature Amidst Moderate Obstacles (Q4818580) (← links)
- (Q5002769) (← links)
- Maximum Area Axis-Aligned Square Packings. (Q5005181) (← links)
- On the number of regular vertices of the union of Jordan regions (Q5054868) (← links)
- Intersection queries in sets of disks (Q5056120) (← links)
- Improvements on geometric pattern matching problems (Q5056151) (← links)
- Computing the smallest k-enclosing circle and related problems (Q5060125) (← links)
- On fat partitioning, fat covering and the union size of polygons (Q5060136) (← links)