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

DOI10.1007/S10851-021-01060-0OpenAlexW4206359053MaRDI QIDQ2127283FDOQ2127283

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

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

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)

Cites Work

• On piecewise linear approximation of planar Jordan curves
• Faithful polygonal representation of the convex and concave parts of a digital curve
• Title not available (Why is that?)
• Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour
• Minimum-Perimeter Polygons of Digitized Silhouettes
• Discrete images, objects, and functions in \(Z^ n\)
• Detecting weakly simple polygons
• Euclidean shortest paths. Exact or approximate algorithms.
• Computational Geometry in C
• Title not available (Why is that?)
• Title not available (Why is that?)
• On local definitions of length of digital curves.
• Gauss, Landen, Ramanujan, the Arithmetic-Geometric Mean, Ellipses, π, and the Ladies Diary
• On separating two simple polygons by a single translation
• A linear time combinatorial algorithm to compute the relative orthogonal convex hull of digital objects
• Title not available (Why is that?)
• What does digital straightness tell about digital convexity?
• Measuring Concavity on a Rectangular Mosaic
• Digital Deformable Model Simulating Active Contours
• Two linear-time algorithms for computing the minimum length polygon of a digital contour
• A Theory of Nonuniformly Digitized Binary Pictures
• Digital geometry in image processing
• Encyclopedia of computer science and technology. In 2 volumes
• Title not available (Why is that?)

Cited In (1)

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

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)