Sciweavers

18155 search results - page 81 / 3631
» Point
Sort
View
SODA
2004
ACM
111views Algorithms» more  SODA 2004»
15 years 3 months ago
Almost-Delaunay simplices: nearest neighbor relations for imprecise points
Delaunay tessellations and Voronoi diagrams capture proximity relationships among sets of points in any dimension. When point coordinates are not known exactly, as in the case of ...
Deepak Bandyopadhyay, Jack Snoeyink
INTERACT
2003
15 years 3 months ago
Pointing in Intelligent Environments with the WorldCursor
: We introduce the WorldCursor, a pointing device and cursor designed for intelligent environments. The WorldCursor is analogous to the mouse and cursor used in traditional GUIs: t...
Andrew Wilson, Hubert Pham
BMVC
2000
15 years 3 months ago
A New Approach for Vanishing Point Detection in Architectural Environments
A man-made environment is characterized by a lot of parallel lines and a lot of orthogonal edges. In this article, a new method for detecting the three mutual orthogonal direction...
Carsten Rother
VMV
2003
170views Visualization» more  VMV 2003»
15 years 3 months ago
Performance Analysis of Nearest Neighbor Algorithms for ICP Registration of 3-D Point Sets
There are many nearest neighbor algorithms tailormade for ICP, but most of them require special input data like range images or triangle meshes. We focus on efficient nearest nei...
Timo Zinßer, Jochen Schmidt, Heinrich Nieman...
CCCG
1993
15 years 2 months ago
Maintaining the Approximate Width of a Set of Points in the Plane
d abstract) Gunter Rotey Christian Schwarzz Jack Snoeyinkx The width of a set of n points in the plane is the smallest distance between two parallel lines that enclose the set. W...
Günter Rote, Christian Schwarz, Jack Snoeyink