A Connected Set Algorithm for the Identification of Spatially Contiguous Regions in Crystallographic Envelopes

A simple algorithm is described for the identification of spatially contiguous regions in crystallographic envelopes. In a single pass through the grid points of the envelope map, the occupied points are assigned to a series of locally contiguous sets based on consideration of the connections within...

Full description

Saved in:
Bibliographic Details
Published in:Acta crystallographica. Section D, Biological crystallography. Biological crystallography., 1997-07, Vol.53 (4), p.434-437
Main Authors: Hunt, J. F., Vellieux, F. M. D., Deisenhofer, J.
Format: Article
Language:English
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A simple algorithm is described for the identification of spatially contiguous regions in crystallographic envelopes. In a single pass through the grid points of the envelope map, the occupied points are assigned to a series of locally contiguous sets based on consideration of the connections within single voxels. A spatially contiguous region is identified as the union of all of the locally contiguous sets that share an element in common. Therefore, chains of spatial connectivity are traced implicitly by performing simple set operations. This algorithm has been implemented in the program CNCTDENV as part of the DEMON/ANGEL suite of density‐modification programs.
ISSN:1399-0047
0907-4449
1399-0047
DOI:10.1107/S0907444997001431