This Note presents an algorithm for finding the intersection of two uniformly monotone polygons in linear time and space without preprocessing. Techniques for intersecting two convex polygons in linear time and space have been known for some time. Convex polygons are a special type of monotone polygons — i.e., they are monotone with respect to any axes. Thus, the algorithm presented will work equally well on convex polygons.
This report is part of the RAND Corporation Note series. The note was a product of the RAND Corporation from 1979 to 1993 that reported other outputs of sponsored research for general distribution.
This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.
The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.