The exact fitting problem in higher dimensions
From MaRDI portal
Publication:1917054
DOI10.1016/0925-7721(95)00020-8zbMath0851.68112OpenAlexW2027132034MaRDI QIDQ1917054
Leonidas J. Guibas, Jean-Marc Robert, Mark H. Overmars
Publication date: 17 November 1996
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/16540
Related Items
On counting point-hyperplane incidences, Finding Points in General Position, Covering points with convex sets of minimum size, FPT-ALGORITHMS FOR MINIMUM-BENDS TOURS, Efficient algorithms for maximum regression depth, A commutative algebraic approach to the fitting problem, Covering Points with Convex Sets of Minimum Size
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of many cells in arrangements of planes and related problems
- Range searching with efficient hierarchical cuttings
- A deterministic view of random sampling and its use in geometry
- Extremal problems in discrete geometry
- Combinatorial complexity bounds for arrangements of curves and spheres
- Partitioning arrangements of lines. II: Applications
- Repeated distances in space
- Sphere-and-point incidence relations in high dimensions with applications to unit distances and furthest-neighbor pairs
- Topologically sweeping an arrangement
- Finding repeated elements
- Cutting hyperplane arrangements
- The number of different distances determined by a set of points in the Euclidean plane
- Cutting hyperplanes for divide-and-conquer
- On some problems of elementary and combinatorial geometry
- Better lower bounds on detecting affine and spherical degeneracies
- Orthogonal weightet linear \(L_ 1\) and \(L_ \infty\) approximation and applications
- On the Number of Furthest Neighbour Pairs in a Point Set
- The Number of Furthest Neighbour Pairs of a Finite Planar Set
- A Randomized Algorithm for Closest-Point Queries
- Computing the width of a set
- On the Different Distances Determined by n Points
- On a problem of K. Zarankiewicz
- On Sets of Distances of n Points
