The exact fitting problem in higher dimensions
- 31 July 1996
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 6 (4), 215-230
- https://doi.org/10.1016/0925-7721(95)00020-8
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Cutting hyperplanes for divide-and-conquerDiscrete & Computational Geometry, 1993
- The number of different distances determined by a set of points in the Euclidean planeDiscrete & Computational Geometry, 1992
- Partitioning arrangements of lines II: ApplicationsDiscrete & Computational Geometry, 1990
- A deterministic view of random sampling and its use in geometryCombinatorica, 1990
- Combinatorial complexity bounds for arrangements of curves and spheresDiscrete & Computational Geometry, 1990
- Sphere-and-point incidence relations in high dimensions with applications to unit distances and furthest-neighbor pairsDiscrete & Computational Geometry, 1989
- Topologically sweeping an arrangementJournal of Computer and System Sciences, 1989
- Repeated distances in spaceGraphs and Combinatorics, 1988
- A Randomized Algorithm for Closest-Point QueriesSIAM Journal on Computing, 1988
- The Number of Furthest Neighbour Pairs of a Finite Planar SetThe American Mathematical Monthly, 1984