We show that every set of n points in general position has a minimum pseudo-triangulation whose maximum vertex degree is five. In addition, we demonstrate that every point set in ...
Lutz Kettner, David G. Kirkpatrick, Bettina Speckm...
We present an interactive system for the generation of high quality triangle meshes that allows us to handle hybrid geometry (point clouds, polygons, ...) as input data. In order ...
One factor which can be expected to influence performance in applications where the user points a device in some direction to obtain information is the angle interval in which the ...
The purpose of this paper is to investigate the problem of finding a common element of the set of fixed points F(S) of a nonexpansive mapping S and the set of solutions ΩA of t...
Lu-Chuan Ceng, Nicolas Hadjisavvas, Ngai-Ching Won...
—We present a parallel algorithm for k-nearest neighbor graph construction that uses Morton ordering. Experiments show that our approach has the following advantages over existin...