Pages that link to "Item:Q1601006"

The following pages link to Efficiently approximating polygonal paths in three and higher dimensions (Q1601006):

Displaying 23 items.

• Minimum-sum dipolar spanning tree in \(\mathbb R^3\) (Q452446) (← links)
• Representing a functional curve by curves with fewer peaks (Q635753) (← links)
• Finding long and similar parts of trajectories (Q654283) (← links)
• Polygonal chain approximation: A query based approach (Q706723) (← links)
• Area-preserving approximations of polygonal paths (Q866543) (← links)
• Distance-preserving approximations of polygonal paths (Q868106) (← links)
• The equipartition of curves (Q924088) (← links)
• Data reduction of large vector graphics (Q1765582) (← links)
• Efficient algorithms for 3-D polygonal approximation based on LISE criterion (Q1860236) (← links)
• New results on path approximation (Q1889587) (← links)
• Embedding ray intersection graphs and global curve simplification (Q2151460) (← links)
• Approximating points by a piecewise linear function (Q2375945) (← links)
• Polygonal path simplification with angle constraints (Q2571211) (← links)
• Extremal point queries with lines and line segments and related problems (Q2571215) (← links)
• Hausdorff approximation of convex polygons (Q2573338) (← links)
• Polygonal path approximation with angle constraints (Q2768318) (← links)
• Efficient Computation of the Outer Hull of a Discrete Path (Q3190071) (← links)
• Constructing Approximate Shortest Path Maps in Three Dimensions (Q4268702) (← links)
• Global Curve Simplification (Q5075813) (← links)
• (Q5088945) (← links)
• On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance (Q5115824) (← links)
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science (Q5191519) (← links)
• Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance (Q5458565) (← links)