A dual approach to detect polyhedral intersections in arbitrary dimensions
- 1 March 1991
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 31 (1) , 2-14
- https://doi.org/10.1007/bf01952778
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Algorithms in Combinatorial GeometryPublished by Springer Nature ,1987
- Intersection of convex objects in two and three dimensionsJournal of the ACM, 1987
- Optimal Point Location in a Monotone SubdivisionSIAM Journal on Computing, 1986
- Computational GeometryPublished by Springer Nature ,1985
- Computational Geometry—A SurveyIEEE Transactions on Computers, 1984
- Linear Programming in Linear Time When the Dimension Is FixedJournal of the ACM, 1984
- Fast detection of polyhedral intersectionTheoretical Computer Science, 1983
- Detection is easier than computation (Extended Abstract)Published by Association for Computing Machinery (ACM) ,1980
- Finding the intersection of n half-spaces in time O(n log n)Theoretical Computer Science, 1979
- Multidimensional Searching ProblemsSIAM Journal on Computing, 1976