1,988 research outputs found

    Geodesic-Preserving Polygon Simplification

    Full text link
    Polygons are a paramount data structure in computational geometry. While the complexity of many algorithms on simple polygons or polygons with holes depends on the size of the input polygon, the intrinsic complexity of the problems these algorithms solve is often related to the reflex vertices of the polygon. In this paper, we give an easy-to-describe linear-time method to replace an input polygon P\mathcal{P} by a polygon P′\mathcal{P}' such that (1) P′\mathcal{P}' contains P\mathcal{P}, (2) P′\mathcal{P}' has its reflex vertices at the same positions as P\mathcal{P}, and (3) the number of vertices of P′\mathcal{P}' is linear in the number of reflex vertices. Since the solutions of numerous problems on polygons (including shortest paths, geodesic hulls, separating point sets, and Voronoi diagrams) are equivalent for both P\mathcal{P} and P′\mathcal{P}', our algorithm can be used as a preprocessing step for several algorithms and makes their running time dependent on the number of reflex vertices rather than on the size of P\mathcal{P}

    Covering the Boundary of a Simple Polygon with Geodesic Unit Disks

    Full text link
    We consider the problem of covering the boundary of a simple polygon on n vertices using the minimum number of geodesic unit disks. We present an O(n \log^2 n+k) time 2-approximation algorithm for finding the centers of the disks, with k denoting the number centers found by the algorithm

    Farthest-Polygon Voronoi Diagrams

    Get PDF
    Given a family of k disjoint connected polygonal sites in general position and of total complexity n, we consider the farthest-site Voronoi diagram of these sites, where the distance to a site is the distance to a closest point on it. We show that the complexity of this diagram is O(n), and give an O(n log^3 n) time algorithm to compute it. We also prove a number of structural properties of this diagram. In particular, a Voronoi region may consist of k-1 connected components, but if one component is bounded, then it is equal to the entire region

    Querying for the Largest Empty Geometric Object in a Desired Location

    Full text link
    We study new types of geometric query problems defined as follows: given a geometric set PP, preprocess it such that given a query point qq, the location of the largest circle that does not contain any member of PP, but contains qq can be reported efficiently. The geometric sets we consider for PP are boundaries of convex and simple polygons, and point sets. While we primarily focus on circles as the desired shape, we also briefly discuss empty rectangles in the context of point sets.Comment: This version is a significant update of our earlier submission arXiv:1004.0558v1. Apart from new variants studied in Sections 3 and 4, the results have been improved in Section 5.Please note that the change in title and abstract indicate that we have expanded the scope of the problems we stud

    A Pseudopolynomial Algorithm for Alexandrov's Theorem

    Full text link
    Alexandrov's Theorem states that every metric with the global topology and local geometry required of a convex polyhedron is in fact the intrinsic metric of a unique convex polyhedron. Recent work by Bobenko and Izmestiev describes a differential equation whose solution leads to the polyhedron corresponding to a given metric. We describe an algorithm based on this differential equation to compute the polyhedron to arbitrary precision given the metric, and prove a pseudopolynomial bound on its running time. Along the way, we develop pseudopolynomial algorithms for computing shortest paths and weighted Delaunay triangulations on a polyhedral surface, even when the surface edges are not shortest paths.Comment: 25 pages; new Delaunay triangulation algorithm, minor other changes; an abbreviated v2 was at WADS 200
    • …
    corecore