Sciweavers

63 search results - page 4 / 13
» Graph Voronoi Regions for Interfacing Planar Graphs
Sort
View
GD
2005
Springer
14 years 2 months ago
C-Planarity of Extrovert Clustered Graphs
A clustered graph has its vertices grouped into clusters in a hierarchical way via subset inclusion, thereby imposing a tree structure on the clustering relationship. The c-planari...
Michael T. Goodrich, George S. Lueker, Jonathan Z....
CHI
2009
ACM
14 years 9 months ago
Graph sketcher: extending illustration to quantitative graphs
Scientists, engineers, and educators commonly need to make graphs that quickly illustrate quantitative ideas yet are not based on specific data sets. We call these graphs quantita...
Robin Stewart, m. c. schraefel
GBRPR
2009
Springer
14 years 3 months ago
Texture Segmentation by Contractive Decomposition and Planar Grouping
Abstract. Image segmentation has long been an important problem in the computer vision community. In our recent work we have addressed the problem of texture segmentation, where we...
Anders Bjorholm Dahl, Peter Bogunovich, Ali Shokou...
ICIP
2002
IEEE
14 years 10 months ago
On the non-optimality of four color coding of image partitions
Recent interest in region based image coding has given rise to graph coloring based partition encoding methods. These methods are based on the four color theorem for planar graphs...
Sameer Agarwal, Serge Belongie
WADS
1993
Springer
163views Algorithms» more  WADS 1993»
14 years 18 days ago
Minimum Weight Euclidean Matching and Weighted Relative Neighborhood Graphs
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...
Andy Mirzaian