Results 111 to 120 of about 655,112 (194)

Dushnik-Miller dimension of TD-Delaunay complexes

, 2017
International audienceTD-Delaunay graphs, where TD stands for triangular distance, is a variation of the classical Delaunay triangulations obtained from a specific convex distance function. Bonichon et. al.
Gonçalves, Daniel, Isenmann, Lucas
core   +1 more source

DeepGeoFusion: personalized facial beauty prediction through geometric-visual fusion

Frontiers in Computer Science
IntroductionPersonalized facial beauty prediction is a critical advancement beyond population-level models with transformative applications in aesthetic surgery planning and user-centric recommendation systems, while contemporary methods face limitations
Kunwei Wang, Yanzhi Li, Dong Huang, Junmei Feng, Xiaoyi Feng   +4 more
doaj   +1 more source

Delaunay τριγωνοποιηση και πλεγματοποιηση

, 2013
Delaunay τριγωνοποιηση και πλεγματοποιησηΗ ανάλυση πεδίων στο Rd, συνήθως, γίνεται με ανάλυση σε μικρότερα κομμάτιατα οποία θέλουμε να είναι κανονικά. Από την εμπειρία στις διαστάσεις 2 και 3,έχουμε ότι τα κομμάτια αυτά είναι πρέπει να είναι τρίγωνα ή ...
Μυλωνάς, Πέτρος - Ανδρέας
core  

Delaunay graphs by divide and conquer

, 1998
This document describes the LEDA program dc_delaunay.c for computing Delaunay graphs by the divide-and-conquer method. The program can be used either with exact primitives or with non-exact primitives. It handles all cases of degeneracy and is relatively robust against the use of imprecise arithmetic.
openaire   +1 more source

Some properties of higher order delaunay and gabriel graphs

, 2010
Postprint (published version)
Bose, Prosenjit, Collette, Sébastien, Hurtado Díaz, Fernando Alfredo, Korman, Matias, Langerman, Stefan, Sacristán Adinolfi, Vera, Saumell Mendiola, Maria   +6 more
openaire   +2 more sources

Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces

$\Theta_k$-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to a factor depending on the cone number $k$ and the dimension of the ...
GAVOILLE, Cyril, ILCINKAS, David, HANUSSE, Nicolas, BONICHON, Nicolas   +3 more
core  

Enhancing PET/CT Radiomics Robustness Through Graph Signal Processing. [PDF]

Diagnostics (Basel)
Latino T, Stefano A, Pasini G, Marinozzi F, Russo G, Bini F.   +5 more
europepmc   +1 more source

Topology Control in Spherical 3D Sensor Networks. [PDF]

Sensors (Basel)
Zarifis N, Katsaros D.
europepmc   +1 more source

Facial Expression Annotation and Analytics for Dysarthria Severity Classification. [PDF]

Sensors (Basel)
Duan S, Guo Y, Fu L, Li F, Dong X, Liang H, Zhang W.   +6 more
europepmc   +1 more source

Graph-theoretic active learning for the closed-loop discovery of stochastic heterogeneous composites. [PDF]

PLoS One
Qiu L, Zhang S, Yang Y, Wang M.
europepmc   +1 more source