Simplifying a polygonal subdivision while keeping it simple
From MaRDI portal
Recommendations
- Area-preserving subdivision simplification with topology constraints: exactly and in practice
- Simplifying massive planar subdivisions
- Map simplification with topology constraints: exactly and in practice
- APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
- Optimal simplification of polygonal chains for subpixel-accurate rendering
Cited in
(14)- Computing homotopic line simplification
- Polygonal path simplification with angle constraints
- Geodesic-preserving polygon simplification
- APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
- Polyline simplification has cubic complexity
- On optimal polyline simplification using the Hausdorff and Fréchet distance
- Simplifying massive planar subdivisions
- Map simplification with topology constraints: exactly and in practice
- Area-preserving subdivision simplification with topology constraints: exactly and in practice
- Geodesic-preserving polygon simplification
- Shortcut hulls: vertex-restricted outer simplifications of polygons
- Minimum-complexity graph simplification under the Fréchet-like distance
- Polygonal chain approximation: A query based approach
- Area-preserving approximations of polygonal paths
This page was built for publication: Simplifying a polygonal subdivision while keeping it simple
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361557)