Sciweavers

102291 search results - page 415 / 20459
» Computability in Computational Geometry
Sort
View
194
Voted
VISUALIZATION
2005
IEEE
16 years 13 days ago
Visual Analysis and Exploration of Fluid Flow in a Cooling Jacket
We present a visual analysis and exploration of fluid flow through a cooling jacket. Engineers invest a large amount of time and serious effort to optimize the flow through thi...
Robert S. Laramee, Christoph Garth, Helmut Doleisc...
SI3D
2005
ACM
16 years 13 days ago
Automatic impostor placement for guaranteed frame rates and low memory requirements
Impostors are image-based primitives commonly used to replace complex geometry in order to reduce the rendering time needed for displaying complex scenes. However, a big problem i...
Stefan Jeschke, Michael Wimmer, Heidrun Schumann, ...
192
Voted
SI3D
2003
ACM
16 years 3 days ago
Interactive navigation in complex environments using path planning
We present a novel approach for interactive navigation in complex 3D synthetic environments using path planning. Our algorithm precomputes a global roadmap of the environment by u...
Brian Salomon, Maxim Garber, Ming C. Lin, Dinesh M...
206
Voted
COMPGEOM
2010
ACM
15 years 12 months ago
Approximating loops in a shortest homology basis from point data
Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering application...
Tamal K. Dey, Jian Sun, Yusu Wang
STACS
2001
Springer
15 years 11 months ago
Approximation Algorithms for the Bottleneck Stretch Factor Problem
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
Giri Narasimhan, Michiel H. M. Smid
« Prev « First page 415 / 20459 Last » Next »