Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,397,757 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
8 relations
Bounding sphere
Computational geometry
Convex hull
Facility location problem
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Comparison of Methods for Computing a Target Point for Aspirations and Biopsies
A. Ciszkiewicz
,
G. Milewski
Advances in Intelligent Systems and Computing
2018
Corpus ID: 125838614
The aim of this study was to compare three methods for computing a target point for use in autonomous or semi-autonomous…
Expand
2017
2017
Online Inserting Points Uniformly on the Sphere
Chun Chen
,
Francis C. M. Lau
,
S. Poon
,
Yong Zhang
,
Rong Zhou
Workshop on Algorithms and Computation
2017
Corpus ID: 26388269
In many scientific and engineering applications, there are occasions where points need to be inserted uniformly onto a sphere…
Expand
2014
2014
Pervasive System for Searching the Appropriate Road: A Mobile Physician on Road Network Case Study
Hanen Faiez
,
J. Akaichi
International Work-Conference on Bioinformatics…
2014
Corpus ID: 15506139
Saving a patients live in an emergency state especially if he is far from medical institutions, is considered to be the primary…
Expand
2012
2012
Nearest neighbor searching algorithm with largest empty circle constraint
Yan Chaode
,
Guo Wang
,
Bai Jianjun
,
He Tian
,
Zhao Shan
2012
Corpus ID: 63804744
The nearest neighbor queries of moving objects are of important service terms in LBS(Location-Based Services)field.But the uneven…
Expand
2012
2012
Nearest neighbor searching algorithm with largest empty circle constraint
郭王
,
闫超德
,
贺添
,
赵姗
,
白建军
2012
Corpus ID: 126083069
2011
2011
Deterministic Blue Noise Sampling by Solving Largest Empty Circle Problems
Yoshihiro Kanamori
,
Zoltan Szego
,
T. Nishita
2011
Corpus ID: 14194001
〈Summary〉 Sampling patterns with a blue noise distribution are widely used in many areas of computer graphics, yet their…
Expand
2008
2008
Safe Landing Site Selection Based on Computational Geometry and Genetic Algorithm
Wei Shao
,
P. Cui
,
Weiwen Zhou
Fourth International Conference on Natural…
2008
Corpus ID: 33421107
The landing site decision has direct relation to the safety of a spacecraft. This paper presents the use of computational…
Expand
1999
1999
A SOLUTION TO ON LINE FERMAT LOCATION AND SOME RELATED PROBLEMS
Wang Zheng
1999
Corpus ID: 124332063
The Fermat location problem consists of searching for a point on a plane, such that the sum of distances from the feature point…
Expand
1987
1987
Parallel geometric algorithms on a mesh-connected computer
C. Jeong
,
D. T. Lee
Algorithmica
1987
Corpus ID: 33202284
We show that a number of geometric problems can be solved on a √n × √n mesh-connected computer (MCC) inO(√n) time, which is…
Expand
1986
1986
Geometric Location Problems and Their Complexity
D. T. Lee
International Symposium on Mathematical…
1986
Corpus ID: 38035399
In this paper we discuss a collection of geometric location problems in the plane and their associated time complexity. These…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE