m (Cinmemj moved page Draft Samper 425392581 to Samper et al 2018au) |
|||
Line 3: | Line 3: | ||
== Abstract == | == Abstract == | ||
− | An advancing front technique for filling space with arbitrary, separated objects has been developed. The input required consists of the specification of the desired object type, the mean object size, the distance between objects in space, as well as an initial triangulation of the surface. The objects are assumed to be described by a coarse mesh of tetrahedra. One face at a time is removed from the active front, and, if possible, surrounded by admissible new objects. This operation is repeated until no active faces are left. Two techniques to obtain maximum packing are discussed: closest object placement (during generation) and move/enlarge (after generation). Several examples are included that demonstrate the capabilities of the technique | + | An advancing front technique for filling space with arbitrary, separated objects has been developed. The input required consists of the specification of the desired object type, the mean object size, the distance between objects in space, as well as an initial triangulation of the surface. The objects are assumed to be described by a coarse mesh of tetrahedra. One face at a time is removed from the active front, and, if possible, surrounded by admissible new objects. This operation is repeated until no active faces are left. Two techniques to obtain maximum packing are discussed: closest object placement (during generation) and move/enlarge (after generation). Several examples are included that demonstrate the capabilities of the technique. |
<pdf>Media:Draft_Samper_425392581_3601_L-hner_et_al-2009-International_Journal_for_Numerical_Methods_in_Engineering.pdf</pdf> | <pdf>Media:Draft_Samper_425392581_3601_L-hner_et_al-2009-International_Journal_for_Numerical_Methods_in_Engineering.pdf</pdf> |
Published in Int. Journal for Numerical Methods in Engineering Vol. 78 (13), pp. 1618-1630, 2009
doi: 10.1002/nme.2548
An advancing front technique for filling space with arbitrary, separated objects has been developed. The input required consists of the specification of the desired object type, the mean object size, the distance between objects in space, as well as an initial triangulation of the surface. The objects are assumed to be described by a coarse mesh of tetrahedra. One face at a time is removed from the active front, and, if possible, surrounded by admissible new objects. This operation is repeated until no active faces are left. Two techniques to obtain maximum packing are discussed: closest object placement (during generation) and move/enlarge (after generation). Several examples are included that demonstrate the capabilities of the technique.
Published on 01/01/2009
DOI: 10.1002/nme.2548
Licence: CC BY-NC-SA license
Are you one of the authors of this document?