Sciweavers

1604 search results - page 110 / 321
» Approximation algorithms for developable surfaces
Sort
View
101
Voted
GRAPHICSINTERFACE
2007
15 years 3 months ago
Constrained planar remeshing for architecture
Material limitations and fabrication costs generally run at odds with the creativity of architectural design, producing a wealth of challenging computational geometry problems. We...
Barbara Cutler, Emily Whiting
IJON
2007
88views more  IJON 2007»
15 years 1 months ago
Self-organisation can generate the discontinuities in the somatosensory map
The primary somatosensory cortex contains a topographic map of the body surface, with two notable discontinuities — the representation of the face is next to that of the hands, ...
Tom Stafford, Stuart P. Wilson

Publication
338views
15 years 12 months ago
Shape from Shading with a Generalized Reflectance Map Model
Most conventional SFS (shape from shading) algorithms have been developed under three basic assumptions on surface properties and imaging geometry to simplify the problem, namely, ...
Kyoung Mu Lee (Seoul National University), C.-C. J...
128
Voted
FOCS
2009
IEEE
15 years 8 months ago
Symmetry and Approximability of Submodular Maximization Problems
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
Jan Vondrák
SWAT
2010
Springer
242views Algorithms» more  SWAT 2010»
14 years 12 months ago
Minimizing the Diameter of a Network Using Shortcut Edges
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...
Erik D. Demaine, Morteza Zadimoghaddam