Sciweavers

39 search results - page 3 / 8
» On minimally 3-connected graphs on a surface
Sort
View
CVPR
2012
IEEE
11 years 8 months ago
Curvature-based regularization for surface approximation
We propose an energy-based framework for approximating surfaces from a cloud of point measurements corrupted by noise and outliers. Our energy assigns a tangent plane to each (noi...
Carl Olsson, Yuri Boykov
STOC
1991
ACM
105views Algorithms» more  STOC 1991»
13 years 9 months ago
An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden Subgraphs
act We give an algorithm for imbedding a graph G of n vertices onto an oriented surface of minimal genus g. If g > 0 then we also construct a forbidden subgraph of G which is ho...
Hristo Djidjev, John H. Reif
JIB
2006
102views more  JIB 2006»
13 years 5 months ago
3D image and graph based Computation of Protein Surface
The accessible surface of a macromolecule is a significant determinant of its action. The interaction between biomolecules or protein-ligand is dependent on their surfaces rather ...
A. Ranganath, K. C. Shet, N. Vidyavathi
FOCS
2005
IEEE
13 years 11 months ago
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful structural theorem capturing the structure of graphs excluding a fixed minor. This result is ...
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ic...
SMI
2006
IEEE
121views Image Analysis» more  SMI 2006»
13 years 11 months ago
Minimum Ratio Contours on Surface Meshes
We present a novel approach for discretely optimizing contours on the surface of a triangle mesh. This is achieved through the use of a minimum ratio cycle (MRC) algorithm, where ...
Andrew Clements, Hao Zhang 0002