Separability and Tight Enclosure of Point Sets
From MaRDI portal
Publication:4648754
DOI10.1007/978-94-007-4174-4_8zbMath1251.68290OpenAlexW2117812864MaRDI QIDQ4648754
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
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Oriented matroids in discrete geometry (52C40)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gift-wrapping based preimage computation algorithm
- Computing circular separability
- On the flatness of digital hyperplanes
- An elementary algorithm for digital arc segmentation
- Introduction to Digital Level Layers
- Analytical Description of Digital Circles
- Distance between Separating Circles and Points
- Recognition of Digital Hyperplanes and Level Layers with Forbidden Points
- Three-Dimensional Digital Planes
- 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
- Digital Straight Line Segments
- Computing the Exact Least Median of Squares Estimate and Stability Diagnostics in Multiple Linear Regression
- Lectures on Polytopes
- Convex Polytopes
- The linear time recognition of digital arcs
- Polytopes, graphs, and complexes
This page was built for publication: Separability and Tight Enclosure of Point Sets
