TY - JOUR
T1 - A connected set algorithm for the identification of spatially contiguous regions in crystallographic envelopes
AU - Hunt, John F.
AU - Vellieux, Frederic M D
AU - Deisenhofer, Johann
PY - 1997/1/1
Y1 - 1997/1/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0030755693&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0030755693&partnerID=8YFLogxK
U2 - 10.1107/S0907444997001431
DO - 10.1107/S0907444997001431
M3 - Article
C2 - 15299909
AN - SCOPUS:0030755693
SN - 0907-4449
VL - 53
SP - 434
EP - 437
JO - Acta Crystallographica Section D: Structural Biology
JF - Acta Crystallographica Section D: Structural Biology
IS - 4
ER -