The following pages link to (Q3805737):
Displaying 21 items.
- Fitting a two-joint orthogonal chain to a point set (Q617541) (← links)
- Polygonal chain approximation: A query based approach (Q706723) (← links)
- Speeding up simplification of polygonal curves using nested approximations (Q710621) (← links)
- Area-preserving approximations of polygonal paths (Q866543) (← links)
- Polygonal approximation of closed discrete curves (Q866695) (← links)
- Distance-preserving approximations of polygonal paths (Q868106) (← links)
- Unsupervised segmentation and approximation of digital curves with rate-distortion curve modeling (Q898320) (← links)
- The equipartition of curves (Q924088) (← links)
- Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs (Q934021) (← links)
- Efficient algorithms for 3-D polygonal approximation based on LISE criterion (Q1860236) (← links)
- Efficient piecewise-linear function approximation using the uniform metric (Q1906048) (← links)
- Embedding ray intersection graphs and global curve simplification (Q2151460) (← links)
- Computing homotopic line simplification (Q2249045) (← links)
- Progressive simplification of polygonal curves (Q2306367) (← links)
- Efficient observer-dependent simplification in polygonal domains (Q2428687) (← 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)
- (Q5088945) (← links)
- On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance (Q5115824) (← links)
- (Q6179335) (← links)
