| Abstract: | Described herein are technologies pertaining to generating a Voronoi mesh
for an enclosed domain of arbitrarily many dimensions. An implicit
Voronoi mesh is received that comprises locations of seeds in the domain.
Neighbors of a seed are identified by extending a segment from the seed
to the boundary of the domain and performing successive hyperplane
trimming of the segment to identify a point on the facet of the Voronoi
cell of the seed. A vertex of the cell can be identified by successively
extending and trimming one or more additional spokes to identify points
on a facet of the cell that are constrained to lie in a (d-n) space,
where d is a number of dimensions of the domain and n is a number of
iterations. A numerical simulation is performed based on the Voronoi mesh
to generate simulation results in applications including surrogate
modeling, global optimization, calibration, dimension reduction. |