Gross motion planning—a survey
ACM Computing Surveys (CSUR)
Motion planning in the presence of moving obstacles
Journal of the ACM (JACM)
Updating the topology of the dynamic Voronoi diagram for spheres in Euclidean d-dimensional space
Computer Aided Geometric Design
Computation of more channels in protein molecules
EG VCBM'08 Proceedings of the First Eurographics conference on Visual Computing for Biomedicine
| Hi-index | 0.00 |
Recent approaches to tunnel computation in protein molecules based on computational geometry are able to satisfactorily compute the narrowest possible width of any tunnel leading from a specified position inside the protein molecule to its surface. However, chemists are not only interested in the minimal width of a tunnel, they would also like to consider other criteria such as the length of the tunnel or its volume. In this paper we present an extension of the recent approach to tunnel computation which could take these other criteria into account. Using Delaunay triangulation we compute the set of all the tunnels which have the widest possible narrowest part, and select the best representative of this set in view of its additional criteria. Even though the extension is straightforward, it has many useful practical impacts. The major contribution of this approach is that it allows us to evaluate dynamic properties of protein molecules by tracing a computed tunnel in the sequence of several molecule snapshots in time. This new approach was implemented and piloted on real biochemical data.