Search Results for ""
1 - 10 of 23 for voronoiSearch Results
View search results from all Wolfram sites (233 matches)The generalization of a Voronoi polygon to n dimensions for n>2.
A polygon whose interior consists of all points in the plane which are closer to a particular lattice point than to any other. The generalization to n dimensions is called a ...
The partitioning of a plane with n points into convex polygons such that each polygon contains exactly one generating point and every point in a given polygon is closer to ...
The boundaries of the cells of a Voronoi diagram.
A plesiohedron is the Voronoi cell of a so-called symmetric Delone set. Plesiohedra are space-filling polyhedra which have special symmetries that take any copy of the ...
The study of efficient algorithms for solving geometric problems. Examples of problems treated by computational geometry include determination of the convex hull and Voronoi ...
The Delaunay triangulation is a triangulation which is equivalent to the nerve of the cells in a Voronoi diagram, i.e., that triangulation of the convex hull of the points in ...
In Season 4 episode "Black Swan" of the television crime drama NUMB3RS, the character Amita Ramanujan refers to universality classes when studying a map of the Los Angeles ...
In Season 4 episode "Black Swan" of the television crime drama NUMB3RS, the character Amita Ramanujan refers to graph entropies when studying a map of the Los Angeles while ...
The kissing number of a sphere is 12. This led Fejes Tóth (1943) to conjecture that in any unit sphere packing, the volume of any Voronoi cell around any sphere is at least ...
...