An alternative definition for digital convexity

DOI10.1007/978-3-030-76657-3_19zbMath1484.68278OpenAlexW3163600192MaRDI QIDQ5918416

Jacques-Olivier Lachaud

Publication date: 21 December 2021

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

Full work available at URL: https://doi.org/10.1007/978-3-030-76657-3_19

zbMATH Keywords

digital geometrydigital convexitysimple connectednesstangential coverarithmetic planesdigital surface reconstruction

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (3)

An envelope operator for full convexity to define polyhedral models in digital spaces ⋮ Full convexity for polyhedral models in digital spaces ⋮ An alternative definition for digital convexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lyndon + Christoffel = digitally convex
• 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
• Maximal Planes and Multiscale Tangential Cover of 3D Digital Objects
• 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

This page was built for publication: An alternative definition for digital convexity