108 search results - page 2 / 22 » On Computing the Centroid of the Vertices of an Arrangement ... |
CVPR
2010
IEEE
13 years 11 months ago
2010
IEEE
In this paper, we propose a new transductive learning framework for image retrieval, in which images are taken as vertices in a weighted hypergraph and the task of image search is...
ESA
2007
Springer
13 years 11 months ago
2007
Springer
We review recent progress in the study of arrangements in computational and combinatorial geometry, and discuss several open problems and areas for further research. In this talk I...
GD
2007
Springer
13 years 11 months ago
2007
Springer
In John Tantalo’s on-line game Planarity the player is given a non-plane straight-line drawing of a planar graph. The aim is to make the drawing plane as quickly as possible by m...
CVGIP
2002
13 years 5 months ago
2002
The dual of a 2-manifold polygonal mesh without boundary is commonly defined as another mesh with the same topology (genus) but different connectivity (vertex-face incidence), in ...
MST
2010
13 years 1 days ago
2010
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...