Sciweavers

969 search results - page 33 / 194
» A New Metric Between Polygons and How to Compute it
Sort
View
CVPR
2006
IEEE
14 years 10 months ago
The Bottleneck Geodesic: Computing Pixel Affinity
A meaningful affinity measure between pixels is essential for many computer vision and image processing applications. We propose an algorithm that works in the features' hist...
Ido Omer, Michael Werman
SIGGRAPH
1997
ACM
14 years 27 days ago
Interactive update of global illumination using a line-space hierarchy
Interactively manipulating the geometry of complex, globally illuminated scenes has to date proven an elusive goal. Previous attempts have failed to provide interactive updates of...
George Drettakis, François X. Sillion
VMV
2000
169views Visualization» more  VMV 2000»
13 years 10 months ago
A Non-Linear Subdivision Scheme for Triangle Meshes
Subdivision schemes are commonly used to obtain dense or smooth data representations from sparse discrete data. E. g., B-splines are smooth curves or surfaces that can be construc...
Stefan Karbacher, Stephan Seeger, Gerd Häusle...
SMA
2003
ACM
154views Solid Modeling» more  SMA 2003»
14 years 1 months ago
Discretization of functionally based heterogeneous objects
The presented approach to discretization of functionally defined heterogeneous objects is oriented towards applications associated with numerical simulation procedures, for exampl...
Elena Kartasheva, Valery Adzhiev, Alexander A. Pas...
DAC
2010
ACM
13 years 9 months ago
Detecting tangled logic structures in VLSI netlists
This work proposes a new problem of identifying large and tangled logic structures in a synthesized netlist. Large groups of cells that are highly interconnected to each other can...
Tanuj Jindal, Charles J. Alpert, Jiang Hu, Zhuo Li...