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 16 items.
- 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)