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

DOI10.1016/J.DAM.2024.11.026MaRDI QIDQ6671384zbMATH OpenFDO

Authors Petra Wiederhold

Publication date 27 January 2025

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

Full work available at URL https://doi.org/10.1016/J.DAM.2024.11.026

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Recommendations

• Triangular covers of a digital object
• A linear-time algorithm to compute the triangular hull of a digital object
• Finding Shortest Triangular Path in a Digital Object
• Two linear-time algorithms for computing the minimum length polygon of a digital contour

Cites work

• scientific article; zbMATH DE number 2129318 (Why is no real title available?)
• scientific article; zbMATH DE number 1241781 (Why is no real title available?)
• scientific article; zbMATH DE number 480250 (Why is no real title available?)
• A Theory of Nonuniformly Digitized Binary Pictures
• A note on minimal length polygonal approximation to a digitized contour
• A polygonal approximation for general 4-contours corresponding to weakly simple curves
• Cellular topology and topological coordinate systems on the hexagonal and on the triangular grids
• Digital and cellular convexity
• Digitized rotations of 12 neighbors on the triangular grid
• Digitized rotations of closest neighborhood on the triangular grid
• Encyclopedia of computer science and technology. In 2 volumes
• Faithful polygonal representation of the convex and concave parts of a digital curve
• Local and global topology preservation in locally finite sets of tiles
• Minimum-Perimeter Polygons of Digitized Silhouettes
• On piecewise linear approximation of planar Jordan curves
• On separating two simple polygons by a single translation
• On topology preservation of mixed operators in triangular, square, and hexagonal grids
• Thinning on cell complexes from polygonal tilings
• Topology preservation on the triangular grid
• Trajectories and Traces on Non-traditional Regular Tessellations of the Plane
• Triangular covers of a digital object
• Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour
• Two linear-time algorithms for computing the minimum length polygon of a digital contour
• Weighted Distances on a Triangular Grid

Cited in

(1)

• Border tracing in oriented adjacency graphs of polygonal tilings

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

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