Polygonal chain approximation: A query based approach

DOI10.1016/J.COMGEO.2004.07.001zbMath1068.65033OpenAlexW2040503533MaRDI QIDQ706723

Ovidiu Daescu, Ningfang Mi

Publication date: 9 February 2005

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2004.07.001

zbMATH Keywords

computational geometrypolygonal pathsapproximate polygonal chainsinfinite beam criterionmin-\# problem

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (3)

SIMPLIPOLY: CURVATURE-BASED POLYGONAL CURVE SIMPLIFICATION ⋮ Optimal simplification of polygonal chains for subpixel-accurate rendering ⋮ Farthest-point queries with geometric and combinatorial constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons
• Fractional cascading. I: A data structuring technique
• Fractional cascading. II: Applications
• Efficiently approximating polygonal paths in three and higher dimensions
• Efficient algorithms for approximating polygonal chains
• APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
• Fitting polygonal functions to a set of points in the plane
• SPACE-EFFICIENT ALGORITHMS FOR APPROXIMATING POLYGONAL CURVES IN TWO-DIMENSIONAL SPACE
• APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
• Cartographic line simplication and polygon CSG formulae in O(n log* n) time
• Simplifying a polygonal subdivision while keeping it simple
• Separating objects in the plane by wedges and strips

This page was built for publication: Polygonal chain approximation: A query based approach