A lower bound for computing geometric spanners
نویسندگان
چکیده
منابع مشابه
Lower Bound for Sparse Geometric Spanners
Given a one-dimensional graph G such that any two consecutive nodes are unit distance away, and that the minimum number of links between any two nodes (the diameter of G) is O(log n), we provide an Ω(n log n/ log log n) lower bound on the sum of lengths of all the edges (i.e., the weight of G). The problem is a variant of the widely studied partial sums problem. This in turn provides a lower bo...
متن کاملLower Bounds for Computing Geometric Spanners and Approximate Shortest Paths
We consider the problems of constructing geometric spanners, possibly containing Steiner points, for sets of points in the d-dimensional space IR d , and constructing spanners and approximate shortest paths among a collection of polygonal obstacles in the plane. The complexities of these problems are shown to be (n log n) in the algebraic computation tree model. Since O(n log n)-time algorithms...
متن کاملI/O-efficient algorithms for computing planar geometric spanners
We present I/O-efficient algorithms for computing planar Steiner spanners for point sets and sets of polygonal obstacles in the plane. © 2007 Elsevier B.V. All rights reserved.
متن کاملA lower bound for computing Oja depth
Let S = {s1, . . . , sn} be a set of points in the plane. The Oja depth of a query point θ with respect to S is the sum of the areas of all triangles (θ, si, sj). This depth may be computed in O(n log n) time in the RAM model of computation. We show that a matching lower bound holds in the algebraic decision tree model. This bound also applies to the computation of the Oja gradient, the Oja sig...
متن کاملA Lower Bound for Computing Lagrange's Real Root Bound
In this paper, we study a bound on the real roots of a polynomial by Lagrange. From known results in the literature, it follows that Lagrange’s bound is also a bound on the absolute positiveness of a polynomial. A simple O(n logn) algorithm described in Mehlhorn-Ray (2010) can be used to compute the bound. Our main result is that this is optimal in the real RAM model. Our paper explores the tra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2016
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2015.12.004