Efficiently approximating polygonal paths in three and higher dimensions
From MaRDI portal
Publication:1601006
DOI10.1007/S00453-001-0096-5zbMATH Open0994.68048OpenAlexW1981507524MaRDI QIDQ1601006FDOQ1601006
Authors: Gill Barequet, Danny Z. Chen, Ovidiu Daescu, Michael T. Goodrich, Jack Snoeyink 
Publication date: 17 June 2002
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.7076
Recommendations
- Distance-preserving approximations of polygonal paths
- Algorithms and Computation
- Area-preserving approximations of polygonal paths
- Approximating Polygonal Curves in Two and Three Dimensions
- scientific article; zbMATH DE number 7650244
- An efficient algorithm for computing high-quality paths amid polygonal obstacles
- An efficient algorithm for computing high-quality paths amid polygonal obstacles
- EFFICIENT APPROXIMATION OF CONVEX POLYGONS
- Approximating shortest paths on a convex polytope in three dimensions
- Approximate shortest path on a polyhedral surface and its applications
Cited In (25)
- Title not available (Why is that?)
- Global Curve Simplification
- Constructing Approximate Shortest Path Maps in Three Dimensions
- New results on path approximation
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Polygonal chain approximation: A query based approach
- Approximating points by a piecewise linear function
- Distance-preserving approximations of polygonal paths
- Minimum-sum dipolar spanning tree in \(\mathbb R^3\)
- Hausdorff approximation of convex polygons
- Data reduction of large vector graphics
- Embedding ray intersection graphs and global curve simplification
- SPACE-EFFICIENT ALGORITHMS FOR APPROXIMATING POLYGONAL CURVES IN TWO-DIMENSIONAL SPACE
- CIM algorithm for approximating three-dimensional polygonal curves
- Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance
- Extremal point queries with lines and line segments and related problems
- Area-preserving approximations of polygonal paths
- Efficient Computation of the Outer Hull of a Discrete Path
- On optimal polyline simplification using the Hausdorff and Fréchet distance
- Polygonal path approximation with angle constraints
- The equipartition of curves
- Polygonal path simplification with angle constraints
- Finding long and similar parts of trajectories
- Representing a functional curve by curves with fewer peaks
- Efficient algorithms for 3-D polygonal approximation based on LISE criterion
This page was built for publication: Efficiently approximating polygonal paths in three and higher dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1601006)
