Full convexity for polyhedral models in digital spaces

DOI10.1007/978-3-031-19897-7_9MaRDI QIDQ6160792zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

digital geometrydigital convexitypolyhedral model

Mathematics Subject Classification ID

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

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

Cites work

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

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)