Abstract

An advancing front space‐filling technique for arbitrary objects has been developed. The input required consists of the specification of the desired mean point distance in space and an initial triangulation of the surface. One object at a time is removed from the active front, and, if possible, surrounded by admissible new objects. This operation is repeated until no active objects are left. Two techniques to obtain maximum packing are discussed: closest object placement (during generation) and move/enlarge (after generation). Different deposition or layering patterns can be achieved by selecting the order in which objects are eliminated from the active front. Timings show that for simple objects like spheres the scheme is considerably faster than volume mesh generators based on the advancing front technique, making it possible to generate large (> 106) yet optimal clouds of points in a matter of minutes on a PC. For more general objects, the performance may degrade depending on the complexity of the penetration checks. Several examples are included that demonstrate the capabilities of the technique. 

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. Copyright © 2009 John Wiley & Sons, Ltd.

Abstract

An algorithm to construct boundary‐conforming, isotropic clouds of points with variable density in space is described. The input required consists of a specified mean point distance and an initial triangulation of the surface. Borrowing a key concept from advancing front grid generators, one point at a time is removed and, if possible, surrounded by admissible new points. This operation is repeated until no active points are left. Timings show that the scheme is about an order of magnitude faster than volume grid generators based on the advancing front technique, making it possible to generate large (>106) yet optimal clouds of points in a matter of minutes on a workstation. Several examples are included that demonstrate the capabilities of the technique. 

Abstract