Approximating finite weighted point sets by hyperplanes

DOI10.1007/3-540-52846-6_96MaRDI QIDQ5056110zbMATH OpenOpenAlexFDO

Authors

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

• An Implicit Enumeration Algorithm for Quadratic Integer Programming
• Constructing Arrangements of Lines and Hyperplanes with Applications
• Finding Least-Distances Lines
• Fitting hyperplanes by minimizing orthogonal deviations
• scientific article; zbMATH DE number 4131656 (Why is no real title available?)
• scientific article; zbMATH DE number 3830759 (Why is no real title available?)
• scientific article; zbMATH DE number 431989 (Why is no real title available?)
• scientific article; zbMATH DE number 3926931 (Why is no real title available?)
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 4032503 (Why is no real title available?)
• scientific article; zbMATH DE number 3573250 (Why is no real title available?)
• On the complexity of locating linear facilities in the plane
• On Zonotopes
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• The power of geometric duality
• The power of geometric duality revisited
• Topologically sweeping an arrangement

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5056110)