EXACT COMPUTATION OF 2-D INTERSECTIONS
Clifford A. Shaffer and Charles D. Feustel, Virginia Tech, Blacksburg, Virginia
Publisher Summary
This chapter presents a technique for exact representation of the intersections between line segments in 2-D with vertices of a fixed-input resolution. The chapter explains how to represent a clipped line segment using bounded rational arithmetic, provided that both the clipping and clipped segments are defined by endpoints measured to fixed precision. The method for the exact computation of 2-D intersections allows a line segment to be clipped an arbitrary number of times without increasing storage requirements yet yielding the correct result. The output from a series of polygon-intersection operations ...
Get Graphics Gems III (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.
