Three-dimensional beta-shapes and beta-complexes via quasi-triangulation
- Authors
- Kim, Deok-Soo; Cho, Youngsong; Sugihara, Kokichi; Ryu, Joonghyun; Kim, Donguk
- Issue Date
- Oct-2010
- Publisher
- ELSEVIER SCI LTD
- Keywords
- Voronoi diagram of spheres; Beta-shape; Beta-complex; Quasi-triangulation; Complex; Protein structure; Particle proximity
- Citation
- COMPUTER-AIDED DESIGN, v.42, no.10, pp.911 - 929
- Indexed
- SCIE
SCOPUS
- Journal Title
- COMPUTER-AIDED DESIGN
- Volume
- 42
- Number
- 10
- Start Page
- 911
- End Page
- 929
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/173639
- DOI
- 10.1016/j.cad.2010.06.004
- ISSN
- 0010-4485
- Abstract
- The proximity and topology among particles are often the most important factor for understanding the spatial structure of particles. Reasoning the morphological structure of molecules and reconstructing a surface from a point set are examples where proximity among particles is important. Traditionally, the Voronoi diagram of points, the power diagram, the Delaunay triangulation, and the regular triangulation, etc. have been used for understanding proximity among particles. In this paper, we present the theory of the beta-shape and the beta-complex and the corresponding algorithms for reasoning proximity among a set of spherical particles, both using the quasi-triangulation which is the dual of the Voronoi diagram of spheres. Given the Voronoi diagram of spheres, we first transform the Voronoi diagram to the quasi-triangulation. Then, we compute some intervals called beta-intervals for the singular, regular, and interior states of each simplex in the quasi-triangulation. From the sorted set of simplexes, the beta-shape and the beta-complex corresponding to a particular value of beta can be found efficiently. Given the Voronoi diagram of spheres, the quasi-triangulation can be obtained in O(m) time in the worst case, where m represents the number of simplexes in the quasi-triangulation. Then, the beta-intervals for all simplexes in the quasi-triangulation can also be computed in O(m) time in the worst case. After sorting the simplexes using the low bound values of the beta-intervals of each simplex in O(m log m) time, the beta-shape and the beta-complex can be computed in O(log m+k) time in the worst case by a binary search followed by a sequential search in the neighborhood, where k represents the number of simplexes in the beta-shape or the beta-complex. The presented theory of the beta-shape and the beta-complex will be equally useful for diverse areas such as structural biology, computer graphics, geometric modelling, computational geometry, CAD, physics, and chemistry, where the core hurdle lies in determining the proximity among spherical particles.
- 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.