A convex hull algorithm for discs, and applications
- 1 March 1992
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 1 (3) , 171-187
- https://doi.org/10.1016/0925-7721(92)90015-k
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Lower bounds for line stabbingInformation Processing Letters, 1989
- AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segmentsDiscrete & Computational Geometry, 1987
- A sweepline algorithm for Voronoi diagramsAlgorithmica, 1987
- Efficient algorithms for common transversalsInformation Processing Letters, 1987
- Power Diagrams: Properties, Algorithms and ApplicationsSIAM Journal on Computing, 1987
- Intersection and Closest-Pair Problems for a Set of Planar DiscsSIAM Journal on Computing, 1985
- Stabbing line segmentsBIT Numerical Mathematics, 1982
- On a problem of Davenport and SchinzelActa Arithmetica, 1973
- A Combinatorial Problem Connected with Differential EquationsAmerican Journal of Mathematics, 1965