Abstract
Let Γ be a collection of n (possibly intersecting) 'red' Jordan arcs of some simple shape in the plane and let Γ′ be a similar collection of m 'blue' arcs. Several efficient algorithms are presented for detecting an intersection between an arc of Γ and arc of Γ′.
| Original language | English |
|---|---|
| Pages (from-to) | 297-321 |
| Number of pages | 25 |
| Journal | SIAM Journal on Computing |
| Volume | 19 |
| Issue number | 2 |
| DOIs | |
| State | Published - 1990 |
| Externally published | Yes |
Fingerprint
Dive into the research topics of 'Red-blue intersection detection algorithms, with applications to motion planning and collision detection'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver