Determining the convex hull in large multidimensional databases

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2114, Issue , 2001, Pages 294-306

  Böhm, Christian ^a   Kriegel, Hans Peter ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA MINING; DATA WAREHOUSES; DECISION TREES; GEOMETRY; IMAGE PROCESSING; PATTERN RECOGNITION; WAREHOUSES;

ACTIVE NODE; BASIC OPERATION; CONVEX HULL ALGORITHM; DEPTH FIRST; MAIN MEMORY; MAXIMUM DISTANCE; MULTI-DIMENSIONAL INDEX STRUCTURES; MULTIDIMENSIONAL DATABASE;

COMPUTATIONAL GEOMETRY;

EID: 84958773675     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44801-2_29     Document Type: Conference Paper

References (31)

1. Agrawal R., Faloutsos C., Swami A.: Efficient similarity search in sequence databases, Int. Conf. on Found. of Data Organization and Algorithms, 1993.
2. Agrawal R., Imielinski T., Swami A.: Mining Association Rules between Sets of Items in Large Databases, ACM SIGMOD Int. Conf. on Management of Data, 1993.
3. Ankerst M., Kriegel H.-P., Seidl T.: A Multi-Step Approach for Shape Similarity Search in Image Databases, IEEE Transactions on Knowledge and Data Engineering (TKDE), Vol. 10, No. 6, 1998.
4. Akl S. G., Toussaint G. T.: Efficient Convex Hull Algorithms for Pattern Recognition Applications, Int. Joint Conf. on Pattern Recognition, 1978.
5. Börzsönyi S., Kossmann D., Stocker K.: The Skyline Operator, Int. Conf on Data Engineering, 2000.
6. Berchtold S., Böhm C., Kriegel H.-P.: Improving the Query Performance of High- Dimensional Index Structures Using Bulk-Load Operations, Int. Conf. on Extending Database Technology, 1998.
7. Brown K. Q.: Geometric Transformations for Fast Geometric Algorithms, Ph.D. thesis, Dept. of Computer Science, Carnegie Mellon Univ., Dec. 1979a.
8. Bykat A.: Convex Hull of a Finite Set of Points in Two Dimensions, Info. Proc. Lett., No. 7, 1978.
9. Chang Y.-C, Bergman L. D., Castelli V., Li C.-S., Lo M.-L., Smith J. R.: The Onion Technique: Indexing for Linear Optimization Queries, ACM SIGMOD Int. Conf. on Management of Data, 2000.
10. Eddy W.: A New Convex Hull Algorithm for Planar Sets, ACM Trans. Math. Software 3 (4), 1977.
11. Ester M., Frommelt A., Kriegel H.-P., Sander J.: Algorithms for Characterization and Trend Detection in Spatial Databases, Int. Conf. on Knowledge Discovery and Data Mining (KDD), 1998.
12. Faloutsos C., Barber R., Flickner M., Hafner J., Niblack W., Petkovic D., Equitz W.: Efficient and Effective Querying by Image Content, Journal of Intelligent Information Systems, Vol. 3, 1994.
13. Freeman H., Shapira R.: Determining the Minimum-Area Encasing Rectangle for an Arbitrary Closed Curve, Comm. ACM, Vol 18, No. 7, 1975.
14. Gaede V., Günther O.: Multidimensional Access Methods, ACM Computing Surveys, 30 (2), 1998.
15. Gastwirth J.: On Robust Procedures, Journal Amer. Stat. Ass., Vol 65, 1966.
16. Graham R. L.: An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set, Info. Proc. Lett., Vol. 1, 1972.
17. Green P. J., Silverman B. W.: Constructing the Convex Hull of a Set of Points in the Plane, Computer Journal, Vol. 22, 1979.
18. Guttman A.: R-trees: A Dynamic Index Structure for Spatial Searching, Proc. ACM SIGMOD Int. Conf. on Management of Data, 1984.
19. Huber P. J.: Robust Statistics: A Review, Ann. Math. Stat., Vol. 43, No. 3, 1972.
20. Jagadish H. V.: A Retrieval Technique for Similar Shapes, ACM SIGMOD Int. Conf. Manag. Data, 1991.
21. Jarvis R. A.: On the Identification of the Convex Hull of a Finite Set of Points, Info. Proc. Lett., Vol. 2, 1973.
22. Knorr E. M., Ng R. T.: Algorithms for Mining Distance-Based Outliers in Large Datasets, Int. Conf. on Very Large Data Bases (VLDB), 1998.
23. Kriegel H.-P., Seidl T.: Approximation-Based Similarity Search for 3-D Surface Segments, GeoInformatica Int. Journal, Vol. 2, No. 2, 1998.
24. Korn F., Sidiropoulos N., Faloutsos C., Siegel E., Protopapas Z.: Fast Nearest Neighbor Search in Medical Image Databases, Int. Conf. on Very Large Data Bases (VLDB), 1996.
25. Mitchell T. M.: Machine Learning, McCraw-Hill, 1997.
26. Preparata F. P.: An Optimal Real Time Algorithm for Planar Convex Hulls, Comm. ACM 22, 1979.
27. Preparata F. P., Shamos M. I.: Computational Geometry, Springer New York, 1985.
28. Rosenfeld A.: Picture Processing by Computers, Academic Press, New York, 1969.
29. Sander J., Ester M., Kriegel H.-P., Xu X.: Density-Based Clustering in Spatial Databases: The Algorithm GDBSCAN and its Applications, Data Mining and Knowledge Discovery, Vol. 2, No. 2, 1998.
30. Shamos M. I.: Computational Geometry, Ph.D. Thesis, Dept. of CS, Yale University, 1978.
31. Seidl T., Kriegel H.-P.: Efficient User-Adaptable Similarity Search in Large Multimedia Databases, Int. Conf. on Very Large Data Bases (VLDB), 1997.