In this paper we describe and discuss a new kernel design for geometric computation in the plane. It combines different kinds of floating-point filter techniques and a lazy eval...
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
We wish to extract the topology from scanned maps. In previous work [15] this was done by extracting a skeleton from the Voronoi diagram, but this required vertex labelling and wa...
In many applications one is concerned with the approximation of functions from a finite set of scattered data sites with associated function values. We describe a scheme for cons...
Though the service of shared virtual worlds is an active area of research, little effort has been made to optimize such systems for urban world spaces. Tracking the motion, action...