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 37 items.
- 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)
- Combinatorial complexity of signed discs (Q5060148) (← links)
- (Q5088955) (← links)
- Searching for the closest-pair in a query translate (Q5088994) (← links)
- Coloring intersection hypergraphs of pseudo-disks (Q5115820) (← links)
- LOCATING AN OBNOXIOUS LINE AMONG PLANAR OBJECTS (Q5300001) (← links)
- Decomposition of Multiple Packings with Subquadratic Union Complexity (Q5364271) (← links)
- On the Richter–Thomassen Conjecture about Pairwise Intersecting Closed Curves (Q5366928) (← links)
- ON THE EXPECTED SIZE OF THE 2D VISIBILITY COMPLEX (Q5386746) (← links)
- Domination in Geometric Intersection Graphs (Q5458576) (← links)
- (Q5743501) (← 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)
- Space-aware reconfiguration (Q6045789) (← links)
- (Q6065409) (← links)
- Clique-based separators for geometric intersection graphs (Q6103521) (← links)