December 2012
Intermediate to advanced
631 pages
13h 10m
English
Clifford A. Shaffer and Charles D. Feustel, Virginia Tech, Blacksburg, Virginia
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 ...
Read now
Unlock full access