Results 51 to 60 of about 7,016 (227)
Fast reconstruction of Delaunay triangulations [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
This article investigates how persistent homology, persistent Laplacians, and persistent commutative algebra reveal complementary geometric, topological, and algebraic invariants or signatures of real‐world data. By analyzing shapes, synthetic complexes, fullerenes, and biomolecules, the article shows how these mathematical frameworks enhance ...
Yiming Ren, Guo‐Wei Wei
wiley +1 more source
Filtering Relocations on a Delaunay Triangulation [PDF]
International audienceUpdating a Delaunay triangulation when its vertices move is a bottleneck in several domains of application. Rebuilding the whole triangulation from scratch is surprisingly a very viable option compared to relocating the vertices ...
Pierre Alliez +7 more
core +2 more sources
Flipping geometric triangulations on hyperbolic surfaces
We consider geometric triangulations of surfaces, i.e., triangulations whose edges can be realized by disjoint geodesic segments. We prove that the flip graph of geometric triangulations with fixed vertices of a flat torus or a closed hyperbolic surface
Vincent Despre +2 more
doaj +1 more source
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
Distributed Kinetic Delaunay triangulation [PDF]
This paper proposes a distributed algorithm to maintain the Delaunay triangulation of moving points. We assume that every point is a processor which can only communicate with the adjacent points connected by edges in the Delaunay triangulation.
유태원 +3 more
core
Sketch of a Delaunay Triangulation.
The Delaunay triangulation and its dual, the Voronoi tessellation for a random set of points. The blue lines are the segments of the Voronoi tessellation, the red ones are the edges of the Delaunay graph (triangulation).
Matthias Krufczik (749498) +8 more
core +1 more source
Aerial Surveillance Leveraging Delaunay Triangulation and Multiple-UAV Imaging Systems
In aerial surveillance systems, achieving optimal object detection precision is of paramount importance for effective monitoring and reconnaissance. This article presents a novel approach to enhance object detection accuracy through the integration of ...
Ahad Alotaibi, Chris Chatwin, Phil Birch
doaj +1 more source
ABSTRACT Medieval and early modern drowned villages in the intertidal zone of the Scheldt estuary (the Netherlands) constitute intriguing yet largely understudied components of north‐western Europe's underwater cultural heritage. Despite their high archaeological potential as time capsules of past settlement landscapes, research has remained limited ...
Jan Trachet +9 more
wiley +1 more source
Accurate surface normal representation to facilitate gradient coil optimization on curved surface
The design methods for gradient coils are mostly based on discrete extrinsic methods (e.g., the Biot–Savart integration calculation), for which the surface normal vector strongly influences any numerical calculation of the discretized surface.
Hao Ren +4 more
doaj +1 more source

