3,014 research outputs found
Approximate Euclidean shortest paths in polygonal domains
Given a set of pairwise disjoint simple polygonal obstacles
in defined with vertices, we compute a sketch of
whose size is independent of , depending only on and the
input parameter . We utilize to compute a
-approximate geodesic shortest path between the two given points
in time. Here, is a user
parameter, and is a small positive constant (resulting from the time
for triangulating the free space of using the algorithm in
\cite{journals/ijcga/Bar-YehudaC94}). Moreover, we devise a
-approximation algorithm to answer two-point Euclidean distance
queries for the case of convex polygonal obstacles.Comment: a few updates; accepted to ISAAC 201
Planar Ultrametric Rounding for Image Segmentation
We study the problem of hierarchical clustering on planar graphs. We
formulate this in terms of an LP relaxation of ultrametric rounding. To solve
this LP efficiently we introduce a dual cutting plane scheme that uses minimum
cost perfect matching as a subroutine in order to efficiently explore the space
of planar partitions. We apply our algorithm to the problem of hierarchical
image segmentation
Moduli of Tropical Plane Curves
We study the moduli space of metric graphs that arise from tropical plane
curves. There are far fewer such graphs than tropicalizations of classical
plane curves. For fixed genus , our moduli space is a stacky fan whose cones
are indexed by regular unimodular triangulations of Newton polygons with
interior lattice points. It has dimension unless or .
We compute these spaces explicitly for .Comment: 31 pages, 25 figure
Inconstancy of finite and infinite sequences
In order to study large variations or fluctuations of finite or infinite
sequences (time series), we bring to light an 1868 paper of Crofton and the
(Cauchy-)Crofton theorem. After surveying occurrences of this result in the
literature, we introduce the inconstancy of a sequence and we show why it seems
more pertinent than other criteria for measuring its variational complexity. We
also compute the inconstancy of classical binary sequences including some
automatic sequences and Sturmian sequences.Comment: Accepted by Theoretical Computer Scienc
On a computer-aided approach to the computation of Abelian integrals
An accurate method to compute enclosures of Abelian integrals is developed.
This allows for an accurate description of the phase portraits of planar
polynomial systems that are perturbations of Hamiltonian systems. As an
example, it is applied to the study of bifurcations of limit cycles arising
from a cubic perturbation of an elliptic Hamiltonian of degree four
- âŠ