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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1983-2017
02419832017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Constant-work-space algorithms may use only constantly many cells of storage in addition to their input, which is provided as a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
Constant-work-space algorithms may use only constantly many cells of storage in addition to their input, which is provided as a… (More)
Is this relevant?
2004
2004
This paper presents a novel approach to solve the largest empty sphere (LES) problem in the multidimensional space by using a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?
2002
2002
We give the first nontrivial worst-case results for dynamic versions of various basic geometric optimization and measure problems… (More)
  • table 1
Is this relevant?
1994
1994
1 Abstract We present parallel computational geometry algorithms that are scalable, architecture independent, easy to implement… (More)
  • figure 1
  • figure 2
  • table 1
Is this relevant?
1991
1991
It has been shown previously that given n items and a polynomial number of processors, sorting these items into n locations… (More)
  • figure 1
Is this relevant?
1990
1990
We show that a number of geometric problems can be solved on a √n × √n mesh-connected computer (MCC) inO(√n) time, which is… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1985
1985
Although mesh-connected computers are used almost exclusively for low-level local image processing, they are also suitable for… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 7
Is this relevant?
1983
1983
LetQ = {q1, q2,..., qn} be a set ofn points on the plane. The largest empty circle (LEG) problem consists in finding the largest… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?