Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Constrained Delaunay triangulation (view)

searching for Delaunay triangulation 11 found (95 total)

Kinetic Euclidean minimum spanning tree (234 words) [view diff] exact match in snippet view article find links to article

Rahmati and Zarei build a kinetic data structure based on the kinetic Delaunay triangulation to handle updates to the EMST in polylog time per event. Their kinetic

Rectilinear minimum spanning tree (331 words) [view diff] exact match in snippet view article find links to article

Nicholls, "Efficient minimum spanning tree construction without Delaunay triangulation", Information Processing Letters 81 (2002) 271–276 F. K. Hwang.

Epidemic models on lattices (1,181 words) [view diff] exact match in snippet view article find links to article

1.64872(3), 1.64877(3) 2-d triangular lattice 6 1.54780(5) 2-d Delaunay triangulation of Voronoi Diagram 6 (av) 1.54266(4) 3-d cubic lattice 6 1.31685(10)

Convex hull algorithms (2,219 words) [view diff] case mismatch in snippet view article find links to article

Computational Geometry Algorithms Library Qhull code for Convex Hull, Delaunay Triangulation, Voronoi Diagram, and Halfspace Intersection Demo as Flash swf,

Guosheng Yin (954 words) [view diff] exact match in snippet view article find links to article

Methods in Medical Research 2022. Crystallization learning with the Delaunay triangulation. International Conference on Machine Learning ICML 2021. Demystify

Craig Gotsman (1,547 words) [view diff] case mismatch in snippet view article find links to article

Xu Y., Liu L., Gotsman C. and Gortler S.J. "Capacity-Constrained Delaunay Triangulation for Point Distributions", Computers and Graphics (Proc. SMI), 35(3):510–516

Finite point method (2,650 words) [view diff] exact match in snippet view article find links to article

procedure for constructing local clouds of points based on local Delaunay triangulation, and a criterion for evaluating the quality of the resultant approximation

Point Cloud Library (3,250 words) [view diff] exact match in snippet view article find links to article

(http://www.qhull.org/) implements computation of the convex hull, Delaunay triangulation, Voronoi diagram, and so on. In PCL it is used for convex/concave

Affective computing (6,334 words) [view diff] exact match in snippet view article find links to article

muscle movements. Approaches are based on facial color changes. Delaunay triangulation is used to create the triangular local areas. Some of these triangles

Hilbert–Huang transform (5,501 words) [view diff] exact match in snippet view article find links to article

Zhang [2001], Damerval et al. [2005], and Yuan et al. [2008] used Delaunay triangulation to find the upper and lower bounds of the image. Depending on the

Fat object (geometry) (4,472 words) [view diff] exact match in snippet view article

1996.0063. hdl:1874/17327. Rajan, V. T. (1994). "Optimality of the Delaunay triangulation in R d {\displaystyle \mathbb {R} ^{d}} ". Discrete & Computational