In many computer graphics and computer-aided design problems, it is very common to find a smooth and well structured surface to fit a set of unstructured 3-dimensional data. Altho...
We consider the problem of implementing nger search trees on the pointer machine, i.e., how to maintain a sorted list such that searching for an element x, starting the search at ...
Location-based services are increasingly popular and it is a key challenge to efficiently support query processing. We present a novel design to process large numbers of location...
A common operation in many geometry processing algorithms consists of finding correspondences between pairs of shapes by finding structure-preserving maps between them. A particul...
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz