Sciweavers

1604 search results - page 23 / 321
» Approximation algorithms for developable surfaces
Sort
View
COMPGEOM
2003
ACM
15 years 4 months ago
Restricted delaunay triangulations and normal cycle
We address the problem of curvature estimation from sampled smooth surfaces. Building upon the theory of normal cycles, we derive a definition of the curvature tensor for polyhed...
David Cohen-Steiner, Jean-Marie Morvan
JIB
2006
102views more  JIB 2006»
14 years 11 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
WADS
2009
Springer
317views Algorithms» more  WADS 2009»
15 years 6 months ago
Shortest Path Problems on a Polyhedral Surface
We develop algorithms to compute edge sequences, Voronoi diagrams, shortest path maps, the Fréchet distance, and the diameter for a polyhedral surface. Distances on the surface a...
Atlas F. Cook, Carola Wenk
TVCG
2008
148views more  TVCG 2008»
14 years 11 months ago
Globally Optimal Surface Mapping for Surfaces with Arbitrary Topology
Computing smooth and optimal one-to-one maps between surfaces of same topology is a fundamental problem in graphics and such a method provides us a ubiquitous tool for geometric mo...
Xin Li, Yunfan Bao, Xiaohu Guo, Miao Jin, Xianfeng...
99
Voted
COMPGEOM
2007
ACM
15 years 3 months ago
Medial axis approximation from inner Voronoi balls: a demo of the Mesecina tool
We illustrate a simple algorithm for approximating the medial axis of a 2D shape with smooth boundary from a sample of this boundary. The algorithm is compared to a more general a...
Balint Miklos, Joachim Giesen, Mark Pauly