scientific article
From MaRDI portal
Publication:3768247
zbMath0631.65010MaRDI QIDQ3768247
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
pattern recognitiondata reductionpiecewise linear functionconvex hull problemcomputational-geometric algorithms
Related Items (20)
Decomposition and mean-field approach to mixed integer optimal compensation problems ⋮ Embedding ray intersection graphs and global curve simplification ⋮ Efficient piecewise-linear function approximation using the uniform metric ⋮ Polygonal approximation of closed discrete curves ⋮ Distance-preserving approximations of polygonal paths ⋮ Convex piecewise-linear fitting ⋮ A unified framework for bivariate clustering and regression problems via mixed-integer linear programming ⋮ Efficient observer-dependent simplification in polygonal domains ⋮ The abstract domain of trapezoid step functions ⋮ The convergence rate of the sandwich algorithm for approximating convex functions ⋮ Computing homotopic line simplification ⋮ Polygonal chain approximation: A query based approach ⋮ How to determine the minimum number of fuzzy rules to achieve given accuracy: a computational geometric approach to SISO case ⋮ On the Hardness of Orthogonal-Order Preserving Graph Drawing ⋮ Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance ⋮ Global Curve Simplification ⋮ Streaming algorithms for line simplification ⋮ Polygonal path simplification with angle constraints ⋮ Extremal point queries with lines and line segments and related problems ⋮ Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production
This page was built for publication:
