1648 search results - page 78 / 330 » Computing swept volumes |
90
Voted
GRAPHICSINTERFACE
2000
15 years 4 months ago
2000
We present a method to incrementally voxelize triangles into a volumetric dataset with pre-filtering, generating an accurate multivalued voxelization. Multivalued voxelization all...
108
click to vote
SIGGRAPH
1989
ACM
15 years 7 months ago
1989
ACM
This paper will examine hypertexture rendering techniques and will demonstrate how volume data sets may be adapted in order for hypertexture to be applied. Details are given of a c...
135
Voted
CCCG
1998
15 years 4 months ago
1998
Given a set P of n points in Rd, a fundamental problem in computational geometry is concerned with finding the smallest shape of some type that encloses all the points of P. Well-...
146
Voted
VMV
2003
15 years 4 months ago
2003
We present a new algorithm for the computation of volumetric intersections of geometrically complex objects, which can be used for the efficient detection of collisions. Our appr...
127
click to vote
DAM
2007
15 years 3 months ago
2007
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...