Pages that link to "Item:Q1276944"
From MaRDI portal
The following pages link to Cartographic line simplification and polygon CSG formulae in \(O(n\log^* n)\) time (Q1276944):
Displaying 9 items.
- Compressing spatio-temporal trajectories (Q833705) (← links)
- Distance-preserving approximations of polygonal paths (Q868106) (← links)
- Optimal simplification of polygonal chains for subpixel-accurate rendering (Q950399) (← links)
- Data reduction of large vector graphics (Q1765582) (← links)
- Three problems about simple polygons (Q2432735) (← links)
- ROBUST NONPARAMETRIC SIMPLIFICATION OF POLYGONAL CHAINS (Q2932518) (← links)
- Place the Vertices Anywhere on the Curve and Simplify (Q5164876) (← links)
- Compressing Spatio-temporal Trajectories (Q5387810) (← links)
- Streaming algorithms for line simplification (Q5919922) (← links)
