✳flâneur — a map of the web's best reading

Largest empty sphere - Wikipedia

en.wikipedia.org · 234 words · saved by 1 readers

In computational geometry, the largest empty sphere problem is the problem of finding a hypersphere of largest radius in d-dimensional space whose interior does not overlap with any given obstacles. The largest empty circle problem is the problem of finding a circle of largest radius in the plane whose interior does not overlap with any given obstacles. A common special case is as follows. Given n points in the plane, find a largest circle centered within their convex hull and enclosing none of them. The problem may be solved using Voronoi diagrams in optimal time Θ ( 𝑛 log 𝑛 ) .[1][2]

Largest empty sphere - Wikipedia Jump to content From Wikipedia, the free encyclopedia The dashed circle is the outline of the largest empty sphere in the close-packing of spheres . See also Interstitial defect . Finding the largest empty circle using the Voronoi diagram (two solutions). In computational geometry , the largest empty sphere problem is the problem of finding a hypersphere of largest radius in d -dimensional space whose interior does not overlap with any given obstacles. Two dimensions [ edit ] The largest empty circle problem is the problem of finding a circle of largest radius

Explore this link on the map →

related reading