Approximation of point sets by 1-corner polygonal chains

DOI10.1287/IJOC.12.4.317.11880MaRDI QIDQ2884491zbMATHOpenAlexFDO

Authors Ferran Hurtado, J. M. 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)

Recommendations

• Fitting polygonal functions to a set of points in the plane
• Polygonal chain approximation: A query based approach
• Computing obnoxious 1-corner polygonal chains
• Fitting rectilinear polgonal curves to a set of points in the plane.
• Rectilinear Approximation of a Set of Points in the Plane

Cited in

(7)

• Approximation and rough classification of letter-like polygon shapes
• Computing obnoxious 1-corner polygonal chains
• Computing shortest heterochromatic monotone routes
• THE ANCHORED VORONOI DIAGRAM: STATIC, DYNAMIC VERSIONS AND APPLICATIONS
• Fitting a two-joint orthogonal chain to a point set
• Continuous location of dimensional structures.
• Computing an obnoxious anchored segment.

This page was built for publication: Approximation of point sets by 1-corner polygonal chains

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