the task of balancing of assembly lines is well-known in mass production system but this problem is np-hard even for the simple straight line. therefore, utilizing heuristic methods for these problems is totally unquestionable. furthermore, in line with balancing problems, heuristic methods are the foundation of the metaheuristic methods, thus it seems to be necessary to use more efficient heur...

The principal advantage of the use of Shopl'skii effect (low temperature spectrum) is that spectral sharpening occurs both in absorption and emission. However, thus far using the technique of capillary electrophoresis/low temperature fluorescence spectroscopy (CE/LTFS) either at 77 or 4.2 K remains difficult to obtain an on-line spectrum, if the analyte is present at low concentration. This pap...

We consider the Euclidean Voronoi diagram for a set of n parallel halflines in R. A relation of this diagram to planar power diagrams is shown, and is used to analyze its geometric and topological properties. Moreover, a simple plane-sweep algorithm is given that computes the Voronoi diagram for parallel halflines at logarithmic cost per face.

In this bachelor thesis we introduce the Squarability problem: When can a set of axisaligned rectangles be transformed into squares without changing combinatorial properties? This means, that we do not allow to change whether, how and in which order the rectangles respectively squares intersect. We use a sweep line algorithm to compute the combinatorial information from geometrically given rect...

In order to find all intersections among polygonal chains, this paper presents a procedure consisting of two phases: (1) splitting polygonal chains into a minimal number of monotone chains and (2) finding intersections among the monotone chains. For the first phase, we suggest an optimal algorithm splitting polygonal chains into a minimal number of monotone chains, with an Oðn þ r log rÞ time c...

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 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...