Sciweavers

1145 search results - page 72 / 229
» Spatial Computing: The TOTA Approach
Sort
View
138
Voted
ICRA
2007
IEEE
106views Robotics» more  ICRA 2007»
15 years 9 months ago
Exploring Different Coherence Dimensions to Answer Proximity Queries for Convex Polyhedra
— Different coherence dimensions can be considered to improve the performances of an algorithm for computing collision translations of pairs of convex polyhedra. The algorithm’...
Claudio Mirolo, Stefano Carpin, Enrico Pagello
139
Voted
CGF
2006
136views more  CGF 2006»
15 years 3 months ago
Cache-Efficient Layouts of Bounding Volume Hierarchies
We present a novel algorithm to compute cache-efficient layouts of bounding volume hierarchies (BVHs) of polygonal models. Our approach does not make any assumptions about the cac...
Sung-Eui Yoon, Dinesh Manocha
101
Voted
VC
2010
134views more  VC 2010»
15 years 1 months ago
Detail-driven digital hologram generation
Abstract Digital holography is a technology with a potential to provide realistic 3D images. However, generation of digital holograms is a computationally demanding task. Thus, the...
Ivo Hanák, Martin Janda, Václav Skal...
SIAMSC
2008
108views more  SIAMSC 2008»
15 years 3 months ago
Automated Code Generation for Discontinuous Galerkin Methods
A compiler approach for generating low-level computer code from high-level input for discontinuous Galerkin finite element forms is presented. The input language mirrors convention...
Kristian B. Ølgaard, Anders Logg, Garth N. ...
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
15 years 10 months ago
Redistricting Using Heuristic-Based Polygonal Clustering
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...
Deepti Joshi, Leen-Kiat Soh, Ashok Samal