Largest and Smallest Convex Hulls for Imprecise Points
نویسندگان
چکیده
منابع مشابه
Approximating Largest Convex Hulls for Imprecise Points
Assume that a set of imprecise points is given, where each point is specified by a region in which the point will lie. Such a region can be modelled as a circle, square, line segment, etc. We study the problem of maximising the area of the convex hull of such a set. We prove NP-hardness when the imprecise points are modelled as line segments, and give linear time approximation schemes for a var...
متن کاملLargest and Smallest Area Triangles on a Given Set of Imprecise Points
In this paper we study the following problem: we are given a set of imprecise points modeled as parallel line segments, and we wish to place a point on each line segment such that the resulting point set maximizes/minimizes the size of the largest/smallest area k-gon. We first study the problem for the case k = 3. We show that for a given set of parallel line segments of equal length the larges...
متن کاملLargest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points
We model imprecise points as regions in which one point must be located. We study computing the largest and smallest possible values of various basic geometric measures on sets of imprecise points, such as the diameter, width, closest pair, smallest enclosing circle, and smallest enclosing bounding box. We give efficient algorithms for most of these problems, and identify the hardness of others.
متن کاملDistributions of Points and Large Convex Hulls of k Points
We consider a variant of Heilbronn’s triangle problem by asking for fixed integers d, k ≥ 2 and any integer n ≥ k for a distribution of n points in the d-dimensional unit cube [0, 1] such that the minimum volume of the convex hull of k points among these n points is as large as possible. We show that there exists a configuration of n points in [0, 1], such that, simultaneously for j = 2, . . . ...
متن کاملThe largest and the smallest fixed points of permutations
We give a new interpretation of the derangement numbers dn as the sum of the values of the largest fixed points of all non-derangements of length n− 1. We also show that the analogous sum for the smallest fixed points equals the number of permutations of length n with at least two fixed points. We provide analytic and bijective proofs of both results, as well as a new recurrence for the derange...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2008
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-008-9174-2