A fast planar partition algorithm, I
- 31 December 1990
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 10 (3-4), 253-280
- https://doi.org/10.1016/s0747-7171(08)80064-8
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- An efficient algorithm for hidden surface removalACM SIGGRAPH Computer Graphics, 1989
- An optimal algorithm for intersecting line segments in the planePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Constructing Arrangements of Lines and Hyperplanes with ApplicationsSIAM Journal on Computing, 1986
- Reporting and counting segment intersectionsJournal of Computer and System Sciences, 1986
- Algorithms for Reporting and Counting Geometric IntersectionsIEEE Transactions on Computers, 1979