Search NASA⌕ Search

SEARCH · Search NASA

Results for “Delaunay triangulation”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

3 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

T RI M E ++: Multi-threaded triangular meshing in two dimensions

We present T RI M E ++, a multi-threaded software library designed for generating two-dimensional meshes for intricate geometric shapes using the Delaunay triangulation. Multi-threaded parallel computing is implemented throughout the meshing procedure, making it suitable for fast generation of large-scale meshes. Three iterative meshing algorithms are implemented: the DistMesh algorithm, the centroidal Voronoi diagram meshing, and a hybrid of the two. We compare the performance of the three meshing methods in T RI M E ++, and show that the hybrid method retains the advantages of the other two. The software library achieves significant parallel speedup when generating large-scale meshes containing between 10 4 to 10 7 points. T RI M E ++ can handle complicated geometries and generates adaptive meshes of high quality.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Dark matter substructure or source model systematics? A case study of cluster lens Abell S1063

Mapping the small-scale structure of the universe through gravitational lensing is a promising tool for probing the particle nature of dark matter. Curved Arc Basis (CAB) has been proposed as a local lensing formalism in galaxy clusters, with the potential to detect low-mass dark matter substructure. In this work, we analyse the cluster lens Abell S1063 in search of dark matter substructure with the CAB formalism, using multiband imaging data from James Webb Space Telescope ( JWST ). We use two different source modelling methods: shapelets and pixel-based source reconstruction based on Delaunay triangulation. We find that source modelling systematics from shapelets result in a disagreement between CAB parameters measured from different filters. Source modelling with Delaunay significantly alleviates this systematic, as seen in the improvement in agreement across filters. We also find that inadequate complexity in source modelling can result in convincing spurious detections of dark matter substructure from strong gravitational lenses, as seen by our $\Delta \text{BIC} > 20$ measurement of a $M \sim 10^{10}$ ${\rm M}_{\odot }$ subhalo with shapelets, a spurious detection that is not reproduced with Delaunay source modelling. We demonstrate that multiband analysis with different JWST filters is key for disentangling source and lens model systematics from dark matter substructure detections.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Algorithm 1049: The Delaunay Density Diagnostic

Accurate approximation of a real-valued function depends on two aspects of the available data: the density of inputs within the domain of interest and the variation of the outputs over that domain. There are few methods for assessing whether the density of inputs is sufficient to identify the relevant variations in outputs—i.e., the “geometric scale” of the function—despite the fact that sampling density is closely tied to the success or failure of an approximation method. In this article, we introduce a general purpose, computational approach to detecting the geometric scale of real-valued functions over a fixed domain using a deterministic interpolation technique from computational geometry. The algorithm is intended to work on scalar data in moderate dimensions (2–10). Our algorithm is based on the observation that a sequence of piecewise linear interpolants will converge to a continuous function at a quadratic rate (in L 2 norm) if and only if the data are sampled densely enough to distinguish the feature from noise (assuming sufficiently regular sampling). We present numerical experiments demonstrating how our method can identify feature scale, estimate uncertainty in feature scale, and assess the sampling density for fixed (i.e., static) datasets of input–output pairs. Finally, we include analytical results in support of our numerical findings and have released lightweight code that can be adapted for use in a variety of data science settings.

97 MATHEMATICS AND COMPUTING↗