We study the following variant of the well-known line-simplification problem: we are getting a possibly infinite sequence of points p0, p1, p2, . . . in the plane defining a polyg...
Mohammad Ali Abam, Mark de Berg, Peter Hachenberge...
—This paper describes a new approach to matching geometric structure in 2D point-sets. The novel feature is to unify the tasks of estimating transformation geometry and identifyi...
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
MSTK is a powerful framework for low-level creation and manipulation of unstructured meshes. MSTK is not a mesh generator but it can be used to develop advanced mesh generation so...
We consider the problem of scheduling on parallel uniformly related machines, where preemptions are allowed and the machines are controlled by selfish agents. Our goal is to minimi...