6,154 research outputs found
Packing and covering with balls on Busemann surfaces
In this note we prove that for any compact subset of a Busemann surface
(in particular, for any simple polygon with geodesic metric)
and any positive number , the minimum number of closed balls of radius
with centers at and covering the set is at most 19
times the maximum number of disjoint closed balls of radius centered
at points of : , where and
are the covering and the packing numbers of by -balls.Comment: 27 page
Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain
We study the computation of the diameter and radius under the rectilinear
link distance within a rectilinear polygonal domain of vertices and
holes. We introduce a \emph{graph of oriented distances} to encode the distance
between pairs of points of the domain. This helps us transform the problem so
that we can search through the candidates more efficiently. Our algorithm
computes both the diameter and the radius in time, where denotes the matrix
multiplication exponent and is the number of
edges of the graph of oriented distances. We also provide a faster algorithm
for computing the diameter that runs in time
Constant-Factor Approximation for TSP with Disks
We revisit the traveling salesman problem with neighborhoods (TSPN) and
present the first constant-ratio approximation for disks in the plane: Given a
set of disks in the plane, a TSP tour whose length is at most times
the optimal can be computed in time that is polynomial in . Our result is
the first constant-ratio approximation for a class of planar convex bodies of
arbitrary size and arbitrary intersections. In order to achieve a
-approximation, we reduce the traveling salesman problem with disks, up
to constant factors, to a minimum weight hitting set problem in a geometric
hypergraph. The connection between TSPN and hitting sets in geometric
hypergraphs, established here, is likely to have future applications.Comment: 14 pages, 3 figure
Clustering with Neighborhoods
In the standard planar -center clustering problem, one is given a set
of points in the plane, and the goal is to select center points, so as
to minimize the maximum distance over points in to their nearest center.
Here we initiate the systematic study of the clustering with neighborhoods
problem, which generalizes the -center problem to allow the covered objects
to be a set of general disjoint convex objects rather than just a
point set . For this problem we first show that there is a PTAS for
approximating the number of centers. Specifically, if is the optimal
radius for centers, then in time we can produce a
set of centers with radius . If instead one
considers the standard goal of approximating the optimal clustering radius,
while keeping as a hard constraint, we show that the radius cannot be
approximated within any factor in polynomial time unless , even
when is a set of line segments. When is a set of
unit disks we show the problem is hard to approximate within a factor of
. This hardness result
complements our main result, where we show that when the objects are disks, of
possibly differing radii, there is a approximation
algorithm. Additionally, for unit disks we give an time -approximation to the optimal
radius, that is, an FPTAS for constant whose running time depends only
linearly on . Finally, we show that the one dimensional version of the
problem, even when intersections are allowed, can be solved exactly in time
Magnetic-field dependence of transport in normal and Andreev billiards: a classical interpretation to the averaged quantum behavior
We perform a comparative study of the quantum and classical transport
probabilities of low-energy quasiparticles ballistically traversing normal and
Andreev two-dimensional open cavities with a Sinai-billiard shape. We focus on
the dependence of the transport on the strength of an applied magnetic field
. With increasing field strength the classical dynamics changes from mixed
to regular phase space. Averaging out the quantum fluctuations, we find an
excellent agreement between the quantum and classical transport coefficients in
the complete range of field strengths. This allows an overall description of
the non-monotonic behavior of the average magnetoconductance in terms of the
corresponding classical trajectories, thus, establishing a basic tool useful in
the design and analysis of experiments.Comment: 11 pages, 12 figures; minor revisions including updated inset of Fig.
4(b) and references; version as accepted for publication to Phys. Rev.
Critical Percolation Exploration Path and SLE(6): a Proof of Convergence
It was argued by Schramm and Smirnov that the critical site percolation
exploration path on the triangular lattice converges in distribution to the
trace of chordal SLE(6). We provide here a detailed proof, which relies on
Smirnov's theorem that crossing probabilities have a conformally invariant
scaling limit (given by Cardy's formula). The version of convergence to SLE(6)
that we prove suffices for the Smirnov-Werner derivation of certain critical
percolation crossing exponents and for our analysis of the critical percolation
full scaling limit as a process of continuum nonsimple loops.Comment: 45 pages, 14 figures; revised version following the comments of a
refere
- …