Summary: On Local Heuristics to Speed Up Polygon­Polygon
Intersection Tests
Wael M. Badawy
Center for Advanced Computer Studies
University of Southwestern Louisiana
Lafayette, LA 70504
wmb@cacs.usl.edu
Walid G. Aref
Department of Computer Sciences
Purdue University
West Lafayette, IN 47907
aref@cs.purdue.edu
ABSTRACT
The polygon­polygon intersection operation is CPU­intensive.
Many data structures look into decomposing the polygons into
multiple yet simple pieces to speed up the polygon­polygon
intersection operation. This paper addresses local heuristics that
can be adopted in these data structures by using local information
about the simple polygon pieces to decide upon polygon­polygon
intersections without having to perform this costly operation. The

Source: Aref, Walid - Department of Computer Sciences, Purdue University

Collections: Computer Technologies and Information Sciences