On the general chain pair simplification problem

DOI10.4230/LIPICS.MFCS.2016.37MaRDI QIDQ4608597zbMATH OpenFDO

Authors Chenglin Fan, Omrit Filtser, Binhai Zhu, Matthew J. Katz

Publication date 21 March 2018

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2016.37

zbMATH Keywords

chain simplificationdiscrete Fréchet distancedynamic programminggeometric arrangementsprotein structural resemblance

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• On the Chain Pair Simplification Problem
• Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance
• On optimal polyline simplification using the Hausdorff and Fréchet distance
• Universal approximate simplification under the discrete Fréchet distance
• On optimal polyline simplification using the Hausdorff and Fréchet distance

Cited in

(7)

• Universal approximate simplification under the discrete Fréchet distance
• Generic chaining and the \(\ell _{1}\)-penalty
• Consistent simplification of polyline tree bundles
• On the Chain Pair Simplification Problem
• scientific article; zbMATH DE number 177853 (Why is no real title available?)
• The Parallel Simplicity of Compaction and Chaining
• Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance

This page was built for publication: On the general chain pair simplification problem

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