80,288 research outputs found
On the computation of zone and double zone diagrams
Classical objects in computational geometry are defined by explicit
relations. Several years ago the pioneering works of T. Asano, J. Matousek and
T. Tokuyama introduced "implicit computational geometry", in which the
geometric objects are defined by implicit relations involving sets. An
important member in this family is called "a zone diagram". The implicit nature
of zone diagrams implies, as already observed in the original works, that their
computation is a challenging task. In a continuous setting this task has been
addressed (briefly) only by these authors in the Euclidean plane with point
sites. We discuss the possibility to compute zone diagrams in a wide class of
spaces and also shed new light on their computation in the original setting.
The class of spaces, which is introduced here, includes, in particular,
Euclidean spheres and finite dimensional strictly convex normed spaces. Sites
of a general form are allowed and it is shown that a generalization of the
iterative method suggested by Asano, Matousek and Tokuyama converges to a
double zone diagram, another implicit geometric object whose existence is known
in general. Occasionally a zone diagram can be obtained from this procedure.
The actual (approximate) computation of the iterations is based on a simple
algorithm which enables the approximate computation of Voronoi diagrams in a
general setting. Our analysis also yields a few byproducts of independent
interest, such as certain topological properties of Voronoi cells (e.g., that
in the considered setting their boundaries cannot be "fat").Comment: Very slight improvements (mainly correction of a few typos); add DOI;
Ref [51] points to a freely available computer application which implements
the algorithms; to appear in Discrete & Computational Geometry (available
online
Forcing nonperiodicity with a single tile
An aperiodic prototile is a shape for which infinitely many copies can be
arranged to fill Euclidean space completely with no overlaps, but not in a
periodic pattern. Tiling theorists refer to such a prototile as an "einstein"
(a German pun on "one stone"). The possible existence of an einstein has been
pondered ever since Berger's discovery of large set of prototiles that in
combination can tile the plane only in a nonperiodic way. In this article we
review and clarify some features of a prototile we recently introduced that is
an einstein according to a reasonable definition. [This abstract does not
appear in the published article.]Comment: 18 pages, 10 figures. This article has been substantially revised and
accepted for publication in the Mathematical Intelligencer and is scheduled
to appear in Vol 33. Citations to and quotations from this work should
reference that publication. If you cite this work, please check that the
published form contains precisely the material to which you intend to refe
Adiabatic and Hamiltonian computing on a 2D lattice with simple 2-qubit interactions
We show how to perform universal Hamiltonian and adiabatic computing using a
time-independent Hamiltonian on a 2D grid describing a system of hopping
particles which string together and interact to perform the computation. In
this construction, the movement of one particle is controlled by the presence
or absence of other particles, an effective quantum field effect transistor
that allows the construction of controlled-NOT and controlled-rotation gates.
The construction translates into a model for universal quantum computation with
time-independent 2-qubit ZZ and XX+YY interactions on an (almost) planar grid.
The effective Hamiltonian is arrived at by a single use of first-order
perturbation theory avoiding the use of perturbation gadgets. The dynamics and
spectral properties of the effective Hamiltonian can be fully determined as it
corresponds to a particular realization of a mapping between a quantum circuit
and a Hamiltonian called the space-time circuit-to-Hamiltonian construction.
Because of the simple interactions required, and because no higher-order
perturbation gadgets are employed, our construction is potentially realizable
using superconducting or other solid-state qubits.Comment: 33 pages, 5 figure
Witness (Delaunay) Graphs
Proximity graphs are used in several areas in which a neighborliness
relationship for input data sets is a useful tool in their analysis, and have
also received substantial attention from the graph drawing community, as they
are a natural way of implicitly representing graphs. However, as a tool for
graph representation, proximity graphs have some limitations that may be
overcome with suitable generalizations. We introduce a generalization, witness
graphs, that encompasses both the goal of more power and flexibility for graph
drawing issues and a wider spectrum for neighborhood analysis. We study in
detail two concrete examples, both related to Delaunay graphs, and consider as
well some problems on stabbing geometric objects and point set discrimination,
that can be naturally described in terms of witness graphs.Comment: 27 pages. JCCGG 200
3-manifolds efficiently bound 4-manifolds
It is known since 1954 that every 3-manifold bounds a 4-manifold. Thus, for
instance, every 3-manifold has a surgery diagram. There are several proofs of
this fact, including constructive proofs, but there has been little attention
to the complexity of the 4-manifold produced. Given a 3-manifold M of
complexity n, we show how to construct a 4-manifold bounded by M of complexity
O(n^2). Here we measure ``complexity'' of a piecewise-linear manifold by the
minimum number of n-simplices in a triangulation. It is an open question
whether this quadratic bound can be replaced by a linear bound.
The proof goes through the notion of "shadow complexity" of a 3-manifold M. A
shadow of M is a well-behaved 2-dimensional spine of a 4-manifold bounded by M.
We prove that, for a manifold M satisfying the Geometrization Conjecture with
Gromov norm G and shadow complexity S, c_1 G <= S <= c_2 G^2 for suitable
constants c_1, c_2. In particular, the manifolds with shadow complexity 0 are
the graph manifolds.Comment: 39 pages, 21 figures; added proof for spin case as wel
Complete Subdivision Algorithms, II: Isotopic Meshing of Singular Algebraic Curves
Given a real valued function f(X,Y), a box region B_0 in R^2 and a positive
epsilon, we want to compute an epsilon-isotopic polygonal approximation to the
restriction of the curve S=f^{-1}(0)={p in R^2: f(p)=0} to B_0. We focus on
subdivision algorithms because of their adaptive complexity and ease of
implementation. Plantinga and Vegter gave a numerical subdivision algorithm
that is exact when the curve S is bounded and non-singular. They used a
computational model that relied only on function evaluation and interval
arithmetic. We generalize their algorithm to any bounded (but possibly
non-simply connected) region that does not contain singularities of S. With
this generalization as a subroutine, we provide a method to detect isolated
algebraic singularities and their branching degree. This appears to be the
first complete purely numerical method to compute isotopic approximations of
algebraic curves with isolated singularities
- …