Scheduling two irregular polygons
نویسندگان
چکیده
منابع مشابه
Generalized Barycentric Coordinates on Irregular Polygons
In this paper we present an easy computation of a generalized form of barycentric coordinates for irregular, convex n-sided polygons. Triangular barycentric coordinates have had many classical applications in computer graphics, from texture mapping to ray-tracing. Our new equations preserve many of the familiar properties of the triangular barycentric coordinates with an equally simple calculat...
متن کاملIrregular Redistribution Scheduling by Partitioning Messages
Dynamic data redistribution enhances data locality and improves algorithm performance for numerous scientific problems on distributed memory multi-computers systems. Regular data distribution typically employs BLOCK, CYCLIC, or BLOCK-CYCLIC(c) to specify array decomposition. Conversely, an irregular distribution specifies an uneven array distribution based on user-defined functions. Performing ...
متن کاملEuclidean TSP on two polygons
We give an O(nm+ nm +m logm) time and O(n +m) space algorithm for finding the shortest traveling salesman tour through the vertices of two simple polygonal obstacles in the Euclidean plane, where n and m are the number of vertices of the two polygons.
متن کاملRotational Placement of Irregular Polygons over Containers with Fixed Dimensions using Simulated Annealing and No-Fit Polygons
This work deals with the problem of minimizing the waste of space that occurs on a rotational placement of a set of irregular bi-dimensional small items inside a bidimensional large object. This problem is approached with an heuristic based on simulated annealing. Traditional “external penalization” techniques are avoided through the application of the no-fit polygon, that determinates the coll...
متن کاملOptimizing a Strip Separating Two Polygons
We consider the problem of nding a strip separating between two polygons, whose intersection with a third (convex) polygon is of maximum area. We present an optimal linear-time algorithm for computing the optimum strip. When the third polygon is not convex, the running time of the algorithm is quadratic in the size of the input. The application in mind is the piecewise-linear surface interpolat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1988
ISSN: 0166-218X
DOI: 10.1016/0166-218x(88)90056-x