منابع مشابه
Separability of Imprecise Points
An imprecise point is a point p with an associated imprecision region Ip indicating the set of possible locations of the point p. We study separability problems for a set R of red imprecise points and a set B of blue imprecise points in R, where the imprecision regions are axis-aligned rectangles and each point p ∈ R∪B is drawn uniformly at random from Ip. Our results include algorithms for fin...
متن کاملExistence of Simple Tours of Imprecise Points
Assume that an ordered set of imprecise points is given, where each point is specified by a region in which the point may lie. This set determines an imprecise polygon. We show that it is NP-complete to decide whether it is possible to place the points inside their regions in such a way that the resulting polygon is simple. Furthermore, it is NP-hard to minimize the length of a simple tour visi...
متن کاملThe Possible Hull of Imprecise Points
We pose the problem of constructing the possible hull of a set of n imprecise points: the union of convex hulls of all sets of n points, where each point is constrained to lie within a particular region of the plane. We give an optimal algorithm for the case when n = 2, and the regions are a point and a simple (possibly nonconvex) polygon. We then describe how the algorithm leads to an optimal ...
متن کامل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...
متن کاملPreprocessing Imprecise Points and Splitting Triangulations
Traditional algorithms in computational geometry assume that the input points are given precisely. In practice, data is usually imprecise, but information about the imprecision is often available. In this context, we investigate what the value of this information is. We show here how to preprocess a set of disjoint regions in the plane of total complexity n in O(n logn) time so that if one poin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2017
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2016.10.001