Combinatorial complexity bounds for arrangements of curves and spheres
- 1 March 1990
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 5 (2) , 99-160
- https://doi.org/10.1007/bf02187783
Abstract
No abstract availableKeywords
This publication has 41 references indexed in Scilit:
- On the Number of Furthest Neighbour Pairs in a Point SetThe American Mathematical Monthly, 1989
- A Problem of Leo Moser About Repeated Distances on the SphereThe American Mathematical Monthly, 1989
- Topologically sweeping an arrangementJournal of Computer and System Sciences, 1989
- Repeated distances in spaceGraphs and Combinatorics, 1988
- A sweepline algorithm for Voronoi diagramsAlgorithmica, 1987
- Primitives for the manipulation of general subdivisions and the computation of VoronoiACM Transactions on Graphics, 1985
- The power of geometric dualityBIT Numerical Mathematics, 1985
- Über ein Problem von K. ZarankiewiczActa Mathematica Hungarica, 1958
- Beweis einer Vermutung von A. VázsonyiActa Mathematica Hungarica, 1956
- On Sets of Distances of n PointsThe American Mathematical Monthly, 1946