Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Weighted Voronoi diagram (view)

searching for Voronoi diagram 11 found (100 total)

Karlsruhe metric (341 words) [view diff] exact match in snippet view article find links to article

148–157. doi:10.1007/3-540-50335-8_31. Karlsruhe-metric Voronoi diagram, by Takashi Ohyama Karlsruhe-Metric Voronoi Diagram, by Rashid Bin Muhammad v t e

Constrained Delaunay triangulation (538 words) [view diff] exact match in snippet view article find links to article

(1999), "Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear time", SIAM Journal on Computing, 28

Edmond Laguerre (292 words) [view diff] exact match in snippet view article find links to article

Laguerre–Forsyth invariant Laguerre–Samuelson inequality Laguerre–Voronoi diagram (in French) "Nécrologie". In: Nouvelles annales de mathématiques, 3rd

Discrete skeleton evolution (800 words) [view diff] exact match in snippet view article find links to article

variety of methods: Thinning algorithms, such as the Grassfire transform Voronoi diagram Medial Axis Transform or Symmetry Axis Transform Distance Mapping DSE

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

Algorithms Library Qhull code for Convex Hull, Delaunay Triangulation, Voronoi Diagram, and Halfspace Intersection Demo as Flash swf, Jarvis, Graham, Quick

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

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), 1.31683(2), 1.31686(1)

Symposium on Geometry Processing (267 words) [view diff] exact match in snippet view article find links to article

Functions 2008 Ramsay Dyer et al. Surface sampling and the intrinsic Voronoi diagram Sebastian Martin et al. Polyhedral Finite Elements Using Harmonic Basis

Smallest-circle problem (2,508 words) [view diff] exact match in snippet view article find links to article

the smallest enclosing circle must be a vertex of the farthest-point Voronoi diagram of the input point set. The weighted version of the minimum covering

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

implements computation of the convex hull, Delaunay triangulation, Voronoi diagram, and so on. In PCL it is used for convex/concave hull decomposition

Karlsruhe (5,912 words) [view diff] case mismatch in snippet view article find links to article

2021-06-13. Retrieved 2022-12-23. Rashid Bin Muhammad. "Karlsruhe-Metric Voronoi Diagram". Personal.kent.edu. Retrieved 2011-04-07. "Die Wetterstationen in

Percolation threshold (15,036 words) [view diff] exact match in snippet view article find links to article

Voronoi diagram (solid lines) and its dual, the Delaunay triangulation (dotted lines), for a Poisson distribution of points