Results 41 to 50 of about 7,016 (227)
Delaunay-Triangulation-Based Learning With Hessian Total-Variation Regularization
IEEE Open Journal of Signal Processing, 2023 Regression is one of the core problems tackled in supervised learning. Neural networks with rectified linear units generate continuous and piecewise-linear (CPWL) mappings and are the state-of-the-art approach for solving regression problems.
Mehrsa Pourya +2 more
doaj +1 more source
Delaunay Triangulations in the Hilbert Metric
CoRR, 2023 The Hilbert metric is a distance function defined for points lying within the interior of a convex body. It arises in the analysis and processing of convex bodies, machine learning, and quantum information theory. In this paper, we show how to adapt the Euclidean Delaunay triangulation to the Hilbert geometry defined by a convex polygon in the plane ...
Auguste H. Gezalyan +5 more
openaire +4 more sources
IEEE AccessDelaunay triangulation is an effective way to build a triangulation of a cloud of points, i.e., a partitioning of the points into simplices (triangles in 2D, tetrahedra in 3D, and so on), such that no two simplices overlap and every point in the set is a
Yahia S. Elshakhs +4 more
doaj +1 more source
Properties of the Delaunay triangulation
Proceedings of the thirteenth annual symposium on Computational geometry - SCG '97, 1997 We defined several functionals on the set of all triangulations of the finite system of points in d-space achieving global minimum on the Delaunay triangulation (DT). We consider a so called "parabolic" functional and prove it attains its minimum on DT in all dimensions.
openaire +2 more sources
Plane Delaunay triangulation [PDF]
, 2016 Delaunay triangulation is one of the fundamental data structures in computational geometry. In the thesis we present the planar Delaunay triangulation and describe its construction.
Števančec, Tadej
core +2 more sources
Delaunay Triangulations with Predictions
CoRRWe investigate algorithms with predictions in computational geometry, specifically focusing on the basic problem of computing 2D Delaunay triangulations. Given a set ▫$P$▫ of ▫$n$▫ points in the plane and a triangulation ▫$G$▫ that serves as a "prediction" of the Delaunay triangulation, we would like to use ▫$G$▫ to compute the correct Delaunay ...
Cabello, S. +2 more
openaire +5 more sources
Advanced Science, EarlyView.A metal‐directed carbonization strategy transforms hierarchical organic microspheres into spiky carbon catalysts with Pd nanoparticles embedded at the tips. This approach resolves the activity‐stability trade‐off, achieving exceptional poison resistance in semi‐hydrogenations, offering a versatile, scalable platform for designing high‐performance ...
Yintao Li +9 more
wiley +1 more source
Conforming Delaunay triangulations in 3D
Computational Geometry, 2002 The authors present an algorithm to construct a Delaunay triangulation for a generated piecewise linear complex in three-dimensional space. The implementation shows that a relatively small number of Steine points are generated by the algorithm.
Cohen-Steiner, David +2 more
openaire +2 more sources
Direct Observation of Vortex Liquid Droplets in the Iron Pnictide Superconductor CaKFe4As4 at 0.5Tc
Advanced Science, EarlyView.Vortex matter in the iron‐based superconductor CaKFe4As4${\rm CaKFe}_4{\rm As}_4$ is visualized at the nanoscale, revealing the unexpected emergence of vortex‐liquid droplets far below the critical temperature. These localized fluctuating regions coexist with a vortex solid, demonstrating that dissipation‐related dynamics arise well before macroscopic ...
Óscar Bou Marqués +9 more
wiley +1 more source
Geração de malhas para domínios 2,5 dimensionais usando triangulação de delaunay restrita [PDF]
, 2012 Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico, Programa de Pós-graduação em Engenharia Mecânica, Florianópolis, 2001.Gerar uma malha consiste em discretizar um domínio geométrico em pequenos elementos de forma ...
Maliska Junior, Clovis Raimundo
core