Distance-preserving approximations of polygonal paths

DOI10.1016/j.comgeo.2006.05.002zbMath1118.65013OpenAlexW2152588767MaRDI QIDQ868106

Giri Narasimhan, Joachim Gudmundsson, Michiel H. M. Smid

Publication date: 19 February 2007

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

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

zbMATH Keywords

numerical examplesexperimental algorithmswell-separated pair decompositionpath simplification\(t\)-spannersminimum number of vertices

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (3)

SIMPLIPOLY: CURVATURE-BASED POLYGONAL CURVE SIMPLIFICATION ⋮ Straight-path queries in trajectory data ⋮ Progressive simplification of polygonal curves

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Area-preserving approximations of polygonal paths
• Cartographic line simplification and polygon CSG formulae in \(O(n\log^* n)\) time
• Efficiently approximating polygonal paths in three and higher dimensions
• Efficient piecewise-linear function approximation using the uniform metric
• Efficient algorithms for approximating polygonal chains
• Polygonal path simplification with angle constraints
• A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
• SPACE-EFFICIENT ALGORITHMS FOR APPROXIMATING POLYGONAL CURVES IN TWO-DIMENSIONAL SPACE
• APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
• SOFSEM 2006: Theory and Practice of Computer Science

This page was built for publication: Distance-preserving approximations of polygonal paths