Polygonal path simplification with angle constraints
From MaRDI portal
Publication:2571211
DOI10.1016/j.comgeo.2004.09.003zbMath1082.65018OpenAlexW2045113944WikidataQ56970555 ScholiaQ56970555MaRDI QIDQ2571211
Ovidiu Daescu, Peter M. Kogge, Ningfang Mi, Danny Z. Chen, J. E. Hershberger, Jack Scott Snoeyink
Publication date: 1 November 2005
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2004.09.003
Related Items (7)
Embedding ray intersection graphs and global curve simplification ⋮ Dynamic Minimum Bichromatic Separating Circle ⋮ Distance-preserving approximations of polygonal paths ⋮ Dynamic minimum bichromatic separating circle ⋮ Unnamed Item ⋮ Global Curve Simplification ⋮ On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance
Cites Work
- An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons
- Fractional cascading. I: A data structuring technique
- Efficiently approximating polygonal paths in three and higher dimensions
- Dynamic half-space range reporting and its applications
- Efficient algorithms for approximating polygonal chains
- Lower bounds for off-line range searching
- APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
- Fitting polygonal functions to a set of points in the plane
- SPACE-EFFICIENT ALGORITHMS FOR APPROXIMATING POLYGONAL CURVES IN TWO-DIMENSIONAL SPACE
- APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
- Cartographic line simplication and polygon CSG formulae in O(n log* n) time
- Simplifying a polygonal subdivision while keeping it simple
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Polygonal path simplification with angle constraints
