Sciweavers

450 search results - page 60 / 90
» Quadrangulations of Planar Sets
Sort
View
SMI
2006
IEEE
209views Image Analysis» more  SMI 2006»
14 years 3 months ago
Hardware Rendering of 3D Geometry with Elevation Maps
We present a generic framework for realtime rendering of 3D surfaces. We use the common elevation map primitive, by which a given surface is decomposed into a set of patches. Each...
Tilo Ochotta, Stefan Hiller
SWAT
2004
Springer
171views Algorithms» more  SWAT 2004»
14 years 2 months ago
Connectivity of Graphs Under Edge Flips
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...
Norbert Zeh
ICALP
2001
Springer
14 years 1 months ago
Approximation Algorithms for Partial Covering Problems
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
Rajiv Gandhi, Samir Khuller, Aravind Srinivasan
PAMI
2008
152views more  PAMI 2008»
13 years 9 months ago
Class-Based Feature Matching Across Unrestricted Transformations
We develop a novel method for class-based feature matching across large changes in viewing conditions. The method (called MBE) is based on the property that when objects share a si...
Evgeniy Bart, Shimon Ullman
DM
2011
223views Education» more  DM 2011»
13 years 4 months ago
On graph equivalences preserved under extensions
Let G be the set of finite graphs whose vertices belong to some fixed countable set, and let ≡ be an equivalence relation on G. By the strengthening of ≡ we mean an equivalen...
Zbigniew Lonc, Miroslaw Truszczynski