Computing the minimal perimeter polygon for sets of rectangular tiles based on visibility cones
P Wiederhold - Journal of Mathematical Imaging and Vision, 2024 - Springer
To study convexity properties of digital planar objects, the minimum perimeter polygon
(MPP) was defined in the 1970 s in articles by Sklansky, Chazin, Hansen, Kibler, and Kim …
(MPP) was defined in the 1970 s in articles by Sklansky, Chazin, Hansen, Kibler, and Kim …
A polygonal approximation for general 4-contours corresponding to weakly simple curves
M Villafuerte, P Wiederhold - Journal of Mathematical Imaging and Vision, 2022 - Springer
The paper proposes a polygonal approximation for closed 4-paths obtained from standard
contour following under 4-connectivity. Those 4-contours generate weakly simple polygons …
contour following under 4-connectivity. Those 4-contours generate weakly simple polygons …
Computing the minimal perimeter polygon for digital objects in the triangular tiling
P Wiederhold - Discrete Applied Mathematics, 2025 - Elsevier
This work presents an algorithm, together with its correctness proof, to determine the
minimum perimeter polygon (MPP) for digital objects given as regular complexes in the …
minimum perimeter polygon (MPP) for digital objects given as regular complexes in the …
On the Minimal Perimeter Polygon for Digital Objects in the Triangular Tiling
P Wiederhold - Mexican Conference on Pattern Recognition, 2024 - Springer
The present work proposes an algorithm to determine the minimum perimeter polygon
(MPP) of digital objects given as edge-adjacency-connected sets of tiles, in the plane tiling …
(MPP) of digital objects given as edge-adjacency-connected sets of tiles, in the plane tiling …
Digital shape analysis with maximal segments
JO Lachaud - International Workshop on Applications of Discrete …, 2010 - Springer
We show in this paper how a digital shape can be efficiently analyzed through the maximal
segments defined along its digital contour. They are efficiently computable. They can be …
segments defined along its digital contour. They are efficiently computable. They can be …
Curve length estimation based on cubic spline interpolation in gray-scale images
Z Wang, J Ouyang - Journal of Zhejiang University SCIENCE C, 2013 - Springer
This paper deals with a novel local arc length estimator for curves in gray-scale images. The
method first estimates a cubic spline curve fit for the boundary points using the gray-level …
method first estimates a cubic spline curve fit for the boundary points using the gray-level …
[PDF][PDF] Aportaciones a la estimación del perímetro de curvas y áreas de superficies digitales
M Villafuerte Bante - tesis.ipn.mx
La presente tesis desarrolla una propuesta de aproximación poligonal para caminos en 4-
gráficas vecinas, las cuales constituyen un modelo estándar en el procesamiento y análisis …
gráficas vecinas, las cuales constituyen un modelo estándar en el procesamiento y análisis …
[HTML][HTML] Euclidean farthest-point Voronoi diagram of a digital edge
T Roussillon - Discrete Applied Mathematics, 2015 - Elsevier
A digital edge is a digitization of a straight segment joining two points of integer coordinates.
Such a digital set may be analytically defined by the rational slope of the straight segment …
Such a digital set may be analytically defined by the rational slope of the straight segment …