This paper presents a new sweep based algorithm for the cumulative constraint that combines filtering with a greedy mode. The algorithm has a worst case complexity of O(n log n) in the context of cumulative and O(n log n) in the context of bin-packing, where n is the number of tasks (items). It can handle up to 256000 tasks (items) in less than 15 minutes within a single cumulative constraint.

Liquid chromatography coupled to mass spectrometry (LC-MS) has become a major tool for the study of biological processes. High-throughput LC-MS experiments are frequently conducted in modern laboratories, generating an enormous amount of data per day. A manual inspection is therefore no longer a feasible task. Consequently, there is a need for computational tools that can rapidly provide inform...

We show how a recent collision detection method, which is based on the familiar sweep and prune concept, can gain improved performance for the special class of simulations that only involves axis-aligned bounding boxes of the same size. The proposed modifications lead to a worst-case optimal output-sensitive algorithm in 2D. Furthermore, the experimental result shows that our method gives gener...

In our earlier work, we have shown that visual constraint surfaces can be used t o effect visual guarded and visual compliant motions (which are analogous t o guarded and compliant motion using force control). Here we show how the backpro 'ection a proach to fine-motion plannin can be edended to e z p i i t visual constraints. Specij! cally, by deriving a con guration space rePTsentation of vis...

Tolerance graphs model interval relations in such a way that intervals can tolerate a certain amount of overlap without being in conflict. In one of the most natural generalizations of tolerance graphs with direct applications in the comparison of DNA sequences from different organisms, namely multitolerance graphs, two tolerances are allowed for each interval – one from the left and one from t...

We consider the problem of nding a corridor (a separating strip) between two polygons, whose intersection with a third (convex) polygon is of maximum area. The application in mind is the interpolation in simple branching cases, where the sought volume branches from one contour in one slice into two polygons in another parallel slice. We present a linear-time plane-sweep algorithm which computes...

We propose and solve the optimal-location query in spatial databases. Given a set S of sites, a set O of weighted objects, and a spatial region Q, the optimal-location query returns a location in Q with maximum influence. Here the influence of a location l is the total weight of its RNNs, i.e. the total weight of objects in O that are closer to l than to any site in S. This new query has practi...

Skeletons are powerful geometric abstractions that provide useful representations for a number of geometric operations. The straight skeleton has a lower combinatorial complexity compared with the medial axis. Moreover, while the medial axis of a polyhedron is composed of quadric surfaces the straight skeleton just consist of planar faces. Although there exist several methods to compute the str...

One-clock priced timed games is a class of two-player, zero-sum, continuous-time games that was defined and thoroughly studied in previous works. We show that one-clock priced timed games can be solved in time m12n, where n is the number of states and m is the number of actions. The best previously known time bound for solving one-clock priced timed games was 2 2+m), due to Rutkowski. For our i...

Several authors discuss how the simulated tempering scheme provides a very simple mechanism for introducing regenerations within a Markov chain. In this paper we explain how regenerative simulated tempering schemes provide a very natural mechanism for perfect simulation. We use this to provide a perfect simulation algorithm, which uses a single-sweep forward-simulation without the need for recu...