Abstract
In this paper, a fast algorithm for polygon operations is introduced. The intersection validation testing method is described.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
I. E. Sutherland, R. F. Sproull, and R. A. Schumacker, Characterization of ten hidden surface algorithms.Computer Surv., 6:1 (1974).
J. D. Foley, and A. Van Dam, Fundamentals of Interactive Computer Graphics, Addison-Wesley, USA (1982)
S. Nordbeck, and B. Rystedt, Computer cartography point in polygon programs,BIT, 7 (1967).
M. Chen, and P. Townsend, Efficient and consistent algorithms for determining the contaiment of points in polygons and polyhedra, EUROGRAPHICS'87.
E. E, Barton and I. Buchanan, The polygon package,Computer-Aided Design,12: 1 (1980).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Cai, S., Zhang, F. A fast algorithm for polygon operations. J. of Compt. Sci. & Technol. 6, 91–96 (1991). https://doi.org/10.1007/BF02943412
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02943412