Full convexity for polyhedral models in digital spaces

DOI10.1007/978-3-031-19897-7_9zbMATH Open1522.68647OpenAlexW4307054465MaRDI QIDQ6160792FDOQ6160792

Authors: Fabien Feschet, Jacques-Olivier Lachaud 

Publication date: 2 June 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-19897-7_9

Recommendations

• An alternative definition for digital convexity
• Three-Dimensional Digital Planes
• scientific article; zbMATH DE number 2084496
• Digital convex + unimodular mapping = 8-connected (all points but one 4-connected)
• First steps in the algorithmic reconstruction of digital convex sets

zbMATH Keywords

digital geometrydigital convexitypolyhedral model

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• The quickhull algorithm for convex hulls
• Graceful planes and lines.
• Function Algebras on Finite Sets
• Abstract Convexity, Some Relations and Applications
• Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella.
• Title not available (Why is that?)
• Extreme point axioms for closure spaces
• Digital Straight Lines and Convexity of Digital Regions
• Convex Digital Solids
• Combinatorial Image Analysis
• Title not available (Why is that?)
• A bibliography on digital and computational convexity (1961-1988)
• An alternative definition for digital convexity
• An alternative definition for digital convexity

Cited In (1)

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

This page was built for publication: Full convexity for polyhedral models in digital spaces

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