- Full text PDF available (17)
- This year (1)
- Last 5 years (4)
- Last 10 years (14)
Journals and Conferences
Quality surface meshes for molecular models are desirable in the studies of protein shapes and functionalities. However, there is still no robust software that is capable to generate such meshes with good quality. In this paper, we present a Delaunay-based surface triangulation algorithm generating quality surface meshes for the molecular skin model. We… (More)
This paper describes an algorithm for maintaining an approximating triangulation of a deforming surface in R<sup>3</sup>. The triangulation adapts dynamically to changing shape, curvature, and topology of the surface.
The construction of shape spaces is studied from a mathematical and a computational viewpoint. A program is outlined reducing the problem to four tasks: the representation of geometry, the canonical deformation of geometry, the measuring of distance in shape space, and the selection of base shapes. The technical part of this paper focuses on the second… (More)
Free-space dilation is an effective approach for narrow passage sampling, a well-recognized difficulty in probabilistic roadmap (PRM) planning. Key to this approach are methods for dilating the free space and for determining the amount of dilation needed. This paper presents a new method of dilation by shrinking the geometric models of robots and obstacles.… (More)
This paper presents a novel learning framework to provide computer game agents the ability to adapt to the player as well as other game agents. Our technique generally involves a personality adaptation module encapsulated in a reinforcement learning framework. Unlike previous work in which adaptation normally involves a decision process on every single… (More)
We present an approach to define and extract the cavities on the surfaces of macromolecules. Each cavity is represented by a triangular mesh enclosing a depression on a molecule such as a protein and a DNA. These surface patches would facilitate the study of ligand docking problem and similarity matching of proteins.
Edelsbrunner et al. defined a framework of shape deformations with shapes bounded by skin manifold. We prove that the infinitely many synthesized shapes in the deformation sequence share finitely many common Voronoi complexes. Therefore, we propose a new algorithm to compute the common Voronoi complexes efficiently for the deformations, and use these common… (More)
We give analytic inclusion-exclusion formulas for the area and perimeter derivatives of a union of finitely many disks in the plane.
We present an efficient algorithm to mesh the macromolecules surface model represented by the skin surface defined by Edelsbrunner. Our algorithm overcomes several challenges residing in current surface meshing methods. First, we guarantee the mesh quality with a provable lower bound of 21. on its minimum angle. Second, we ensure the triangulation is… (More)