Improved Points Approximation Algorithms Based on Simplicial Thickness Data Structures
From MaRDI portal
Publication:3000523
DOI10.1007/978-3-642-19222-7_36zbMath1326.68305MaRDI QIDQ3000523
Publication date: 19 May 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19222-7_36
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68P05: Data structures
68W25: Approximation algorithms
Cites Work
- Unnamed Item
- Range searching with efficient hierarchical cuttings
- The design of dynamic data structures
- Efficient partition trees
- Quasi-optimal upper bounds for simplex range searching and new zone theorems
- Cutting hyperplanes for divide-and-conquer
- Decomposable searching problems
- Quasi-optimal range searching in spaces of finite VC-dimension
- Lower Bounds on the Complexity of Polytope Range Searching
- Approximating Points by a Piecewise Linear Function: I
- Approximating Points by a Piecewise Linear Function: II. Dealing with Outliers
- An on-line algorithm for fitting straight lines between data ranges
- Polygon Retrieval