Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
Searching simplexes in quasi-triangulation
- Authors
- Kim, Deok-Soo; Kim, Jae-Kwan; Kim, Chong-Min
- Issue Date
- Jul-2010
- Publisher
- IEEE
- Keywords
- Beta-complex; Beta-shape; Orthogonal range search; Particle proximity; Quasi-triangulation; Simplex search; Voronoi diagram of spheres
- Citation
- ISVD 2010 - 7th International Symposium on Voronoi Diagrams in Science and Engineering, pp.105 - 111
- Indexed
- SCOPUS
- Journal Title
- ISVD 2010 - 7th International Symposium on Voronoi Diagrams in Science and Engineering
- Start Page
- 105
- End Page
- 111
- ISSN
- 0000-0000
- Abstract
- Given a quasi-triangulation of a molecule, searching the simplexes of a particular bounding state for the spherical probe of a given radius occurs frequently. While such simplexes can be found by linearly scanning all simplexes in the quasi-triangulation, it is desirable to do the search faster. This paper presents an algorithm for searching simplexes quickly using the fed-tree data structure. The approach is based on the transformation of the simplex search problem in the R3 space to the orthogonal range search problem of points in another R3 space.
- Files in This Item
- Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 기계공학부 > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Related Researcher
- Kim, Deok Soo
- COLLEGE OF ENGINEERING (SCHOOL OF MECHANICAL ENGINEERING)