Sciweavers

3005 search results - page 180 / 601
» Computational geometry for sculpture
Sort
View
STOC
1999
ACM
176views Algorithms» more  STOC 1999»
15 years 11 months ago
On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
Johannes Blömer, Jean-Pierre Seifert
RT
1999
Springer
15 years 11 months ago
Computing Visibility for Triangulated Panoramas
A visibility algorithm for triangulated panoramas is proposed. The algorithm can correctly resolve the visibility without making use of any depth information. It is especially usef...
Chi-Wing Fu, Tien-Tsin Wong, Pheng-Ann Heng
SIGGRAPH
1990
ACM
15 years 10 months ago
Real-time robot motion planning using rasterizing computer graphics hardware
We presenta real-time robot motion plannerthatis fastandcomplete to a resolution. The technique is guaranteed to find a path if one exists at the resolution, and all paths returne...
Jed Lengyel, Mark Reichert, Bruce Randall Donald, ...
CCGRID
2007
IEEE
15 years 10 months ago
A Computer-Aided Diagnostic System using a Global Data Grid Repository for the Evaluation of Ultrasound Carotid Images
A computer-aided diagnostic (CAD) method of calculating lumen and wall thickness of carotid vessels is presented. The CAD is able to measure the geometry of the lumen and plaque s...
Marco Antonio Gutierrez, Silvia Helena Gelas Lage,...
VMV
2007
155views Visualization» more  VMV 2007»
15 years 7 months ago
Accurate Computation of Geodesic Distance Fields for Polygonal Curves on Triangle Meshes
We present an algorithm for the efficient and accurate computation of geodesic distance fields on triangle meshes. We generalize the algorithm originally proposed by Surazhsky e...
David Bommes, Leif Kobbelt