Patnaik, LM and Shenoy, RS and Krishnan, D (1986) Set theoretic operations on polygons using the scan-grid approach. In: Computer-Aided Design, 18 (5). pp. 275-279.
http___www.sciencedirect.com_science__ob=MImg&_imagekey=B6TYR-481MR2T-1C8-1&_cdi=5625&_user=512776&_orig=search&_coverDate=06_30_1986&_sk=999819994&view=c&wchp=dGLbVtz-zSkzk&md5=0a808d612f8b65d3.pdf - Published Version
Restricted to Registered users only
Download (401Kb) | Request a copy
This paper describes an algorithm to compute the union, intersection and difference of two polygons using a scan-grid approach. Basically, in this method, the screen is divided into cells and the algorithm is applied to each cell in turn. The output from all the cells is integrated to yield a representation of the output polygon. In most cells, no computation is required and thus the algorithm is a fast one. The algorithm has been implemented for polygons but can be extended to polyhedra as well. The algorithm is shown to take O(N) time in the average case where N is the total number of edges of the two input polygons.
|Item Type:||Journal Article|
|Additional Information:||Copyright of this article belongs to Elsevier Science.|
|Date Deposited:||29 Jan 2010 08:28|
|Last Modified:||19 Sep 2010 05:36|
Actions (login required)