Spatio-temporal data reduction with deterministic error bounds
Authors:
Open Access
- 19 September 2003
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 33-42
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Wavelet synopses with error guarantees2002
- Locating objects in mobile computingIEEE Transactions on Knowledge and Data Engineering, 2001
- The implementation and performance of compressed databasesACM SIGMOD Record, 2000
- Efficient Algorithms for Approximating Polygonal ChainsDiscrete & Computational Geometry, 2000
- Indexing moving points (extended abstract)2000
- On indexing mobile objects1999
- APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERRORInternational Journal of Computational Geometry & Applications, 1996
- Polygonal Approximations of a Curve — Formulations and Algorithms1988
- Automated Line GeneralizationCartographica, 1987
- ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURECartographica, 1973