Sciweavers

39 search results - page 4 / 8
» On minimally 3-connected graphs on a surface
Sort
View
APPROX
2010
Springer
176views Algorithms» more  APPROX 2010»
13 years 9 months ago
Approximation Algorithms for Min-Max Generalization Problems
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...
Piotr Berman, Sofya Raskhodnikova

Publication
400views
15 years 2 months ago
Enforcing Integrability by Error Correction using L1-minimization
Surface reconstruction from gradient fields is an important final step in several applications involving gradient manipulations and estimation. Typically, the resulting gradient ...
Dikpal Reddy, Amit K. Agrawal, Rama Chellappa
CVPR
2003
IEEE
14 years 9 months ago
Surfaces with Occlusions from Layered Stereo
Although steady progress has been made in recent stereo algorithms, producing accurate results in the neighborhood of depth discontinuities remains a challenge. Moreover, among th...
Michael H. Lin, Carlo Tomasi
APVIS
2006
13 years 9 months ago
Visualizing multivariate network on the surface of a sphere
A multivariate network is a graph whose nodes contain multi-dimensional attributes. We propose a method to visualize such a network using spherical Self-Organizing Map (SOM) and c...
Yingxin Wu, Masahiro Takatsuka
GRAPHICSINTERFACE
2000
13 years 9 months ago
Anisotropic Feature-Preserving Denoising of Height Fields and Bivariate Data
In this paper, we present an efficient way to denoise bivariate data like height fields, color pictures or vector fields, while preserving edges and other features. Mixing surface...
Mathieu Desbrun, Mark Meyer, Peter Schröder, ...