Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance

DOI10.1007/978-3-540-78773-0_54MaRDI QIDQ5458565zbMATH OpenOpenAlexFDO

Authors Sergey Bereg, Wencheng Wang, Boting Yang, Binhai Zhu, Minghui Jiang

Publication date 15 April 2008

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

Full work available at URL https://doi.org/10.1007/978-3-540-78773-0_54

Mathematics Subject Classification ID

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

Recommendations

• Universal approximate simplification under the discrete Fréchet distance
• On the Chain Pair Simplification Problem
• On the general chain pair simplification problem
• On optimal polyline simplification using the Hausdorff and Fréchet distance
• On optimal polyline simplification using the Hausdorff and Fréchet distance

Cites work

• scientific article; zbMATH DE number 4026646 (Why is no real title available?)
• scientific article; zbMATH DE number 4074316 (Why is no real title available?)
• scientific article; zbMATH DE number 4082817 (Why is no real title available?)
• scientific article; zbMATH DE number 176499 (Why is no real title available?)
• APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
• APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• Efficiently approximating polygonal paths in three and higher dimensions
• Linear Programming in Linear Time When the Dimension Is Fixed
• Near-linear time approximation algorithms for curve simplification
• Optimal output-sensitive convex hull algorithms in two and three dimensions
• SPACE-EFFICIENT ALGORITHMS FOR APPROXIMATING POLYGONAL CURVES IN TWO-DIMENSIONAL SPACE
• The Approximability of the Exemplar Breakpoint Distance Problem

Cited in

(12)

• Global Curve Simplification
• On the Chain Pair Simplification Problem
• Voronoi diagram of polygonal chains under the discrete Fréchet distance
• Static and streaming data structures for Fréchet distance queries
• A retrospective on genomic preprocessing for comparative genomics
• Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance
• Approximate nearest neighbor for curves -- simple, efficient, and deterministic
• Minimum-complexity graph simplification under the Fréchet-like distance
• Universal approximate simplification under the discrete Fréchet distance
• Consistent simplification of polyline tree bundles
• Approximate nearest neighbor for curves: simple, efficient, and deterministic
• On the general chain pair simplification problem

This page was built for publication: Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance

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