Approximating Points by a Piecewise Linear Function: II. Dealing with Outliers

Authors:
Danny Z. Chen;Haitao Wang
Affiliations:
Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, USA 46556;Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, USA 46556
Venue:
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Year:
2009

Citing 14
Cited 4

Making data structures persistent

Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Optimal algorithms for tree partitioning

SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
On geometric optimization with few violated constraints

SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Introduction to Algorithms

Introduction to Algorithms
Optimal Histograms with Quality Guarantees

VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Low-Dimensional Linear Programming with Violations

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Scaling and related techniques for geometry problems

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
A Note on Linear Time Algorithms for Maximum Error Histograms

IEEE Transactions on Knowledge and Data Engineering
Exploiting duality in summarization with deterministic guarantees

Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
REHIST: relative error histogram construction algorithms

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Notes on searching in multidimensional monotone arrays

SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Fitting a Step Function to a Point Set

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
On the space---time of optimal, approximate and streaming algorithms for synopsis construction problems

The VLDB Journal — The International Journal on Very Large Data Bases
Approximating Points by a Piecewise Linear Function: I

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation

Approximating Points by a Piecewise Linear Function: I

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Fitting a two-joint orthogonal chain to a point set

Computational Geometry: Theory and Applications
Improved points approximation algorithms based on simplicial thickness data structures

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Outlier respecting points approximation

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study the violation versions of the planar points approximation problems, which deal with outliers in the input points. We present efficient algorithms for both the step function and the more general piecewise linear function cases, and for both non-weighted and weighted points. Most of our results are first-known. Our algorithms are based on interesting and nontrivial geometric techniques and data structures, which may find other applications.