Fast Combinatorial Algorithm for Tightly Separating Hyperplanes

DOI10.1007/978-3-642-34732-0_3zbMath1377.68293OpenAlexW142043293MaRDI QIDQ4912422

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)

Related Items (4)

An optimized framework for plane-probing algorithms ⋮ Combinatorial properties of support vectors of separating hyperplanes ⋮ An alternative definition for digital convexity ⋮ Digital Plane Recognition with Fewer Probes

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