Pages that link to "Item:Q3474274"
From MaRDI portal
The following pages link to Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection (Q3474274):
Displaying 11 items.
- On counting pairs of intersecting segments and off-line triangle range searching (Q676268) (← links)
- Range queries on uncertain data (Q897858) (← links)
- Partitioning arrangements of lines. I: An efficient deterministic algorithm (Q914373) (← links)
- Partitioning arrangements of lines. II: Applications (Q921915) (← links)
- On fat partitioning, fat covering and the union size of polygons (Q1384209) (← links)
- Preprocessing chains for fast dihedral rotations is hard or even impossible. (Q1410594) (← links)
- Bottleneck bichromatic full Steiner trees (Q1628678) (← links)
- Reporting intersecting pairs of convex polytopes in two and three dimensions (Q1862123) (← links)
- Computing depth orders for fat objects and related problems (Q1917032) (← links)
- Counting and representing intersections among triangles in three dimensions (Q2571213) (← links)
- Computing depth orders and related problems (Q5056161) (← links)