1,243 research outputs found
One machine, one minute, three billion tetrahedra
This paper presents a new scalable parallelization scheme to generate the 3D
Delaunay triangulation of a given set of points. Our first contribution is an
efficient serial implementation of the incremental Delaunay insertion
algorithm. A simple dedicated data structure, an efficient sorting of the
points and the optimization of the insertion algorithm have permitted to
accelerate reference implementations by a factor three. Our second contribution
is a multi-threaded version of the Delaunay kernel that is able to concurrently
insert vertices. Moore curve coordinates are used to partition the point set,
avoiding heavy synchronization overheads. Conflicts are managed by modifying
the partitions with a simple rescaling of the space-filling curve. The
performances of our implementation have been measured on three different
processors, an Intel core-i7, an Intel Xeon Phi and an AMD EPYC, on which we
have been able to compute 3 billion tetrahedra in 53 seconds. This corresponds
to a generation rate of over 55 million tetrahedra per second. We finally show
how this very efficient parallel Delaunay triangulation can be integrated in a
Delaunay refinement mesh generator which takes as input the triangulated
surface boundary of the volume to mesh
Anisotropic Mesh Adaptation for Image Representation
Triangular meshes have gained much interest in image representation and have
been widely used in image processing. This paper introduces a framework of
anisotropic mesh adaptation (AMA) methods to image representation and proposes
a GPRAMA method that is based on AMA and greedy-point removal (GPR) scheme.
Different than many other methods that triangulate sample points to form the
mesh, the AMA methods start directly with a triangular mesh and then adapt the
mesh based on a user-defined metric tensor to represent the image. The AMA
methods have clear mathematical framework and provides flexibility for both
image representation and image reconstruction. A mesh patching technique is
developed for the implementation of the GPRAMA method, which leads to an
improved version of the popular GPRFS-ED method. The GPRAMA method can achieve
better quality than the GPRFS-ED method but with lower computational cost.Comment: 25 pages, 15 figure
JIGSAW-GEO (1.0): locally orthogonal staggered unstructured grid generation for general circulation modelling on the sphere
An algorithm for the generation of non-uniform, locally-orthogonal staggered
unstructured spheroidal grids is described. This technique is designed to
generate very high-quality staggered Voronoi/Delaunay meshes appropriate for
general circulation modelling on the sphere, including applications to
atmospheric simulation, ocean-modelling and numerical weather prediction. Using
a recently developed Frontal-Delaunay refinement technique, a method for the
construction of high-quality unstructured spheroidal Delaunay triangulations is
introduced. A locally-orthogonal polygonal grid, derived from the associated
Voronoi diagram, is computed as the staggered dual. It is shown that use of the
Frontal-Delaunay refinement technique allows for the generation of very
high-quality unstructured triangulations, satisfying a-priori bounds on element
size and shape. Grid-quality is further improved through the application of
hill-climbing type optimisation techniques. Overall, the algorithm is shown to
produce grids with very high element quality and smooth grading
characteristics, while imposing relatively low computational expense. A
selection of uniform and non-uniform spheroidal grids appropriate for
high-resolution, multi-scale general circulation modelling are presented. These
grids are shown to satisfy the geometric constraints associated with
contemporary unstructured C-grid type finite-volume models, including the Model
for Prediction Across Scales (MPAS-O). The use of user-defined mesh-spacing
functions to generate smoothly graded, non-uniform grids for multi-resolution
type studies is discussed in detail.Comment: Final revisions, as per: Engwirda, D.: JIGSAW-GEO (1.0): locally
orthogonal staggered unstructured grid generation for general circulation
modelling on the sphere, Geosci. Model Dev., 10, 2117-2140,
https://doi.org/10.5194/gmd-10-2117-2017, 201
Improved Incremental Randomized Delaunay Triangulation
We propose a new data structure to compute the Delaunay triangulation of a
set of points in the plane. It combines good worst case complexity, fast
behavior on real data, and small memory occupation.
The location structure is organized into several levels. The lowest level
just consists of the triangulation, then each level contains the triangulation
of a small sample of the levels below. Point location is done by marching in a
triangulation to determine the nearest neighbor of the query at that level,
then the march restarts from that neighbor at the level below. Using a small
sample (3%) allows a small memory occupation; the march and the use of the
nearest neighbor to change levels quickly locate the query.Comment: 19 pages, 7 figures Proc. 14th Annu. ACM Sympos. Comput. Geom.,
106--115, 199
Efficient Reconstruction From Scattered Points
Most algorithms that reconstruct surface from sample points rely on computationally demanding operations to derive the reconstruction,
beside this, most of the classical algorithm use a kind of three-dimensional structure to derive a two-dimensional
one. In this paper we introduce an innovative approach for generating two-dimensional piecewise linear approximations from
sample points in R3 that simplify significantly the numerical calculation and the memory usage in the reconstruction process.
The approach proposed here is an advancing front approach that uses rigid movements in the three-dimensional space and a
bidimensional Delaunay triangulation as the main tools for the algorithm. The principal idea is to use a combination of rotations
and translations in order to simplify the calculations and avoid the three-dimensional structure used by the most of the
algorithms. Avoiding those structures, this approach can reduce the computational cost and numerical instabilities typically
associated with the classical algorithm reconstructions
Construction of boundary element models in bioelectromagnetism
Multisensor electro- and magnetoencephalographic (EEG and MEG) as well as electro- and magnetocardiographic (ECG and MCG) recordings have been proved useful in noninvasively extracting information on bioelectric excitation. The anatomy of the patient needs to be taken into account, when excitation sites are localized by solving the inverse problem. In this work, a methodology has been developed to construct patient specific boundary element models for bioelectromagnetic inverse problems from magnetic resonance (MR) data volumes as well as from two orthogonal X-ray projections. The process consists of three main steps: reconstruction of 3-D geometry, triangulation of reconstructed geometry, and registration of the model with a bioelectromagnetic measurement system. The 3-D geometry is reconstructed from MR data by matching a 3-D deformable boundary element template to images. The deformation is accomplished as an energy minimization process consisting of image and model based terms. The robustness of the matching is improved by multi-resolution and global-to-local approaches as well as using oriented distance maps. A boundary element template is also used when 3-D geometry is reconstructed from X-ray projections. The deformation is first accomplished in 2-D for the contours of simulated, built from the template, and real X-ray projections. The produced 2-D vector field is back-projected and interpolated on the 3-D template surface. A marching cube triangulation is computed for the reconstructed 3-D geometry. Thereafter, a non-iterative mesh-simplification method is applied. The method is based on the Voronoi-Delaunay duality on a 3-D surface with discrete distance measures. Finally, the triangulated surfaces are registered with a bioelectromagnetic measurement utilizing markers. More than fifty boundary element models have been successfully constructed from MR images using the methods developed in this work. A simulation demonstrated the feasibility of X-ray reconstruction; some practical problems of X-ray imaging need to be solved to begin tests with real data.reviewe
- …