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 22 items.
- Deconstructing approximate offsets (Q1930550) (← links)
- Improved algorithms for placing undesirable facilities (Q1941958) (← links)
- Algorithmic aspects of proportional symbol maps (Q1957642) (← 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)
- Solving the irregular strip packing problem via guided local search for overlap minimization (Q3401324) (← 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)
- A Polynomial-Time Algorithm for Computing Shortest Paths of Bounded Curvature Amidst Moderate Obstacles (Q4818580) (← links)
- LOCATING AN OBNOXIOUS LINE AMONG PLANAR OBJECTS (Q5300001) (← links)
- ON THE EXPECTED SIZE OF THE 2D VISIBILITY COMPLEX (Q5386746) (← links)
- Domination in Geometric Intersection Graphs (Q5458576) (← links)
- A randomized parallel algorithm for Voronoi diagrams based on symmetric convex distance functions (Q5929327) (← links)
- On the number of regular vertices of the union of Jordan regions (Q5932807) (← links)
- Polygon decomposition for efficient construction of Minkowski sums (Q5959553) (← links)