Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,064,049 papers from all fields of science
Search
Sign In
Create Free Account
Smallest-circle problem
Known as:
Minimal bounding circle
, Minimal enclosing circle
, Smallest circle problem
The smallest-circle problem or minimum covering circle problem is a mathematical problem of computing the smallest circle that contains all of a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
14 relations
1-center problem
Bounding sphere
Chebyshev center
Closest string
Expand
Broader (2)
Combinatorial optimization
Computational geometry
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Power Efficient Visible Light Communication With Unmanned Aerial Vehicles
Yang Yang
,
Mingzhe Chen
,
Caili Guo
,
Chunyan Feng
,
W. Saad
IEEE Communications Letters
2019
Corpus ID: 150373796
A novel approach that combines visible light communication (VLC) with unmanned aerial vehicles (UAVs) to simultaneously provide…
Expand
2016
2016
Parallelism in Randomized Incremental Algorithms
G. Blelloch
,
Yan Gu
,
Julian Shun
,
Yihan Sun
ACM Symposium on Parallelism in Algorithms and…
2016
Corpus ID: 12349988
In this paper we show that most sequential randomized incremental algorithms are in fact parallel. We consider several random…
Expand
Highly Cited
2013
Highly Cited
2013
A Progressive Approach to Reducing Data Collection Latency in Wireless Sensor Networks with Mobile Elements
Liang He
,
Jianping Pan
,
J. Xu
IEEE Transactions on Mobile Computing
2013
Corpus ID: 10958569
The introduction of mobile elements has created a new dimension to reduce and balance the energy consumption in wireless sensor…
Expand
Highly Cited
2013
Highly Cited
2013
Clustering algorithms for maximizing the lifetime of wireless sensor networks with energy-harvesting sensors
Pengfei Zhang
,
Gaoxi Xiao
,
H. Tan
Comput. Networks
2013
Corpus ID: 13770956
2010
2010
Oded Schramm: From Circle Packing to SLE
S. Rohde
2010
Corpus ID: 119703208
When I first met Oded Schramm in January 1991 at the University of California, San Diego, he introduced himself as a “Circle…
Expand
Highly Cited
2010
Highly Cited
2010
An algorithmic framework for segmenting trajectories based on spatio-temporal criteria
M. Buchin
,
A. Driemel
,
M. V. Kreveld
,
Vera Sacristán Adinolfi
ACM SIGSPATIAL International Workshop on Advances…
2010
Corpus ID: 17714899
In this paper we address the problem of segmenting a trajectory such that each segment is in some sense homogeneous. We formally…
Expand
Highly Cited
2006
Highly Cited
2006
On the Smallest Enclosing Information Disk
F. Nielsen
,
R. Nock
Canadian Conference on Computational Geometry
2006
Corpus ID: 7570507
Highly Cited
2000
Highly Cited
2000
MAC Versus PC: Determinism and Randomness as Complementary Approaches to Robotic Exploration of Continuous Unknown Domains
I. Wagner
,
M. Lindenbaum
,
A. Bruckstein
Int. J. Robotics Res.
2000
Corpus ID: 6435638
Three methods are described for exploring a continuous unknown planar region by a group of robots having limited sensors and no…
Expand
2000
2000
Conformally Symmetric Circle Packings: A Generalization of Doyle's Spirals
A. Bobenko
,
Tim Hoffmann
Experimental Mathematics
2000
Corpus ID: 14578266
From the geometric study of the elementary cell of hexagonal circle packings—a flower of 7 circles—the class of conformally…
Expand
Highly Cited
1991
Highly Cited
1991
Smallest enclosing disks (balls and ellipsoids)
E. Welzl
New Results and New Trends in Computer Science
1991
Corpus ID: 17569809
A simple randomized algorithm is developed which computes the smallest enclosing disk of a finite set of points in the plane in…
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