We describe algorithms to implement fully dynamic and kinetic three-dimensional unconstrained Delaunay triangulations, where the time evolution of the triangulation is not only go...
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
Joachim Gudmundsson, Thore Husfeldt, Christos Levc...
This paper presents a novel three-dimensional model-based tracking system which has been incorporated into a visual servoing system. The tracking system combines modern graphical ...
Let f C[-1, 1] change its convexity finitely many times, in the interval. We are interested in estimating the degree of approximation of f by polynomials which are coconvex with i...
We develop a widely applicable algorithm to solve the fault diagnosis problem in certain distributed-memory multiprocessor systems in which there are a limited number of faulty pr...