Sciweavers

3025 search results - page 151 / 605
» Computational geometry: a retrospective
Sort
View
CGF
2007
135views more  CGF 2007»
15 years 6 months ago
Variational 3D Shape Segmentation for Bounding Volume Computation
We propose a variational approach to computing an optimal segmentation of a 3D shape for computing a union of tight bounding volumes. Based on an affine invariant measure of e-ti...
Lin Lu, Yi-King Choi, Wenping Wang, Myung-Soo Kim
CIE
2005
Springer
16 years 1 days ago
Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees
The strong weak truth table reducibility was suggested by Downey, Hirschfeldt, and LaForte as a measure of relative randomness, alternative to the Solovay reducibility. It also occ...
George Barmpalias
CCCG
2009
15 years 7 months ago
Defining and computing accessibility radius
In structural molecular biology software, the accessibility of an atom in a molecule to a ball representing solvent is either computed slowly by building a solventaccessible surfa...
Vishal Verma, Jack Snoeyink
EUROPAR
2003
Springer
15 years 11 months ago
Two Dimensional Airfoil Optimisation Using CFD in a Grid Computing Environment
In this paper, a two-dimensional airfoil shape optimisation problem is investigated using CFD within a grid computing environment (GCE) implemented in Matlab. The feature-based par...
Wenbin Song, Andy J. Keane, M. Hakki Eres, Graeme ...
SI3D
1995
ACM
15 years 10 months ago
Shadow Volume BSP Trees for Computation of Shadows in Dynamic Scenes
This paper presents an algorithm for shadow calculation in dynamic polyhedral scenes illuminated by point light sources. It is based on a modi cation of Shadow Volume Binary Space...
Yiorgos Chrysanthou, Mel Slater