Lines, circles, planes and spheres

From MaRDI portal
Publication:603878

DOI10.1007/S00454-010-9270-3zbMATH Open1227.05105arXiv0907.0724OpenAlexW3104636610MaRDI QIDQ603878FDOQ603878


Authors: George B. Purdy, Justin W. Smith Edit this on Wikidata


Publication date: 8 November 2010

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Abstract: Let S be a set of n points in mathbbR3, no three collinear and not all coplanar. If at most nk are coplanar and n is sufficiently large, the total number of planes determined is at least . For similar conditions and sufficiently large n, (inspired by the work of P. D. T. A. Elliott in cite{Ell67}) we also show that the number of spheres determined by n points is at least , and this bound is best possible under its hypothesis. (By t3orchard(n), we are denoting the maximum number of three-point lines attainable by a configuration of n points, no four collinear, in the plane, i.e., the classic Orchard Problem.) New lower bounds are also given for both lines and circles.


Full work available at URL: https://arxiv.org/abs/0907.0724




Recommendations




Cites Work


Cited In (8)





This page was built for publication: Lines, circles, planes and spheres

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q603878)