Sciweavers

2173 search results - page 320 / 435
» Building computer models from small pieces
Sort
View
COMPGEOM
2004
ACM
15 years 10 months ago
An empirical comparison of techniques for updating Delaunay triangulations
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
Leonidas J. Guibas, Daniel Russel
JGTOOLS
2008
189views more  JGTOOLS 2008»
15 years 4 months ago
Subtractive Shadows: A Flexible Framework for Shadow Level of Detail
Abstract. We explore the implications of reversing the process of shadow computation for real-time applications that model complex reflectance and lighting (such as that specified ...
Christopher DeCoro, Szymon Rusinkiewicz
SMA
2009
ACM
125views Solid Modeling» more  SMA 2009»
15 years 11 months ago
Stable mesh decimation
Current mesh reduction techniques, while numerous, all primarily reduce mesh size by successive element deletion (e.g. edge collapses) with the goal of geometric and topological f...
Chandrajit L. Bajaj, Andrew Gillette, Qin Zhang
GBRPR
2007
Springer
15 years 10 months ago
Approximating TSP Solution by MST Based Graph Pyramid
The traveling salesperson problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution of an input with a large number of c...
Yll Haxhimusa, Walter G. Kropatsch, Zygmunt Pizlo,...
SMA
2010
ACM
177views Solid Modeling» more  SMA 2010»
15 years 4 months ago
Multi-level grid algorithms for faster molecular energetics
Bio-molecules reach their stable configuration in solvent which is primarily water with a small concentration of salt ions. One approximation of the total free energy of a bio-mol...
Rezaul Alam Chowdhury, Chandrajit L. Bajaj