A new O(n·log n) algorithm for computing the intersection of convex polygons
- 31 December 1987
- journal article
- Published by Elsevier in Pattern Recognition
- Vol. 20 (4) , 419-424
- https://doi.org/10.1016/0031-3203(87)90067-7
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- An efficient algorith for determining the convex hull of a finite planar setPublished by Elsevier ,2002
- Computational Geometry—A SurveyIEEE Transactions on Computers, 1984
- Linear Programming in Linear Time When the Dimension Is FixedJournal of the ACM, 1984
- A Fast Algorithm for the Two-Variable Integer Programming ProblemJournal of the ACM, 1984
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related ProblemsSIAM Journal on Computing, 1983
- Feature Article—The Ellipsoid Method: A SurveyOperations Research, 1981
- Computational results on an algorithm for finding all vertices of a polytopeMathematical Programming, 1980
- Convex hulls of finite sets of points in two and three dimensionsCommunications of the ACM, 1977