Approximation of Point Sets by 1-Corner Polygonal Chains

DOI10.1287/ijoc.12.4.317.11880zbMath1238.90089OpenAlexW2057096900MaRDI QIDQ2884491

Ferran Hurtado, José-Miguel Díaz-Báñez, Francisco Gómez

Publication date: 30 May 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.12.4.317.11880

zbMATH Keywords

analysis of algorithmsdata structures

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Discrete location and assignment (90B80)

Related Items (6)

Continuous location of dimensional structures. ⋮ Computing an obnoxious anchored segment. ⋮ Computing shortest heterochromatic monotone routes ⋮ THE ANCHORED VORONOI DIAGRAM: STATIC, DYNAMIC VERSIONS AND APPLICATIONS ⋮ Approximation and Rough Classification of Letter-Like Polygon Shapes ⋮ Computing obnoxious 1-corner polygonal chains

This page was built for publication: Approximation of Point Sets by 1-Corner Polygonal Chains