Sciweavers

174 search results - page 22 / 35
» Graph based topological analysis of tessellated surfaces
Sort
View
CGA
2000
13 years 7 months ago
Metamorphosis of Arbitrary Triangular Meshes
Recently, animations with deforming objects have been frequently used in various computer graphics applications. Metamorphosis (or morphing) of three-dimensional objects is one of...
Takashi Kanai, Hiromasa Suzuki, Fumihiko Kimura
STACS
2007
Springer
14 years 1 months ago
New Approximation Algorithms for Minimum Cycle Bases of Graphs
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
14 years 22 hour ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz
ISVC
2009
Springer
14 years 2 months ago
Wavelet-Based Representation of Biological Shapes
Modeling, characterization and analysis of biological shapes and forms are important in many computational biology studies. Shape representation challenges span the spectrum from s...
Bin Dong, Yu Mao, Ivo D. Dinov, Zhuowen Tu, Yongga...
CORR
2011
Springer
188views Education» more  CORR 2011»
13 years 2 months ago
Towards Unbiased BFS Sampling
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...
Maciej Kurant, Athina Markopoulou, Patrick Thiran