Pages that link to "Item:Q1971509"

The following pages link to Efficient algorithms for approximating polygonal chains (Q1971509):

Displaying 21 items.

• Polygonal chain approximation: A query based approach (Q706723) (← links)
• Near-linear time approximation algorithms for curve simplification (Q818650) (← links)
• 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)
• A fast algorithm for approximating the detour of a polygonal chain. (Q1428113) (← links)
• Efficient algorithms for 3-D polygonal approximation based on LISE criterion (Q1860236) (← links)
• On counting point-hyperplane incidences (Q1873152) (← links)
• Curve matching, time warping, and light fields: New algorithms for computing similarity between curves (Q2384118) (← links)
• Efficient observer-dependent simplification in polygonal domains (Q2428687) (← links)
• Farthest-point queries with geometric and combinatorial constraints (Q2489542) (← links)
• Polygonal path simplification with angle constraints (Q2571211) (← links)
• Counting and representing intersections among triangles in three dimensions (Q2571213) (← links)
• Extremal point queries with lines and line segments and related problems (Q2571215) (← links)
• Hausdorff approximation of convex polygons (Q2573338) (← links)
• (Q4862345) (← links)
• Representation Complexities of SemiAlgebraic Graphs (Q5237912) (← links)
• Efficient Construction of 2-Chains with a Prescribed Boundary (Q5347535) (← links)
• Compressing Spatio-temporal Trajectories (Q5387810) (← links)
• Streaming algorithms for line simplification (Q5919922) (← links)
• On reverse shortest paths in geometric proximity graphs (Q6092309) (← links)