Orthogonal weightet linear \(L_ 1\) and \(L_ \infty\) approximation and applications
From MaRDI portal
Publication:2367406
DOI10.1016/0166-218X(93)90113-3zbMath0770.68110MaRDI QIDQ2367406
Michael E. Houle, Jean-Marc Robert, Peter Yamamoto, Keiko Imai, Hiroshi Imai
Publication date: 10 August 1993
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
A two-phase heuristic for the bottleneck \(k\)-hyperplane clustering problem, The exact fitting problem in higher dimensions, Minmax-distance approximation and separation problems: geometrical properties, Continuous location of dimensional structures., The \(k\)-centrum straight-line location problem, Linear approximation of simple objects, Minsum hyperspheres in normed spaces, Weighted Rectilinear Approximation of Points in the Plane, Median hyperplanes in normed spaces -- a survey
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding the upper envelope of n line segments in O(n log n) time
- Algorithms for high dimensional stabbing problems
- The upper envelope of piecewise linear functions: Algorithms and applications
- The power of geometric duality revisited
- Finding transversals for sets of simple geometric figures
- Geometric complexity of some location problems
- Topologically sweeping an arrangement
- Stabbing line segments
- Linear facility location. Solving extensions of the basic problem
- Applications of random sampling in computational geometry. II
- Polygonal approximation by the minimax method
- Finding Least-Distances Lines
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Computing the width of a set
- Fitting hyperplanes by minimizing orthogonal deviations
- Convex hulls of finite sets of points in two and three dimensions
