109 research outputs found
Convexity preserving interpolatory subdivision with conic precision
The paper is concerned with the problem of shape preserving interpolatory
subdivision. For arbitrarily spaced, planar input data an efficient non-linear
subdivision algorithm is presented that results in limit curves,
reproduces conic sections and respects the convexity properties of the initial
data. Significant numerical examples illustrate the effectiveness of the
proposed method
Fat Polygonal Partitions with Applications to Visualization and Embeddings
Let be a rooted and weighted tree, where the weight of any node
is equal to the sum of the weights of its children. The popular Treemap
algorithm visualizes such a tree as a hierarchical partition of a square into
rectangles, where the area of the rectangle corresponding to any node in
is equal to the weight of that node. The aspect ratio of the
rectangles in such a rectangular partition necessarily depends on the weights
and can become arbitrarily high.
We introduce a new hierarchical partition scheme, called a polygonal
partition, which uses convex polygons rather than just rectangles. We present
two methods for constructing polygonal partitions, both having guarantees on
the worst-case aspect ratio of the constructed polygons; in particular, both
methods guarantee a bound on the aspect ratio that is independent of the
weights of the nodes.
We also consider rectangular partitions with slack, where the areas of the
rectangles may differ slightly from the weights of the corresponding nodes. We
show that this makes it possible to obtain partitions with constant aspect
ratio. This result generalizes to hyper-rectangular partitions in
. We use these partitions with slack for embedding ultrametrics
into -dimensional Euclidean space: we give a -approximation algorithm for embedding -point ultrametrics
into with minimum distortion, where denotes the spread
of the metric, i.e., the ratio between the largest and the smallest distance
between two points. The previously best-known approximation ratio for this
problem was polynomial in . This is the first algorithm for embedding a
non-trivial family of weighted-graph metrics into a space of constant dimension
that achieves polylogarithmic approximation ratio.Comment: 26 page
Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation
We revisit two NP-hard geometric partitioning problems - convex decomposition
and surface approximation. Building on recent developments in geometric
separators, we present quasi-polynomial time algorithms for these problems with
improved approximation guarantees.Comment: 21 pages, 6 figure
Heuristics for optimum binary search trees and minimum weight triangulation problems
AbstractIn this paper we establish new bounds on the problem of constructing optimum binary search trees with zero-key access probabilities (with applications e.g. to point location problems). We present a linear-time heuristic for constructing such search trees so that their cost is within a factor of 1 + ε from the optimum cost, where ε is an arbitrary small positive constant. Furthermore, by using an interesting amortization argument, we give a simple and practical, linear-time implementation of a known greedy heuristics for such trees.The above results are obtained in a more general setting, namely in the context of minimum length triangulations of so-called semi-circular polygons. They are carried over to binary search trees by proving a duality between optimum (m − 1)-way search trees and minimum weight partitions of infinitely-flat semi-circular polygons into m-gons. With this duality we can also obtain better heuristics for minimum length partitions of polygons by using known algorithms for optimum search trees
A (7/2)-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras
Consider a sliding camera that travels back and forth along an orthogonal
line segment inside an orthogonal polygon with vertices. The camera
can see a point inside if and only if there exists a line segment
containing that crosses at a right angle and is completely contained in
. In the minimum sliding cameras (MSC) problem, the objective is to guard
with the minimum number of sliding cameras. In this paper, we give an
-time -approximation algorithm to the MSC problem on any
simple orthogonal polygon with vertices, answering a question posed by Katz
and Morgenstern (2011). To the best of our knowledge, this is the first
constant-factor approximation algorithm for this problem.Comment: 11 page
- …