Skip to search formSkip to main contentSkip to account menu

Largest empty sphere

Known as: Largest empty circle 
In computational geometry, the largest empty sphere problem is the problem of finding a hypersphere of largest radius in d-dimensional space whose… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
The aim of this study was to compare three methods for computing a target point for use in autonomous or semi-autonomous… 
2017
2017
In many scientific and engineering applications, there are occasions where points need to be inserted uniformly onto a sphere… 
2014
2014
Saving a patients live in an emergency state especially if he is far from medical institutions, is considered to be the primary… 
2012
2012
The nearest neighbor queries of moving objects are of important service terms in LBS(Location-Based Services)field.But the uneven… 
2011
2011
〈Summary〉 Sampling patterns with a blue noise distribution are widely used in many areas of computer graphics, yet their… 
2008
2008
The landing site decision has direct relation to the safety of a spacecraft. This paper presents the use of computational… 
1999
1999
The Fermat location problem consists of searching for a point on a plane, such that the sum of distances from the feature point… 
1987
1987
We show that a number of geometric problems can be solved on a √n × √n mesh-connected computer (MCC) inO(√n) time, which is… 
1986
1986
In this paper we discuss a collection of geometric location problems in the plane and their associated time complexity. These…