Computing circular separability
Open Access
- 1 June 1986
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 1 (2) , 105-113
- https://doi.org/10.1007/bf02187688
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Linear programming in O(n × 3d) timeInformation Processing Letters, 1986
- Finding extreme points in three dimensions and solving the post-office problem in the planeInformation Processing Letters, 1985
- Linear Time Algorithms for Two- and Three-Variable Linear ProgramsSIAM Journal on Computing, 1984
- Linear Programming in Linear Time When the Dimension Is FixedJournal of the ACM, 1984
- Fast detection of polyhedral intersectionTheoretical Computer Science, 1983
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related ProblemsSIAM Journal on Computing, 1983
- Computing largest empty circles with location constraintsInternational Journal of Parallel Programming, 1983
- Optimal Search in Planar SubdivisionsSIAM Journal on Computing, 1983
- The complexity of linear programmingTheoretical Computer Science, 1980
- Convex hulls of finite sets of points in two and three dimensionsCommunications of the ACM, 1977