104 search results - page 9 / 21 » Witness (Delaunay) Graphs |
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
This paper shows how computational Riemannian manifold can be used to solve several problems in computer vision and graphics. Indeed, Voronoi segmentations and Delaunay graphs comp...
VL
1994
IEEE
13 years 12 months ago
1994
IEEE
Developers of new imageanalysis algorithmstypically require an interactive environment in which the imagedata can be passed through various operators, some of which may involve fe...
ESANN
2003
13 years 9 months ago
2003
We propose the use of the Gabriel graph for the exploratory analysis of potentially high dimensional labeled data. Gabriel graph is a subgraph of the Delaunay triangulation, which ...
COR
2008
13 years 8 months ago
2008
Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve eithe...
WG
2007
Springer
14 years 1 months ago
2007
Springer
Kelly-width is a parameter of directed graphs recently proposed by Hunter and Kreutzer as a directed analogue of treewidth. We give several alternative characterizations of direct...