Well-Centered Triangulation [PDF]
Meshes composed of well-centered simplices have nice orthogonal dual meshes (the dual Voronoi diagram). This is useful for certain numerical algorithms that prefer such primal-dual mesh pairs.
Guoy, Damrong +3 more
core +3 more sources
Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear time [PDF]
In this paper, we present a Θ(n) time worst-case deterministic algorithm for finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple n-sided polygon in the plane.
Chin, F
core +1 more source
Essential Constraints of Edge-Constrained Proximity Graphs
Given a plane forest $F = (V, E)$ of $|V| = n$ points, we find the minimum set $S \subseteq E$ of edges such that the edge-constrained minimum spanning tree over the set $V$ of vertices and the set $S$ of constraints contains $F$. We present an $O(n \log
DT Lee +5 more
core +1 more source
Shape Similarity Assessment Method for Coastline Generalization
Although shape similarity is one fundamental element in coastline generalization quality, its related research is still inadequate. Consistent with the hierarchical pattern of shape recognition, the Dual-side Bend Forest Shape Representation Model is ...
Zhaoxing Li, Jingsheng Zhai, Fang Wu
doaj +1 more source
General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties [PDF]
The definition of Delaunay triangulation is too restrictive to comply with constraints such as discontinuity of boundary in objects rendering. In the two-dimensional case, several options are available. One can, for instance, augment the number of points and then construct the Delaunay triangulation of the enlarged vertex set, or relax the requirements
openaire +3 more sources
Fast Spherical Centroidal Voronoi Mesh Generation: A Lloyd-preconditioned LBFGS Method in Parallel
Centroidal Voronoi tessellation (CVT)-based mesh generation is a very effective technique for creating high-quality Voronoi meshes and their dual Delaunay triangulations that often play a crucial role in applications, including ocean and atmospheric ...
Gunzburger, Max +2 more
core +1 more source
Restricted Constrained Delaunay Triangulations
We introduce the restricted constrained Delaunay triangulation (restricted CDT), a generalization of both the restricted Delaunay triangulation and the constrained Delaunay triangulation. The restricted CDT is a triangulation of a surface whose edges include a set of user-specified constraining segments. We define the restricted CDT to be the dual of a
Khoury, Marc, Shewchuk, Jonathan Richard
openaire +2 more sources
Explaining the Origin of Negative Poisson's Ratio in Amorphous Networks With Machine Learning
This review summarizes how machine learning (ML) breaks the “vicious cycle” in designing auxetic amorphous networks. By transitioning from traditional “black‐box” optimization to an interpretable “AI‐Physics” closed‐loop paradigm, ML is shown to not only discover highly optimized structures—such as all‐convex polygon networks—but also unveil hidden ...
Shengyu Lu, Xiangying Shen
wiley +1 more source
A Framework for Discovering Evolving Domain Related Spatio-Temporal Patterns in Twitter
In massive Twitter datasets, tweets deriving from different domains, e.g., civil unrest, can be extracted to constitute spatio-temporal Twitter events for spatio-temporal distribution pattern detection.
Yan Shi +5 more
doaj +1 more source
A novel geometry image to accurately represent a surface by preserving mesh topology
Geometry images parameterise a mesh with a square domain and store the information in a single chart. A one-to-one correspondence between the 2D plane and the 3D model is convenient for processing 3D models.
Sheng Zeng +3 more
doaj +1 more source

