Sciweavers

676 search results - page 63 / 136
» More Efficient Object Serialization
Sort
View
ICRA
2007
IEEE
155views Robotics» more  ICRA 2007»
16 years 28 days ago
Swept Volume approximation of polygon soups
— We present a fast GPU-based algorithm to approximate the Swept Volume (SV) boundary of arbitrary polygon soup models. Despite the extensive research on calculating the volume s...
Jesse C. Himmelstein, Etienne Ferre, Jean-Paul Lau...
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
15 years 10 months ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre
VLDB
1995
ACM
103views Database» more  VLDB 1995»
15 years 10 months ago
Querying Shapes of Histories
We present a shape definition language, called SDC, for retrieving objects based on shapes contained in the histories associated with these objects. It is a small, yet powerful, l...
Rakesh Agrawal, Giuseppe Psaila, Edward L. Wimmers...
WSCG
2004
152views more  WSCG 2004»
15 years 8 months ago
Detection of Collisions and Self-collisions Using Image-space Techniques
Image-space techniques have shown to be very efficient for collision detection in dynamic simulation and animation environments. This paper proposes a new image-space technique for...
Bruno Heidelberger, Matthias Teschner, Markus H. G...
CORR
2010
Springer
80views Education» more  CORR 2010»
15 years 6 months ago
Many-to-Many Graph Matching: a Continuous Relaxation Approach
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...