Results 161 to 170 of about 655,112 (194)

SpatialLeiden: spatially aware Leiden clustering. [PDF]

Genome Biol
Müller-Bötticher N, Sahay S, Eils R, Ishaque N.   +3 more
europepmc   +1 more source

Triangulation-Based Spatial Clustering for Adjacent Data With Heterogeneous Density. [PDF]

Stat Anal Data Min
Zhou S, Vasiliu D, Qi S, Wang G.
europepmc   +1 more source

On Structural and Graph Theoretic Properties of Higher Order Delaunay Graphs [PDF]

International Journal of Computational Geometry and Applications, 2009
Given a set P of n points in the plane, the order-k Delaunay graph is a graph with vertex set P and an edge exists between two points p, q ∈ P when there is a circle through p and q with at most k other points of P in its interior. We provide upper and lower bounds on the number of edges in an order-k Delaunay graph.
Pedro Ramos, Prosenjit Bose, Ferran Hurtado   +2 more
exaly   +8 more sources

Generalized Delaunay Triangulation for Planar Graphs [PDF]

Discrete and Computational Geometry, 1986
The Delaunay triangulation of a planar straight line graph has the property that the circumcircle of any triangle does not contain any other vertex in its interior. The authors introduce a generalized Delaunay triangulation such that this circumcircle contains no vertices which are visible from the three vertices of the triangle. It is shown that there
Der-Tsai Lee
exaly   +5 more sources

Matching Delaunay Graphs [PDF]

Pattern Recognition, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Richard Wilson, Edwin Hancock
exaly   +2 more sources

Witness (Delaunay) Graphs

Computational Geometry: Theory and Applications, 2011
Proximity graphs are used in several areas in which a neighborliness relationship for input data sets is a useful tool in their analysis, and have also received substantial attention from the graph drawing community, as they are a natural way of implicitly representing graphs.
Boris Aronov, Ferran Hurtado, Muriel Dulieu   +2 more
exaly   +5 more sources

The Maximal Degree in a Poisson–Delaunay Graph [PDF]

Bernoulli, 2020
We investigate the maximal degree in a Poisson-Delaunay graph in $\mathbf{R}^d$, $d\geq 2$, over all nodes in the window $\mathbf{W}_ρ:= ρ^{1/d}[0,1]^d$ as $ρ$ goes to infinity. The exact order of this maximum is provided in any dimension. In the particular setting $d=2$, we show that this quantity is concentrated on two consecutive integers with high ...
Nicolas Chenavier, Gilles Bonnet
exaly   +4 more sources

Delaunay Graph Based Inverse Distance Weighting for Fast Dynamic Meshing

Communications in Computational Physics, 2017
A novel mesh deformation technique is developed based on the Delaunay graph mapping method and the inverse distance weighting (IDW) interpolation. The algorithm maintains the advantages of the efficiency of Delaunay graph mapping mesh deformation while ...
Ning Zhao, Ning Qin
exaly   +2 more sources