Results 1  10
of
1,988
Geometric Clusterings
, 1990
"... A kclustering of a given set of points in the plane is a partition of the points into k subsets ("clusters"). For any fixed k, we can find a kclustering which minimizes any monotone function of the diameters or the radii of the clusters in polynomial time. The algorithm is based on the f ..."
Abstract

Cited by 29 (1 self)
 Add to MetaCart
A kclustering of a given set of points in the plane is a partition of the points into k subsets ("clusters"). For any fixed k, we can find a kclustering which minimizes any monotone function of the diameters or the radii of the clusters in polynomial time. The algorithm is based
Universal geometric cluster algebras
, 2012
"... We consider, for each exchange matrix B, a category of geometric cluster algebras over B and coefficient specializations between the cluster algebras. The category also depends on an underlying ring R, usually Z, Q, or R. We broaden the definition of geometric cluster algebras slightly over the us ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
We consider, for each exchange matrix B, a category of geometric cluster algebras over B and coefficient specializations between the cluster algebras. The category also depends on an underlying ring R, usually Z, Q, or R. We broaden the definition of geometric cluster algebras slightly over
Geometric Clustering of Multimedia Databases
"... Many kinds of texts are now available in various types of databases, and it has been requested to develop new methods to fully utilize them in a wide range of applications. In the field of information retrieval of full text databases, the vectorspace model has been developed over 20 years (Salton e ..."
Abstract
 Add to MetaCart
) in the abovementioned existing research, propose using geometric clustering algorithms for...
SOME GEOMETRIC CLUSTERING PROBLEMS
 NORDIC JOURNAL OF COMPUTING 1(1994), 246–263
, 1994
"... This paper investigates the computational complexity of several clustering problems with special objective functions for point sets in the Euclidean plane. Our strongest negative result is that clustering a set of 3k points in the plane into k triangles with minimum total circumference is NPhard. ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
This paper investigates the computational complexity of several clustering problems with special objective functions for point sets in the Euclidean plane. Our strongest negative result is that clustering a set of 3k points in the plane into k triangles with minimum total circumference is NP
Geometric Cluster Algorithm for Interacting Fluids
, 2005
"... Abstract. We discuss a new Monte Carlo algorithm for the simulation of complex fluids. This algorithm employs geometric operations to identify clusters of particles that can be moved in a rejectionfree way. It is demonstrated that this geometric cluster algorithm (GCA) constitutes the continuum gen ..."
Abstract
 Add to MetaCart
Abstract. We discuss a new Monte Carlo algorithm for the simulation of complex fluids. This algorithm employs geometric operations to identify clusters of particles that can be moved in a rejectionfree way. It is demonstrated that this geometric cluster algorithm (GCA) constitutes the continuum
Geometric Clustering for Line Drawing Simplification
 In Proceedings of the Eurographics Symposium on Rendering
, 2005
"... Figure 1: Lines of the initial drawing (left) are first automatically clustered into groups that can be merged at a scale ε (middle). A new line is then generated for each group in an applicationdependent style (at right, line thickness indicates the mean thickness of the cluster). 1 ..."
Abstract

Cited by 30 (3 self)
 Add to MetaCart
Figure 1: Lines of the initial drawing (left) are first automatically clustered into groups that can be merged at a scale ε (middle). A new line is then generated for each group in an applicationdependent style (at right, line thickness indicates the mean thickness of the cluster). 1
Universal geometric cluster algebras from surfaces
 Trans. Amer. Math. Soc
"... Abstract. A universal geometric cluster algebra over an exchange matrix B is a universal object in the category of geometric cluster algebras over B related by coefficient specializations. (Following an earlier paper on universal geometric cluster algebras, we broaden the definition of geometric cl ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract. A universal geometric cluster algebra over an exchange matrix B is a universal object in the category of geometric cluster algebras over B related by coefficient specializations. (Following an earlier paper on universal geometric cluster algebras, we broaden the definition of geometric
Geometric clustering for line drawing simplification
"... Figure 1: The two stages of our method. Lines of the initial drawing (left) are first automatically clustered into groups that can be merged at a scale ε (each group is assigned a unique color). A new line is then generated for each group in an applicationdependent style (at right, line thickness in ..."
Abstract
 Add to MetaCart
Figure 1: The two stages of our method. Lines of the initial drawing (left) are first automatically clustered into groups that can be merged at a scale ε (each group is assigned a unique color). A new line is then generated for each group in an applicationdependent style (at right, line thickness
Geometric Clustering for Line Drawing Simplication
, 2011
"... HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte p ..."
Abstract
 Add to MetaCart
HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et a ̀ la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.
Laplacian eigenmaps and spectral techniques for embedding and clustering.
 Proceeding of Neural Information Processing Systems,
, 2001
"... Abstract Drawing on the correspondence between the graph Laplacian, the LaplaceBeltrami op erator on a manifold , and the connections to the heat equation , we propose a geometrically motivated algorithm for constructing a representation for data sampled from a low dimensional manifold embedded in ..."
Abstract

Cited by 668 (7 self)
 Add to MetaCart
Abstract Drawing on the correspondence between the graph Laplacian, the LaplaceBeltrami op erator on a manifold , and the connections to the heat equation , we propose a geometrically motivated algorithm for constructing a representation for data sampled from a low dimensional manifold embedded
Results 1  10
of
1,988