The exact fitting problem in higher dimensions
type: Item
instance of: scholarly article
title: The exact fitting problem in higher dimensions
zbMATH Open document ID: 0851.68112
DOI: 10.1016/0925-7721(95)00020-8
author: Leonidas Guibas
author: Mark H. Overmars
author: Jean-Marc Robert
published in: Computational Geometry
publication date: 1996-11-17T00:00:00Z
full work available at URL: https://dspace.library.uu.nl/handle/1874/16540
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 902886
zbMATH Keywords: exact fitting problem
MaRDI profile type: Publication
OpenAlex ID: W2027132034
cites work: Partitioning arrangements of lines. II: Applications
cites work: The Number of Furthest Neighbour Pairs of a Finite Planar Set
cites work: Repeated distances in space
cites work: Q3686040
cites work: Q4040055
cites work: Cutting hyperplanes for divide-and-conquer
cites work: A deterministic view of random sampling and its use in geometry
cites work: Sphere-and-point incidence relations in high dimensions with applications to unit distances and furthest-neighbor pairs
cites work: The number of different distances determined by a set of points in the Euclidean plane
cites work: A Randomized Algorithm for Closest-Point Queries
cites work: Combinatorial complexity bounds for arrangements of curves and spheres
cites work: Q3772828
cites work: Topologically sweeping an arrangement
cites work: The complexity of many cells in arrangements of planes and related problems
cites work: On the Number of Furthest Neighbour Pairs in a Point Set
cites work: On Sets of Distances of n Points
cites work: Q3270291
cites work: On some problems of elementary and combinatorial geometry
cites work: Better lower bounds on detecting affine and spherical degeneracies
cites work: Q5547252
cites work: Orthogonal weightet linear \(L_ 1\) and \(L_ \infty\) approximation and applications
cites work: Computing the width of a set
cites work: On a problem of K. Zarankiewicz
cites work: Cutting hyperplane arrangements
cites work: Range searching with efficient hierarchical cuttings
cites work: Finding repeated elements
cites work: On the Different Distances Determined by n Points
cites work: Q5186278
cites work: Extremal problems in discrete geometry
Recommended article: Q3978760
Recommended article: The Fitting ideal problem
Recommended article: On hyperplanes of closest fit
Recommended article: The Curve Fitting Problem: A Solution
Recommended article: Exact interior solutions in higher dimensions
Recommended article: Solution of the Littlewood-Offord problem in high dimensions
Recommended article: A commutative algebraic approach to the fitting problem
Recommended article: Galvin’s problem in higher dimensions
Recommended article: Q3684753
description: scientific article; zbMATH DE number 902886