Constructing a conforming Voronoi mesh for an arbitrarily-shaped enclosed geometric domain
Patent
·
OSTI ID:1735265
A computing system is described herein, where the computing system includes a processor and memory storing instructions that, when executed by the processor, cause the processor to perform the following acts: 1) receiving a computer-implemented definition of an enclosed geometric domain, wherein the geometric domain is two-dimensional; 2) determining locations of seeds for the enclosed geometric domain; 3) decomposing the enclosed geometric domain into a conforming Voronoi mesh based on the locations of the seeds, wherein the conforming Voronoi mesh comprises Voronoi cells, and further wherein the conforming Voronoi mesh is bounded by the enclosed domain; and 4) performing a numerical simulation to generate simulation results, wherein the numerical simulation is based on at least one Voronoi cell in the Voronoi cells of the conforming Voronoi mesh.
- Research Organization:
- National Technology & Engineering Solutions of Sandia, LLC, Albuquerque, NM (United States)
- Sponsoring Organization:
- USDOE National Nuclear Security Administration (NNSA)
- DOE Contract Number:
- NA0003525
- Assignee:
- National Technology & Engineering Solutions of Sandia, LLC (Albuquerque, NM)
- Patent Number(s):
- 10,776,537
- Application Number:
- 15/634,734
- OSTI ID:
- 1735265
- Country of Publication:
- United States
- Language:
- English
Similar Records
Constructing a conforming voronoi mesh for an arbitrarily-shaped enclosed geometric domain
Generating an implicit voronoi mesh to decompose a domain of arbitrarily many dimensions
Sampling Conditions for Conforming Voronoi Meshing by the VoroCrust Algorithm
Patent
·
Tue Sep 15 00:00:00 EDT 2020
·
OSTI ID:1735266
Generating an implicit voronoi mesh to decompose a domain of arbitrarily many dimensions
Patent
·
Tue May 28 00:00:00 EDT 2019
·
OSTI ID:1568404
Sampling Conditions for Conforming Voronoi Meshing by the VoroCrust Algorithm
Journal Article
·
Thu May 31 20:00:00 EDT 2018
· LIPIcs-Leibniz International Proceedings in Informatics
·
OSTI ID:1502453