We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
The ultimate aim of many live-cell fluorescence microscopy imaging experiments is the quantitative analysis of the spatial structure and temporal behavior of intracellular object...
Oleh Dzyubachyk, Wiggert A. van Cappellen, Jeroen ...
In this paper we propose a new method that addresses the problem of tracking the bitmap (silhouette) of an object in a video under very general conditions. We assume a general tar...
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
We exhibit a small problem kernel for the one-sided crossing minimization problem. This problem plays an important role in graph drawing algorithms based on the Sugiyama layering ...