Separability and Tight Enclosure of Point Sets

DOI10.1007/978-94-007-4174-4_8MaRDI QIDQ4648754zbMATH OpenOpenAlexFDO

Authors Peter Veelaert

Publication date 16 November 2012

Published in Digital Geometry Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-94-007-4174-4_8

zbMATH Keywords

separationenclosurepoint sets

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Oriented matroids in discrete geometry (52C40)

Recommendations

• scientific article; zbMATH DE number 3979757
• scientific article; zbMATH DE number 4062596
• On separation properties of finite dimensional compact convex sets
• Hyperplane separability and convexity of probabilistic point sets
• Hyperplane separability and convexity of probabilistic point sets
• Separation of convex sets
• Separating points by inclusions of \(\mathcal{O}_\infty\)
• scientific article; zbMATH DE number 3446866

Cites work

• scientific article; zbMATH DE number 53152 (Why is no real title available?)
• scientific article; zbMATH DE number 1182899 (Why is no real title available?)
• scientific article; zbMATH DE number 3804333 (Why is no real title available?)
• An elementary algorithm for digital arc segmentation
• Analytical Description of Digital Circles
• Computing circular separability
• Computing the Exact Least Median of Squares Estimate and Stability Diagnostics in Multiple Linear Regression
• Convex Polytopes
• Digital Disks
• Digital Straight Line Segments
• Discrete Representation of Straight Lines
• Distance between separating circles and points
• Gift-wrapping based preimage computation algorithm
• Introduction to digital level layers
• Lectures on Polytopes
• On Three Constrained Versions of the Digital Circular Arc Recognition Problem
• On the flatness of digital hyperplanes
• Polytopes, graphs, and complexes
• Recognition of digital hyperplanes and level layers with forbidden points
• Representation of digital line segments and their preimages
• The linear time recognition of digital arcs
• Three-Dimensional Digital Planes

Cited in

(6)

• Tightness in subset bounds for coherent configurations
• Classifying ACM sets of points in \({\mathbb{P}^{1} \times \mathbb{P}^{1}}\) via separators
• Separation of points by families of intervals
• Combinatorial properties of support vectors of separating hyperplanes
• A linear separability criterion for sets of Euclidean space
• Separability of imprecise points

This page was built for publication: Separability and Tight Enclosure of Point Sets

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