상세 보기
초록
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.
키워드
Beta-complex; Beta-shape; Orthogonal range search; Particle proximity; Quasi-triangulation; Simplex search; Voronoi diagram of spheres; Beta-complex; Beta-shape; Orthogonal range search; Particle proximity; Quasi-triangulation; Simplex search; Voronoi diagrams; Computational geometry; Data structures; Graphic methods; Probes; Spheres; Trees (mathematics); Triangulation
- 제목
- Searching simplexes in quasi-triangulation
- 저자
- Kim, Deok-Soo; Kim, Jae-Kwan; Kim, Chong-Min
- 발행일
- 2010-07
- 유형
- Conference Paper
- 저널명
- ISVD 2010 - 7th International Symposium on Voronoi Diagrams in Science and Engineering
- 페이지
- 105 ~ 111