Simplified linear-time jordan sorting and polygon clipping
- 29 June 1990
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 35 (2) , 85-92
- https://doi.org/10.1016/0020-0190(90)90111-a
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Finding Minimum-Cost Circulations by Successive ApproximationMathematics of Operations Research, 1990
- On-line sorting of twisted sequences in linear timeBIT Numerical Mathematics, 1988
- A fast Las Vegas algorithm for triangulating a simple polygonPublished by Association for Computing Machinery (ACM) ,1988
- An optimal algorithm for intersecting line segments in the planePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- An efficient new algorithm for 2-D line clipping: Its development and analysisACM SIGGRAPH Computer Graphics, 1987
- Jordan sorting via convex hulls of certain non-simple polygonsPublished by Association for Computing Machinery (ACM) ,1987
- Sorting jordan sequences in linear time using level-linked search treesInformation and Control, 1986
- Self-adjusting binary search treesJournal of the ACM, 1985
- An analysis and algorithm for polygon clippingCommunications of the ACM, 1983
- Reentrant polygon clippingCommunications of the ACM, 1974