The following pages link to (Q3768247):
Displayed 20 items.
- Decomposition and mean-field approach to mixed integer optimal compensation problems (Q289132) (← links)
- Convex piecewise-linear fitting (Q374609) (← links)
- Polygonal chain approximation: A query based approach (Q706723) (← links)
- Polygonal approximation of closed discrete curves (Q866695) (← links)
- Distance-preserving approximations of polygonal paths (Q868106) (← links)
- The convergence rate of the sandwich algorithm for approximating convex functions (Q1195962) (← links)
- The abstract domain of trapezoid step functions (Q1749121) (← links)
- How to determine the minimum number of fuzzy rules to achieve given accuracy: a computational geometric approach to SISO case (Q1770724) (← 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)
- Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production (Q2357214) (← 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)
- On the Hardness of Orthogonal-Order Preserving Graph Drawing (Q3611858) (← links)
- Global Curve Simplification (Q5075813) (← links)
- Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance (Q5458565) (← links)
- Streaming algorithms for line simplification (Q5919922) (← links)
- A unified framework for bivariate clustering and regression problems via mixed-integer linear programming (Q6103471) (← links)