An alternative definition for digital convexity
DOI10.1007/s10851-022-01076-0OpenAlexW4225565571MaRDI QIDQ5925581
Publication date: 25 January 2023
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10851-022-01076-0
digital geometrydigital convexitysimple connectednesstangential coverarithmetic planesdigital surface reconstruction
Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Lattices and convex bodies in (2) dimensions (aspects of discrete geometry) (52C05) Computer science (68-XX) Information and communication theory, circuits (94-XX) Computational methods for problems pertaining to convex and discrete geometry (52-08)
Related Items (2)
Uses Software
Cites Work
- A note on two problems in connexion with graphs
- An output-sensitive algorithm to compute the normal vector of a digital plane
- Generation and recognition of digital planes using multi-dimensional continued fractions
- Lyndon + Christoffel = digitally convex
- Curvature estimation along noisy digital contours by approximate global optimization
- Digital planarity -- a review
- Minimum decomposition of a digital surface into digital plane segments is NP-hard
- 3D noisy discrete objects: Segmentation and application to smoothing
- An optimal convex hull algorithm in any fixed dimension
- Computing the Ehrhart polynomial of a convex lattice polytope
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- Decomposition of a three-dimensional discrete object surface into discrete plane pieces
- Efficiently testing digital convexity and recognizing digital convex polygons
- An optimized framework for plane-probing algorithms
- Faithful polygonal representation of the convex and concave parts of a digital curve
- Two plane-probing algorithms for the computation of the normal vector to a digital plane
- An elementary digital plane recognition algorithm
- Maximal Planes and Multiscale Tangential Cover of 3D Digital Objects
- CHARACTERIZING DIGITAL STRAIGHTNESS AND DIGITAL CONVEXITY BY MEANS OF DIFFERENCE OPERATORS
- A bibliography on digital and computational convexity (1961-1988)
- Digital Straight Lines and Convexity of Digital Regions
- Convex Digital Solids
- The quickhull algorithm for convex hulls
- A linear incremental algorithm for naive and standard digital lines and planes recognition
- Fast Combinatorial Algorithm for Tightly Separating Hyperplanes
- Digital Plane Recognition with Fewer Probes
- Efficient Algorithms to Test Digital Convexity
- Combinatorial View of Digital Convexity
- An Efficient and Quasi Linear Worst-Case Time Algorithm for Digital Plane Recognition
- Computation of the Normal Vector to a Digital Plane by Sampling Significant Points
- An alternative definition for digital convexity
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An alternative definition for digital convexity
