421 research outputs found
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
Minimum-weight triangulation is NP-hard
A triangulation of a planar point set S is a maximal plane straight-line
graph with vertex set S. In the minimum-weight triangulation (MWT) problem, we
are looking for a triangulation of a given point set that minimizes the sum of
the edge lengths. We prove that the decision version of this problem is
NP-hard. We use a reduction from PLANAR-1-IN-3-SAT. The correct working of the
gadgets is established with computer assistance, using dynamic programming on
polygonal faces, as well as the beta-skeleton heuristic to certify that certain
edges belong to the minimum-weight triangulation.Comment: 45 pages (including a technical appendix of 13 pages), 28 figures.
This revision contains a few improvements in the expositio
Polynomial Meshes: Computation and Approximation
We present the software package WAM, written in Matlab, that generates Weakly
Admissible Meshes and Discrete Extremal Sets of Fekete and Leja type, for 2d and 3d
polynomial least squares and interpolation on compact sets with various geometries.
Possible applications range from data fitting to high-order methods for PDEs
Algorithmic and Combinatorial Results on Fence Patrolling, Polygon Cutting and Geometric Spanners
The purpose of this dissertation is to study problems that lie at the intersection of geometry and computer science. We have studied and obtained several results from three different areas, namely–geometric spanners, polygon cutting, and fence patrolling. Specifically, we have designed and analyzed algorithms along with various combinatorial results in these three areas. For geometric spanners, we have obtained combinatorial results regarding lower bounds on worst case dilation of plane spanners. We also have studied low degree plane lattice spanners, both square and hexagonal, of low dilation. Next, for polygon cutting, we have designed and analyzed algorithms for cutting out polygon collections drawn on a piece of planar material
using the three geometric models of saw, namely, line, ray and segment cuts. For fence patrolling, we have designed several strategies for robots patrolling both open and closed fences
PARAMETRIZATION AND SHAPE RECONSTRUCTION TECHNIQUES FOR DOO-SABIN SUBDIVISION SURFACES
This thesis presents a new technique for the reconstruction of a smooth surface from a set of 3D data points. The reconstructed surface is represented by an everywhere -continuous subdivision surface which interpolates all the given data points. And the topological structure of the reconstructed surface is exactly the same as that of the data points. The new technique consists of two major steps. First, use an efficient surface reconstruction method to produce a polyhedral approximation to the given data points. Second, construct a Doo-Sabin subdivision surface that smoothly passes through all the data points in the given data set. A new technique is presented for the second step in this thesis. The new technique iteratively modifies the vertices of the polyhedral approximation 1CM until a new control meshM, whose Doo-Sabin subdivision surface interpolatesM, is reached. It is proved that, for any mesh M with any size and any topology, the iterative process is always convergent with Doo-Sabin subdivision scheme. The new technique has the advantages of both a local method and a global method, and the surface reconstruction process can reproduce special features such as edges and corners faithfully
Lower bounds on the dilation of plane spanners
(I) We exhibit a set of 23 points in the plane that has dilation at least
, improving the previously best lower bound of for the
worst-case dilation of plane spanners.
(II) For every integer , there exists an -element point set
such that the degree 3 dilation of denoted by in the domain of plane geometric spanners. In the
same domain, we show that for every integer , there exists a an
-element point set such that the degree 4 dilation of denoted by
The
previous best lower bound of holds for any degree.
(III) For every integer , there exists an -element point set
such that the stretch factor of the greedy triangulation of is at least
.Comment: Revised definitions in the introduction; 23 pages, 15 figures; 2
table
- …