Sciweavers

1082 search results - page 130 / 217
» Approximation Algorithms for Spreading Points
Sort
View
CGF
2008
109views more  CGF 2008»
15 years 3 months ago
Occlusion Textures for Plausible Soft Shadows*
Authors' version: This paper presents a novel approach to obtain plausible soft shadows for complex dynamic scenes and a rectangular light source. We estimate the lights occl...
Elmar Eisemann, Xavier Décoret
DAM
2011
14 years 10 months ago
Optimization problems in multiple subtree graphs
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
Danny Hermelin, Dror Rawitz
134
Voted
ICCSA
2007
Springer
15 years 9 months ago
Shortest Path Queries Between Geometric Objects on Surfaces
Abstract. We consider geometric shortest path queries between arbitrary pairs of objects on a connected polyhedral surface P of genus g. The query objects are points, vertices, edg...
Hua Guo, Anil Maheshwari, Doron Nussbaum, Jör...
137
Voted
ICCS
2003
Springer
15 years 8 months ago
Monte Carlo Method for Calculating the Electrostatic Energy of a Molecule
The problem of computing the electrostatic energy of a large molecule is considered. It is reduced to solving the Poisson equation inside and the linear Poisson-Boltzmann equation ...
Michael Mascagni, Nikolai A. Simonov
CRV
2007
IEEE
101views Robotics» more  CRV 2007»
15 years 7 months ago
Energy Efficient Robot Rendezvous
We examine the problem of finding a single meeting location for a group of heterogeneous autonomous mobile robots, such that the total system cost of traveling to the rendezvous i...
Pawel Zebrowski, Yaroslav Litus, Richard T. Vaugha...