An Improved Bound for k-Sets in Three Dimensions
Open Access
- 1 January 2001
- journal article
- research article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 26 (2) , 195-204
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Improved Bounds for Planar k -Sets and Related ProblemsDiscrete & Computational Geometry, 1998
- On Levels in Arrangements of Lines, Segments, Planes, and Triangles%Discrete & Computational Geometry, 1998
- Cutting dense point sets in halfDiscrete & Computational Geometry, 1997
- Counting triangle crossings and halving planesDiscrete & Computational Geometry, 1994
- Onk-sets in arrangements of curves and surfacesDiscrete & Computational Geometry, 1991
- Points and triangles in the plane and halving planes in spaceDiscrete & Computational Geometry, 1991
- On the number of halving planesCombinatorica, 1990
- More onk-sets of finite sets in the planeDiscrete & Computational Geometry, 1986
- On the number of line separations of a finite set in the planeJournal of Combinatorial Theory, Series A, 1985