2D line and polygon clipping based on space subdivision |
| |
| Authors: | Mel Slater Brian A Barsky |
| |
| Affiliation: | (1) Computer Science Division Electrical Engineering and Computer Sciences, University of California at Berkeley, 94720 Berkeley, CA, USA;(2) Present address: Department of Computer Science, WMW University of London, Mile End road, E1 4NS London, UK |
| |
| Abstract: | This paper introduces a new approach to 2D line and polygon clipping against a rectangular clipping region, using space subdivision into cells, with the clipping region as the central cell. The line segment path is traced through the cells, and entries into and out of the cell corresponding to the clipping region enable computation of the intersection of the line segment with crossed cell edges. Tracing the line segment path is computationally very simple, leading to an algorithm that only computes intersections that the are part of the clipped line segment. The new algorithm is compared to other standard line clipping algorithms with simulations and operation counts. |
| |
| Keywords: | Clipping Line segment clipping Polgon clipping Computer graphics |
| 本文献已被 SpringerLink 等数据库收录！ |
|
