Line simplification with restricted orientations

DOI10.1007/3-540-48447-7_2MaRDI QIDQ3024757zbMATH OpenFDO

Authors Gabriele Neyer

Publication date 4 July 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/20.500.11850/69331

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• On optimal polyline simplification using the Hausdorff and Fréchet distance
• On optimal polyline simplification using the Hausdorff and Fréchet distance
• Near-linear time approximation algorithms for curve simplification
• Polyline simplification has cubic complexity
• Computing homotopic line simplification

Cited in

(12)

• Homotopic \(\mathcal{C}\)-oriented routing with few links and thick edges
• Schematization of networks
• Approximation algorithms for aligning points
• Efficient observer-dependent simplification in polygonal domains
• Minimum-link paths revisited
• Polygonal path simplification with angle constraints
• On \(d\)-regular schematization of embedded paths
• On the Hardness of Orthogonal-Order Preserving Graph Drawing
• Simplexwise Linear Untangling
• On simplifying shapes by subjecting them to collinearity constraints
• Minimum-link C-oriented paths visiting a sequence of regions in the plane
• Shortcut hulls: vertex-restricted outer simplifications of polygons

This page was built for publication: Line simplification with restricted orientations

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