Sciweavers

2601 search results - page 83 / 521
» A Point in Many Triangles
Sort
View
VISUALIZATION
1996
IEEE
14 years 2 months ago
Real-time Slicing of Data Space
This can be a costly operation. When the data is arranged according to its three-dimensional coordinates, calculating the contour surfaces requires examining each data cell. Avoidi...
Roger Crawfis
WG
2010
Springer
13 years 8 months ago
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse,...
EUSFLAT
2007
147views Fuzzy Logic» more  EUSFLAT 2007»
13 years 11 months ago
Logical Aggregation Based on Interpolative Realization of Boolean Algebra
In this paper, aggregation is treated as a logical and/or pseudo-logical operation what is important from many points of view such as adequacy and interpretations.
Dragan G. Radojevic
SDM
2012
SIAM
452views Data Mining» more  SDM 2012»
12 years 16 days ago
Density-based Projected Clustering over High Dimensional Data Streams
Clustering of high dimensional data streams is an important problem in many application domains, a prominent example being network monitoring. Several approaches have been lately ...
Irene Ntoutsi, Arthur Zimek, Themis Palpanas, Peer...
3DIM
2003
IEEE
14 years 3 months ago
Geometrically Stable Sampling for the ICP Algorithm
The Iterative Closest Point (ICP) algorithm is a widely used method for aligning three-dimensional point sets. The quality of alignment obtained by this algorithm depends heavily ...
Natasha Gelfand, Szymon Rusinkiewicz, Leslie Ikemo...