Evaluation of range searching methods for contact searching in mechanical engineering

International Journal of Computational Geometry and Applications

Volumn 8, Issue 1, 1998, Pages 67-83

  Fjällström, Per Olof ^a   Petersson, Jan ^a   Nilsson, Larsgunnar ^a   Zhong, Zhi Hua ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

Experimental evaluation; Geometric contact searching; Orthogonal range searching

Indexed keywords

EID: 2842594665     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195998000059     Document Type: Article

References (6)

1. J.L. Bentley and J.H. Friedman, "Data structures for range searching", Computing Surveys, 11 (1979) 397-409.
2. J.L. Bentley, D.F. Stanat, and E.H. Williams, Jr, "The complexity of finding fixed-radius near neighbors", Information Processing Letters, 6 (1977) 209-212.
3. J.L. Bentley, B.W. Weide, and A.C. Yao, "Optimal expected-time algorithms for closest-point problems", ACM Transactions on Mathematical Software, 6 (1980) 563-580.
4. J.H. Friedman, J.L. Bentley, and R.A. Finkel, "An algorithm for finding best matches in logarithmic expected time", ACM Transactions on Mathematical Software, 3 (1977) 209-226.
5. Y.V. Silva-Filho, "Average case analysis of region search in balanced k-d trees", Information Processing Letters, 8 (1979) 219-223.
6. Z.-H. Zhong, Finite Element Procedures for Contact-Impact Problems, (Oxford University Press, 1993).