28,782 research outputs found

    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

    Convex Tours of Bounded Curvature

    Get PDF
    We consider the motion planning problem for a point constrained to move along a smooth closed convex path of bounded curvature. The workspace of the moving point is bounded by a convex polygon with m vertices, containing an obstacle in a form of a simple polygon with nn vertices. We present an O(m+n) time algorithm finding the path, going around the obstacle, whose curvature is the smallest possible.Comment: 11 pages, 5 figures, abstract presented at European Symposium on Algorithms 199

    Largest Empty Circle Centered on a Query Line

    Full text link
    The Largest Empty Circle problem seeks the largest circle centered within the convex hull of a set PP of nn points in R2\mathbb{R}^2 and devoid of points from PP. In this paper, we introduce a query version of this well-studied problem. In our query version, we are required to preprocess PP so that when given a query line QQ, we can quickly compute the largest empty circle centered at some point on QQ and within the convex hull of PP. We present solutions for two special cases and the general case; all our queries run in O(logn)O(\log n) time. We restrict the query line to be horizontal in the first special case, which we preprocess in O(nα(n)logn)O(n \alpha(n) \log n) time and space, where α(n)\alpha(n) is the slow growing inverse of the Ackermann's function. When the query line is restricted to pass through a fixed point, the second special case, our preprocessing takes O(nα(n)O(α(n))logn)O(n \alpha(n)^{O(\alpha(n))} \log n) time and space. We use insights from the two special cases to solve the general version of the problem with preprocessing time and space in O(n3logn)O(n^3 \log n) and O(n3)O(n^3) respectively.Comment: 18 pages, 13 figure

    Reverse Nearest Neighbor Heat Maps: A Tool for Influence Exploration

    Full text link
    We study the problem of constructing a reverse nearest neighbor (RNN) heat map by finding the RNN set of every point in a two-dimensional space. Based on the RNN set of a point, we obtain a quantitative influence (i.e., heat) for the point. The heat map provides a global view on the influence distribution in the space, and hence supports exploratory analyses in many applications such as marketing and resource management. To construct such a heat map, we first reduce it to a problem called Region Coloring (RC), which divides the space into disjoint regions within which all the points have the same RNN set. We then propose a novel algorithm named CREST that efficiently solves the RC problem by labeling each region with the heat value of its containing points. In CREST, we propose innovative techniques to avoid processing expensive RNN queries and greatly reduce the number of region labeling operations. We perform detailed analyses on the complexity of CREST and lower bounds of the RC problem, and prove that CREST is asymptotically optimal in the worst case. Extensive experiments with both real and synthetic data sets demonstrate that CREST outperforms alternative algorithms by several orders of magnitude.Comment: Accepted to appear in ICDE 201

    On finding widest empty curved corridors

    Get PDF
    Open archive-ElsevierAn α-siphon of width w is the locus of points in the plane that are at the same distance w from a 1-corner polygonal chain C such that α is the interior angle of C. Given a set P of n points in the plane and a fixed angle α, we want to compute the widest empty α-siphon that splits P into two non-empty sets.We present an efficient O(n log3 n)-time algorithm for computing the widest oriented α-siphon through P such that the orientation of a half-line of C is known.We also propose an O(n3 log2 n)-time algorithm for the widest arbitrarily-oriented version and an (nlog n)-time algorithm for the widest arbitrarily-oriented α-siphon anchored at a given point

    Optimal Point Placement for Mesh Smoothing

    Full text link
    We study the problem of moving a vertex in an unstructured mesh of triangular, quadrilateral, or tetrahedral elements to optimize the shapes of adjacent elements. We show that many such problems can be solved in linear time using generalized linear programming. We also give efficient algorithms for some mesh smoothing problems that do not fit into the generalized linear programming paradigm.Comment: 12 pages, 3 figures. A preliminary version of this paper was presented at the 8th ACM/SIAM Symp. on Discrete Algorithms (SODA '97). This is the final version, and will appear in a special issue of J. Algorithms for papers from SODA '9
    corecore