Monotone Polygon Intersection
Geometry, Computer Applications, and Computer Graphics
Published 1991
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.
Document Details
- Copyright: RAND Corporation
- Availability: Web Only
- Year: 1991
- Pages: 28
- DOI: https://doi.org/10.7249/pubs
- Document Number: N-3298-DARPA
Citation
RAND Style Manual
Shane, Darrell, Monotone Polygon Intersection: Geometry, Computer Applications, and Computer Graphics, RAND Corporation, N-3298-DARPA, 1991. As of July 10, 2026: https://www.rand.org/pubs/notes/N3298.html
Chicago Manual of Style
Shane, Darrell, Monotone Polygon Intersection: Geometry, Computer Applications, and Computer Graphics. Santa Monica, CA: RAND Corporation, 1991. https://www.rand.org/pubs/notes/N3298.html.
This publication is part of the RAND note series. The note was a product of RAND from 1979 to 1993 that reported miscellaneous 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.
RAND 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.