Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
We present new results on a number of fundamental problems about dynamic geometric data structures: 1. We describe the first… Expand
Is this relevant?
2010
2010
The Largest Empty Circle problem seeks the largest circle centered within the convex hull of a set P of n points in R^2 and… Expand
  • 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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
The landing site decision has direct relation to the safety of a spacecraft. This paper presents the use of computational… Expand
  • figure 2
  • figure 1
  • figure 3
  • table 1
  • figure 4
Is this relevant?
2007
2007
We present a new method for extracting the feature primitives of a 3D object directly from the point cloud of its surface scan… Expand
  • figure 2
  • figure 1
  • figure 3
  • figure 5
  • figure 4
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?
2004
2004
We propose an efficient algorithm for incremental deployment of nodes in a wireless sensor network. By examining the distribution… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2002
2002
We give the first nontrivial worst-case results for dynamic versions of various basic geometric optimization and measure problems… Expand
  • table 1
Is this relevant?
1994
1994
We present parallel computational geometry algorithms that are scalable, architecture independent, easy to implement, and have… Expand
  • figure 1
  • figure 2a8
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?