Sciweavers

330 search results - page 15 / 66
» Isosurfacing in higher dimensions
Sort
View
COCOON
2007
Springer
13 years 11 months ago
An Improved Algorithm for Online Unit Clustering
Abstract. We revisit the online unit clustering problem in one dimension which we recently introduced at WAOA'06: given a sequence of n points on the line, the objective is to...
Hamid Zarrabi-Zadeh, Timothy M. Chan
CMA
2011
13 years 2 months ago
Detecting critical regions in multidimensional data sets
We propose a new approach, based on the Conley index theory, for the detection and classification of critical regions in multidimensional data sets. The use of homology groups ma...
Madjid Allili, David Corriveau, Sara Deriviè...
SWAT
2010
Springer
282views Algorithms» more  SWAT 2010»
14 years 21 days ago
Better Bounds on Online Unit Clustering
Unit Clustering is the problem of dividing a set of points from a metric space into a minimal number of subsets such that the points in each subset are enclosable by a unit ball. W...
Martin R. Ehmsen, Kim S. Larsen
VISUALIZATION
2002
IEEE
14 years 17 days ago
Computing Singularities of 3D Vector Fields with Geometric Algebra
Critical points of a vector field are key to their characterization. Not only their positions but also their indexes are crucial for understanding vector fields. Considerable wo...
Stephen Mann, Alyn P. Rockwood
STACS
2012
Springer
12 years 3 months ago
Linear-Space Data Structures for Range Mode Query in Arrays
A mode of a multiset S is an element a ∈ S of maximum multiplicity; that is, a occurs at least as frequently as any other element in S. Given an array A[1 : n] of n elements, we...
Timothy M. Chan, Stephane Durocher, Kasper Green L...