Computing homotopic line simplification

DOI10.1016/j.comgeo.2014.02.002zbMath1296.65032OpenAlexW2150361202MaRDI QIDQ2249045

Yanyan Li

Publication date: 27 June 2014

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

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

zbMATH Keywords

homotopycomputational geometrypath simplification

Mathematics Subject Classification ID

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

Cites Work

• Approximating the Fréchet distance for realistic curves in near linear time
• Near-linear time approximation algorithms for curve simplification
• Optimal simplification of polygonal chains for subpixel-accurate rendering
• The complexity of optimization problems
• Making data structures persistent
• Testing homotopy for paths in the plane
• New similarity measures between polylines with applications to morphing and polygon sweeping
• Efficient piecewise-linear function approximation using the uniform metric
• APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
• Computing homotopic shortest paths in the plane
• AN OPTIMAL MORPHING BETWEEN POLYLINES
• Simplifying a polygonal subdivision while keeping it simple
• Computing the visibility graph of points within a polygon
• Streaming algorithms for line simplification
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing homotopic line simplification