Computing the minimal perimeter polygon for digital objects in the triangular tiling

DOI10.1016/j.dam.2024.11.026MaRDI QIDQ6671384

Petra Wiederhold

Publication date: 27 January 2025

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

relative convex hulltriangular tilingminimum perimeter polygongeodesic convex hullboundary tracing for triangular pixelsregular complex of triangular tilestriangular mosaic

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Convex functions and convex programs in convex geometry (52A41) Discrete mathematics in relation to computer science (68R99) Computational methods for problems pertaining to convex and discrete geometry (52-08)

This page was built for publication: Computing the minimal perimeter polygon for digital objects in the triangular tiling