| Line 1: | Line 1: | ||
| + | Published in ''Communications in Numerical Methods in Engineering'' Vol. 14 (12), pp. 1097-1108, 1998<br /> | ||
| + | doi: 10.1002/(SICI)1099-0887(199812)14:12<1097::AID-CNM183>3.0.CO;2-7 | ||
== Abstract == | == 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 (<math>>10^6</math>) yet optimal clouds of points in a matter of minutes on a workstation. Several examples are included that demonstrate the capabilities of the technique. | 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 (<math>>10^6</math>) yet optimal clouds of points in a matter of minutes on a workstation. Several examples are included that demonstrate the capabilities of the technique. | ||
Revision as of 12:11, 17 January 2019
Published in Communications in Numerical Methods in Engineering Vol. 14 (12), pp. 1097-1108, 1998
doi: 10.1002/(SICI)1099-0887(199812)14:12<1097::AID-CNM183>3.0.CO;2-7
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 () yet optimal clouds of points in a matter of minutes on a workstation. Several examples are included that demonstrate the capabilities of the technique.
Document information
Published on 01/01/1998
DOI: 10.1002/(SICI)1099-0887(199812)14:12<1097::AID-CNM183>3.0.CO;2-7
Licence: CC BY-NC-SA license
Share this document
Keywords
claim authorship
Are you one of the authors of this document?