Approximating finite weighted point sets by hyperplanes

DOI10.1007/3-540-52846-6_96zbMath1502.68329OpenAlexW2117923653MaRDI QIDQ5056110

No author found.

Publication date: 9 December 2022

Published in: SWAT 90 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-52846-6_96

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• The power of geometric duality revisited
• The power of geometric duality
• Topologically sweeping an arrangement
• On the complexity of locating linear facilities in the plane
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• Finding Least-Distances Lines
• Constructing Arrangements of Lines and Hyperplanes with Applications
• Fitting hyperplanes by minimizing orthogonal deviations
• An Implicit Enumeration Algorithm for Quadratic Integer Programming
• On Zonotopes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximating finite weighted point sets by hyperplanes