An algorithm for detection of intersections between polygonal objects
Numerical methods and programming, Tome 4 (2003) no. 1, pp. 194-199
Cet article a éte moissonné depuis la source Math-Net.Ru
The problem on detection of intersections between objects with the use of bounding boxes is considered. The examples of bounding boxes most frequently used in practice are briefly described. Several criteria of accuracy for approxation and rate of detection are discussed. An improved algorithm for imdetection of intersection by oriented bounding boxes is proposed.
Keywords:
polygonal objects, oriented bounding boxes, intersection of objects, approxation criteria.
@article{VMP_2003_4_1_a20,
author = {A. A. Zakharov and S. S. Sadykov},
title = {An algorithm for detection of intersections between polygonal objects},
journal = {Numerical methods and programming},
pages = {194--199},
year = {2003},
volume = {4},
number = {1},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/VMP_2003_4_1_a20/}
}
A. A. Zakharov; S. S. Sadykov. An algorithm for detection of intersections between polygonal objects. Numerical methods and programming, Tome 4 (2003) no. 1, pp. 194-199. http://geodesic.mathdoc.fr/item/VMP_2003_4_1_a20/