The following pages link to (Q3716335):
Displaying 6 items.
- Fitting a two-joint orthogonal chain to a point set (Q617541) (← links)
- Polygonal chain approximation: A query based approach (Q706723) (← links)
- On determining the on-line minimax linear fit to a discrete point set in the plane (Q1098638) (← links)
- Applications of random sampling to on-line algorithms in computational geometry (Q1192610) (← links)
- Separability by two lines and by nearly straight polygonal chains (Q1885815) (← links)
- Memory-constrained algorithms for simple polygons (Q2391542) (← links)
