By Topic

Searching Simplexes in Quasi-triangulation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Deok-Soo Kim ; Dept. of Ind. Eng., Hanyang Univ., Seoul, South Korea ; Jae-Kwan Kim ; Chong-Min Kim

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 kd-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.

Published in:

Voronoi Diagrams in Science and Engineering (ISVD), 2010 International Symposium on

Date of Conference:

28-30 June 2010