Sciweavers

3025 search results - page 234 / 605
» Computational geometry: a retrospective
Sort
View
CGF
2011
15 years 1 months ago
A Parallel SPH Implementation on Multi-Core CPUs
This paper presents a parallel framework for simulating fluids with the Smoothed Particle Hydrodynamics (SPH) method. For low computational costs per simulation step, efficient ...
Markus Ihmsen, Nadir Akinci, Markus Becker, Matthi...
CGF
2011
14 years 10 months ago
Walking On Broken Mesh: Defect-Tolerant Geodesic Distances and Parameterizations
Efficient methods to compute intrinsic distances and geodesic paths have been presented for various types of surface representations, most importantly polygon meshes. These meshe...
Marcel Campen, Leif Kobbelt
ECCV
2008
Springer
16 years 8 months ago
Non-local Regularization of Inverse Problems
This article proposes a new framework to regularize linear inverse problems using the total variation on non-local graphs. This nonlocal graph allows to adapt the penalization to t...
Gabriel Peyré, Laurent D. Cohen, Séb...
ACMACE
2005
ACM
16 years 6 days ago
D4MD: deformation system for a vehicle simulation game
This paper presents a hybrid geometrical-physical, plastic deformation technique applicable for solids, in the context of a car simulation game. This technique doesn’t aim to be...
Tiago Rodrigues, Rui Pires, José Miguel Sal...
153
Voted
ESA
2001
Springer
97views Algorithms» more  ESA 2001»
15 years 11 months ago
Splitting a Delaunay Triangulation in Linear Time
Computing the Delaunay triangulation of n points requires usually a minimum of (n log n) operations, but in some special cases where some additional knowledge is provided, faster a...
Bernard Chazelle, Olivier Devillers, Ferran Hurtad...