Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
We consider the problem of placing a small number of angle guards inside a simple polygon P so as to provide efficient proofs that any given point is inside P. Each angle guard vi...
David Eppstein, Michael T. Goodrich, Nodari Sitchi...
Abstract. We develop a general approach that uses holomorphic 1forms to parameterize anatomical surfaces with complex (possibly branching) topology. Rather than evolve the surface ...
Yalin Wang, Xianfeng Gu, Kiralee M. Hayashi, Tony ...
Moving objects databases (MOD) have been receiving increasing attention from the database community in recent years, mainly due to the wide variety of applications that technology...
The complexity and detail of geometric scenes that are used in today’s computer animated films and interactive games have reached a level where the manual creation by tradition...