Fast Combinatorial Algorithm for Tightly Separating Hyperplanes

DOI10.1007/978-3-642-34732-0_3MaRDI QIDQ4912422zbMATH OpenOpenAlexFDO

Authors Peter Veelaert

Publication date 4 April 2013

Published in Combinatorial Image Analaysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-34732-0_3

zbMATH Keywords

separating hyperplanesarithmetical thicknessenclosure of point sets

Mathematics Subject Classification ID

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

Recommendations

• An algorithmic separating hyperplane theorem and its applications
• A new effective algorithm for constructing a separating hyperplane
• Cutting hyperplanes for divide-and-conquer
• Computing Maximally Separated Sets in the Plane
• Fast Algorithms for Pseudoarboricity
• A linear algorithm for determining the separation of convex polyhedra
• scientific article; zbMATH DE number 1555984
• scientific article; zbMATH DE number 1929930
• Separating plane algorithms for convex optimization

Cited in

(5)

• Fast Algorithms for Pseudoarboricity
• Combinatorial properties of support vectors of separating hyperplanes
• Digital plane recognition with fewer probes
• An optimized framework for plane-probing algorithms
• An alternative definition for digital convexity

This page was built for publication: Fast Combinatorial Algorithm for Tightly Separating Hyperplanes

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