Sciweavers

5019 search results - page 70 / 1004
» On the Reflexivity of Point Sets
Sort
View
CCCG
2001
15 years 7 months ago
Tight degree bounds for pseudo-triangulations of points
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...
CGF
2000
96views more  CGF 2000»
15 years 6 months ago
An interactive approach to point cloud triangulation
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 ...
Leif Kobbelt, Mario Botsch
HAID
2010
Springer
15 years 4 months ago
The Influence of Angle Size in Navigation Applications Using Pointing Gestures
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 ...
Charlotte Magnusson, Kirsten Rassmus-Gröhn, D...
JGO
2010
72views more  JGO 2010»
15 years 4 months ago
Strong convergence theorem by a hybrid extragradient-like approximation method for variational inequalities and fixed point prob
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...
TVCG
2010
141views more  TVCG 2010»
15 years 4 months ago
Fast Construction of k-Nearest Neighbor Graphs for Point Clouds
—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...
Michael Connor, Piyush Kumar