An envelope operator for full convexity to define polyhedral models in digital spaces

DOI10.1007/s10851-023-01155-wOpenAlexW4384560156MaRDI QIDQ6078193

Fabien Feschet, Jacques-Olivier Lachaud

Publication date: 24 October 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-023-01155-w

zbMATH Keywords

digital geometrydigital convexitypolyhedral modelfull convexityenvelope operator

Mathematics Subject Classification ID

Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Extreme point axioms for closure spaces
• Computing the Ehrhart polynomial of a convex lattice polytope
• Graceful planes and lines.
• 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
• Abstract Convexity, Some Relations and Applications
• Elements of Digital Geometry, Mathematical Morphology, and Discrete Optimization
• Function Algebras on Finite Sets
• Combinatorial Image Analysis
• An alternative definition for digital convexity
• An alternative definition for digital convexity
• Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella.
• Full convexity for polyhedral models in digital spaces

This page was built for publication: An envelope operator for full convexity to define polyhedral models in digital spaces