Sciweavers

335 search results - page 2 / 67
» Volume Queries in Polyhedra
Sort
View
WSCG
2000
107views more  WSCG 2000»
13 years 8 months ago
Faster ASV Decomposition for Orthogonal Polyhedra, Using the Extreme Vertices Model (EVM)
The alternating sum of volumes (ASV) decomposition is a widely used technique for converting a b-rep into a CSG model, with all its implicit uses and advantages -like form feature...
Antonio Aguilera, Dolors Ayala
STOC
2003
ACM
153views Algorithms» more  STOC 2003»
14 years 7 months ago
Sublinear geometric algorithms
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
Bernard Chazelle, Ding Liu, Avner Magen
VISUALIZATION
1997
IEEE
13 years 11 months ago
The VSBUFFER: visibility ordering of unstructured volume primitives by polygon drawing
Different techniques have been proposed for rendering volumetric scalar data sets. Usually these approaches are focusing on orthogonal cartesian grids, but in the last years resea...
Rüdiger Westermann, Thomas Ertl
ICRA
2006
IEEE
90views Robotics» more  ICRA 2006»
14 years 1 months ago
A Performance Comparison of Three Algorithms for Proximity Queries Relative to Convex Polyhedra
— This paper presents a comparative analysis relative to the experimental performances of an asymptotically fast and incremental algorithm, recently developed to compute collisio...
Stefano Carpin, Claudio Mirolo, Enrico Pagello
ICRA
2007
IEEE
106views Robotics» more  ICRA 2007»
14 years 1 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