Sciweavers

525 search results - page 46 / 105
» Bidimensionality and geometric graphs
Sort
View
EVOW
2006
Springer
14 years 15 days ago
A Multiagent Algorithm for Graph Partitioning
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...
Francesc Comellas, Emili Sapena
CW
2002
IEEE
14 years 1 months ago
Topological Morphing Using Reeb Graphs
Metamorphosis between 3D objects is often the transformation between a pair of shapes that have the same topology. This paper presents a new model using Reeb graphs and their cont...
Pizzanu Kanonchayos, Tomoyuki Nishita, Yoshihisa S...
AEI
2008
108views more  AEI 2008»
13 years 9 months ago
Combinatorial synthesis approach employing graph networks
The paper proposes a methodology to assist the designer at the initial stages of the design synthesis process by enabling him/her to employ knowledge and algorithms existing in gr...
Offer Shai, Noel Titus, Karthik Ramani
ACCV
2009
Springer
14 years 3 months ago
Skeleton Graph Matching Based on Critical Points Using Path Similarity
This paper proposes a novel graph matching algorithm based on skeletons and applies it to shape recognition based on object silhouettes. The main idea is to match the critical poin...
Yao Xu, Bo Wang, Wenyu Liu, Xiang Bai
COMPGEOM
2010
ACM
14 years 1 months ago
Constructing Reeb graphs using cylinder maps
The Reeb graph of a scalar function represents the evolution of the topology of its level sets. In this video, we describe a near-optimal output-sensitive algorithm for computing ...
Harish Doraiswamy, Aneesh Sood, Vijay Natarajan