Jump to ratings and reviews
Rate this book

Red-Blue Intersection Detection Algorithms, With Applications to Motion Planning and Collision Detection

Rate this book
Excerpt from Red-Blue Intersection Detection Algorithms, With Applications to Motion Planning and Collision Detection

In this section, we give an efficient algorithm for the case when the red arcs in F are non-intersecting line segments which form the boundary of a simple polygon 13 (see figure 1) or, more generally, non~intersecting Jordan arcs whose union is the boundary of a simply-connected region. Let a(i) denote the arrangement of I (i.e. The planar map induced by these arcs; its vertices are the intersection points of the arcs and their endpoints, its edges are maximal connected subsets of the arcs which do not contain any vertex, and its faces are maximal connected subsets of the plane which do not contain any vertex or edge). Let 2 denote any fixed point on 613. The following Lemma is a simple but a key observation which allows us to obtain an efficient algorithm. Lemma Let f be the face of a(i) containing the point 2. Then 63 and I intersect if and only if and 68 intersect.

43 pages, Paperback

Published August 24, 2018

About the author

Pankaj Agarwal

23 books3 followers

Ratings & Reviews

What do you think?
Rate this book

Friends & Following

Create a free account to discover what your friends think of this book!

Community Reviews

5 stars
0 (0%)
4 stars
0 (0%)
3 stars
0 (0%)
2 stars
1 (100%)
1 star
0 (0%)
No one has reviewed this book yet.

Can't find what you're looking for?

Get help and learn more about the design.