Sciweavers

1321 search results - page 50 / 265
» Quadratic forms on graphs
Sort
View
WSCG
2001
89views more  WSCG 2001»
13 years 11 months ago
Searching Triangle Strips Guided by Simplification Criterion
Triangle strips are widely used as a method to accelerate the visualisation process of polygon models in interactive graphics applications. Another widely used method to improve d...
Oscar Belmonte, José Ribelles, Inmaculada R...
CGF
2007
97views more  CGF 2007»
13 years 10 months ago
Volume Preservation of Multiresolution Meshes
Geometric constraints have proved to be efficient for enhancing the realism of shape animation. The present paper addresses the computation and the preservation of the volume enc...
Basile Sauvage, Stefanie Hahmann, Georges-Pierre B...
SAC
2004
ACM
14 years 3 months ago
Frequent free tree discovery in graph data
In recent years, researchers in graph mining have been exploring linear paths as well as subgraphs as pattern languages. In this paper, we are investigating the middle ground betw...
Ulrich Rückert, Stefan Kramer
CVPR
2009
IEEE
15 years 5 months ago
Minimizing Sparse Higher Order Energy Functions of Discrete Variables
Higher order energy functions have the ability to encode high level structural dependencies between pixels, which have been shown to be extremely powerful for image labeling pro...
Carsten Rother (Microsoft Research Cambridge), Pus...
WEA
2010
Springer
330views Algorithms» more  WEA 2010»
14 years 4 months ago
Exact Bipartite Crossing Minimization under Tree Constraints
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
Frank Baumann, Christoph Buchheim, Frauke Liers