Spatial Partitioning of a Polygon by a Plane
Vaněček George, Jr, Purdue University Department of Computer Sciences West Lafayette, Indiana. E-mail address: vanecek@cs.purdue.edu
This gem presents an algorithm that partitions a polygon lying in 3D space by a plane, resulting in three lists of zero or more polygons. If the plane intersects the polygon transversely, the algorithm cuts the polygon by the plane and returns a list of new polygons that lie above and a list of new polygons that lie below the plane. This algorithm underpins many BSP tree and polygon intersection libraries. Splitting a polygon is a common problem encountered in many 3D geometric applications such as boundary representation (B-Rep) to BSP tree conversion
Get Graphics Gems V (IBM Version) now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
