Sciweavers

2980 search results - page 160 / 596
» Computational Geometry
Sort
View
CGF
2008
153views more  CGF 2008»
15 years 6 months ago
Computing Local Signed Distance Fields for Large Polygonal Models
The signed distance field for a polygonal model is a useful representation that facilitates efficient computation in many visualization and geometric processing tasks. Often it is...
Byungjoon Chang, Deukhyun Cha, Insung Ihm
CAD
2011
Springer
15 years 1 months ago
Computing the minimum enclosing sphere of free-form hypersurfaces in arbitrary dimensions
The problem of computing the minimum enclosing sphere (MES) of a point set is a classical problem in Computational Geometry. As an LP-type problem, its expected running time on th...
Ramanathan Muthuganapathy, Gershon Elber, Gill Bar...
SMA
2008
ACM
154views Solid Modeling» more  SMA 2008»
15 years 6 months ago
Consistent computation of first- and second-order differential quantities for surface meshes
Differential quantities, including normals, curvatures, principal directions, and associated matrices, play a fundamental role in geometric processing and physics-based modeling. ...
Xiangmin Jiao, Hongyuan Zha

Lecture Notes
443views
17 years 4 months ago
Design and Analysis of Computer Algorithms
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
David M. Mount
PLDI
2006
ACM
16 years 14 days ago
An experimental analysis of self-adjusting computation
Dependence graphs and memoization can be used to efficiently update the output of a program as the input changes dynamically. Recent work has studied techniques for combining the...
Umut A. Acar, Guy E. Blelloch, Matthias Blume, Kan...