The exact fitting problem in higher dimensions
From MaRDI portal
Publication:1917054
DOI10.1016/0925-7721(95)00020-8zbMATH Open0851.68112OpenAlexW2027132034MaRDI QIDQ1917054FDOQ1917054
Authors: Leonidas Guibas, Mark H. Overmars, Jean-Marc Robert 
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
Recommendations
- scientific article; zbMATH DE number 12860
- The Fitting ideal problem
- On hyperplanes of closest fit
- The Curve Fitting Problem: A Solution
- Exact interior solutions in higher dimensions
- Solution of the Littlewood-Offord problem in high dimensions
- A commutative algebraic approach to the fitting problem
- Galvin’s problem in higher dimensions
- scientific article; zbMATH DE number 3907265
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finding repeated elements
- Title not available (Why is that?)
- A deterministic view of random sampling and its use in geometry
- On a problem of K. Zarankiewicz
- The complexity of many cells in arrangements of planes and related problems
- On Sets of Distances of n Points
- Extremal problems in discrete geometry
- Combinatorial complexity bounds for arrangements of curves and spheres
- The number of different distances determined by a set of points in the Euclidean plane
- On the Different Distances Determined by n Points
- Topologically sweeping an arrangement
- On some problems of elementary and combinatorial geometry
- Title not available (Why is that?)
- Cutting hyperplanes for divide-and-conquer
- Better lower bounds on detecting affine and spherical degeneracies
- A Randomized Algorithm for Closest-Point Queries
- Range searching with efficient hierarchical cuttings
- Computing the width of a set
- Orthogonal weightet linear \(L_ 1\) and \(L_ \infty\) approximation and applications
- Partitioning arrangements of lines. II: Applications
- Cutting hyperplane arrangements
- Title not available (Why is that?)
- Repeated distances in space
- Sphere-and-point incidence relations in high dimensions with applications to unit distances and furthest-neighbor pairs
- On the Number of Furthest Neighbour Pairs in a Point Set
- The Number of Furthest Neighbour Pairs of a Finite Planar Set
- Title not available (Why is that?)
Cited In (10)
- On counting point-hyperplane incidences
- Efficient robust digital hyperplane fitting with bounded error
- Finding points in general position
- Efficient algorithms for maximum regression depth
- The Fitting Problem in a Lattice Universe
- Digital hyperplane fitting
- Covering points with convex sets of minimum size
- FPT-algorithms for minimum-bends tours
- Covering Points with Convex Sets of Minimum Size
- A commutative algebraic approach to the fitting problem
This page was built for publication: The exact fitting problem in higher dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1917054)
