LOWER BOUND FOR CONVEX HULL AREA AND UNIVERSAL COVER PROBLEMS
نویسندگان
چکیده
منابع مشابه
A Lower Bound for Area-Universal Graphs
Devdatt Dubhashi§ We establish a lower bound on the efficiency of area-universal circuits. The area Au of every graph H that can host any graph G of area (at most) A with dilation d, and congestion c ~ ../AI log log A satisfies the tradeoff Au = O(AlogAI(c log(2d»), . In particular, ifAu = 0 (A) then max( c, d) = O( Jlog AI log log A).
متن کاملAdaptive Algorithms for Planar Convex Hull Problems
We study problems in computational geometry from the viewpoint of adaptive algorithms. Adaptive algorithms have been extensively studied for the sorting problem, and in this paper we generalize the framework to geometric problems. To this end, we think of geometric problems as permutation (or rearranging) problems of arrays, and define the “presortedness” as a distance from the input array to t...
متن کاملRectilinear Convex Hull with Minimum Area
Let P be a set of n points in the plane. We solve the problem of computing the orientations for which the rectilinear convex hull of P has minimum area in optimal ⇥(n log n) time and O(n) space. Introduction The interest in the rectilinear convex hull of planar point sets arises from the study of ortho-convexity [10], a relaxation of traditional convexity. Unlike convex regions, an ortho-convex...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملMinimax Lower Bound for Passive Convex Optimization
Convex optimization also determines the next estimate based on the observation at previous points. In this sense, optimization has a close connection with active learning. An interesting question is: what if we become “passive” in optimization? That is, how important is adaptivity in optimization? Understanding this kind of problems becomes crucial in settings where observing a single point tak...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Geometry & Applications
سال: 2013
ISSN: 0218-1959,1793-6357
DOI: 10.1142/s0218195913500076