2D Black Packing within GOCAD: Extension to 3D

@inproceedings{CognotRM1997b,
 abstract = { This paper summarises the recent resu/ts of continuing close collaboration between the GQCAD group in Nancy and the Princeton 3D structure group. In August this year we undertook a pilot project to assess the ease with which some scientific software could be implemented with GQCAD using a parallel tree approach. We chose to implement 2D block packing of either maps or cross-sections as this is a robust, proven algorithm. The collaboration between Nancy and Princeton has resulted in a full implementation of the block packing restoration algorithm within a GQCAD parallel tree. This has eliminated mu ch of the pre-processing phase that was previously required when undertaking a restoration. In addition, the code has been generalised by the use of a new algorithm for block neighbour searching and updating such that it now can restore maps involving significant strike slip displacement. The new algorithm makes use of triangulation between ail block nodes to pro vide the connectivity between ail blocks at any time step. Thus, a priori, we make no assumptions about possible final locations of blocks. As a resu/t the code has now been both generalised and made easier to use. The 2D block packing code has been designed in such a way that the transition to 3D block packing of polyhedra should be possible, although perhaps limited by computing power. },
 author = { Cognot, Richard AND Hardy, Stuart },
 booktitle = { 16th gOcad Meeting },
 month = { "november" },
 publisher = { ASGA },
 title = { 2D Black Packing within GOCAD: Extension to 3D },
 year = { 1997 }
}