e for abstract modeling, algorithmic design and analysis to achieve provably efficient, scalable and fault-tolerant realizations of such huge, highly-dynamic, complex, non-conventi...
We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly inte...
Marc Benkert, Joachim Gudmundsson, Christian Knaue...
This paper describes an efficient method to compare two triangular meshes. Meshes considered here contain geometric features as well as other surface attributes such as material c...
Many safety-critical systems deal with geometric objects. Reasoning about the correctness of such systems is mandatory and requires the use of basic definitions of geometry for th...
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...