Separability and Tight Enclosure of Point Sets
From MaRDI portal
Publication:4648754
DOI10.1007/978-94-007-4174-4_8zbMATH Open1251.68290OpenAlexW2117812864MaRDI QIDQ4648754FDOQ4648754
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
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
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Oriented matroids in discrete geometry (52C40)
Cites Work
- Lectures on Polytopes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convex Polytopes
- Digital Straight Line Segments
- Computing the Exact Least Median of Squares Estimate and Stability Diagnostics in Multiple Linear Regression
- Computing circular separability
- Analytical Description of Digital Circles
- An elementary algorithm for digital arc segmentation
- Distance between separating circles and points
- Digital Disks
- Discrete Representation of Straight Lines
- On Three Constrained Versions of the Digital Circular Arc Recognition Problem
- Representation of digital line segments and their preimages
- The linear time recognition of digital arcs
- Introduction to digital level layers
- Recognition of digital hyperplanes and level layers with forbidden points
- Polytopes, graphs, and complexes
- On the flatness of digital hyperplanes
- Three-Dimensional Digital Planes
- Gift-wrapping based preimage computation algorithm
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)
