An efficient algorithm for three-dimensional Β-complex and Β-shape via a quasi-triangulation

Abstract

The concept of a Β-shape has been recently proposed by extending the concept of the well-known α-shape. Since the Β-shape takes full consideration of the Euclidean geometry of spherical particles, it is better suited than the (weighted) α-shape for applications using spatial queries on the system of variable sized spheres based on the Euclidean distance metric. In this paper, we present an efficient and elegant algorithm which computers a Β-shape from a quasi-triangulation in O(log m + k) time in the worst case, where the quasi-triangulation has m simplicies and the boundary of Β-shape consists of k simplicies. We believe that the Β-shape and Β-complex for a set of variable sized spheres (such as the atoms in a protein) will be very useful in the near future since the precise and efficient analysis of molecular structure can be conveniently facilitated by using these structures.