Sciweavers

IJIG
2002
117views more  IJIG 2002»
13 years 4 months ago
Eigenspaces for Graphs
In this paper, we investigate the feasibility of using graph-based descriptions to learn the view structure of 3D objects. The graphs used in our study are constructed from the De...
Bin Luo, Edwin R. Hancock, Richard C. Wilson
ESA
2007
Springer
155views Algorithms» more  ESA 2007»
13 years 8 months ago
Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step t...
Laurent Dupont, Michael Hemmer, Sylvain Petitjean,...
ICCD
2004
IEEE
115views Hardware» more  ICCD 2004»
14 years 1 months ago
ACG-Adjacent Constraint Graph for General Floorplans
ACG (Adjacent Constraint Graph) is invented as a general floorplan representation. It has advantages of both adjacency graph and constraint graph of a floorplan: edges in an ACG...
Hai Zhou, Jia Wang
CVPR
2004
IEEE
14 years 6 months ago
Multigrid and Multi-Level Swendsen-Wang Cuts for Hierarchic Graph Partition
Many vision tasks can be formulated as partitioning an adjacency graph through optimizing a Bayesian posterior probability p defined on the partition-space. In this paper two appr...
Adrian Barbu, Song Chun Zhu