A polygonal approximation for general 4-contours corresponding to weakly simple curves

DOI10.1007/S10851-021-01060-0MaRDI QIDQ2127283zbMATH OpenOpenAlexFDO

Authors Mario Villafuerte, Petra Wiederhold

Publication date 20 April 2022

Published in Journal of Mathematical Imaging and Vision (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10851-021-01060-0

zbMATH Keywords

weakly simple polygoncontour tracingcontour followingminimum perimeter polygonpolygon approximation of 4-contour

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) Computer science (68-XX) Information and communication theory, circuits (94-XX) Computational methods for problems pertaining to convex and discrete geometry (52-08)

Recommendations

• scientific article; zbMATH DE number 2044105
• Publication:3030112
• Polygonal approximation by the minimax method
• A non-parametric sequential method for polygonal approximation of digital curves
• An optimal algorithm for polygonal approximation of digitized curves

Cites work

• scientific article; zbMATH DE number 2129318 (Why is no real title available?)
• scientific article; zbMATH DE number 3757746 (Why is no real title available?)
• scientific article; zbMATH DE number 1241781 (Why is no real title available?)
• scientific article; zbMATH DE number 2084499 (Why is no real title available?)
• scientific article; zbMATH DE number 1746653 (Why is no real title available?)
• A Theory of Nonuniformly Digitized Binary Pictures
• A linear time combinatorial algorithm to compute the relative orthogonal convex hull of digital objects
• Computational Geometry in C
• Detecting weakly simple polygons
• Digital Deformable Model Simulating Active Contours
• Digital geometry in image processing
• Discrete images, objects, and functions in \(Z^ n\)
• Encyclopedia of computer science and technology. In 2 volumes
• Euclidean shortest paths. Exact or approximate algorithms.
• Faithful polygonal representation of the convex and concave parts of a digital curve
• Gauss, Landen, Ramanujan, the Arithmetic-Geometric Mean, Ellipses, π, and the Ladies Diary
• Measuring Concavity on a Rectangular Mosaic
• Minimum-Perimeter Polygons of Digitized Silhouettes
• On local definitions of length of digital curves.
• On piecewise linear approximation of planar Jordan curves
• On separating two simple polygons by a single translation
• 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
• What does digital straightness tell about digital convexity?

Cited in

(1)

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

Describes a project that uses

Uses Software

• Matlab

This page was built for publication: A polygonal approximation for general 4-contours corresponding to weakly simple curves

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