View : 216 Download: 0

Rapid pairwise intersection tests using programmable GPUs

Title
Rapid pairwise intersection tests using programmable GPUs
Authors
Choi Y.-J.Kim Y.J.Kim M.-H.
Ewha Authors
김명희김영준
SCOPUS Author ID
김명희scopus; 김영준scopus
Issue Date
2006
Journal Title
Visual Computer
ISSN
0178-2789JCR Link
Citation
Visual Computer vol. 22, no. 2, pp. 80 - 89
Indexed
SCIE; SCOPUS WOS scopus
Document Type
Conference Paper
Abstract
Detecting self-intersections within a triangular mesh model is fundamentally a quadratic problem in terms of its computational complexity, since in principle all triangles must be compared with all others. We reflect the 2D nature of this process by storing the triangles as multiple 1D textures in texture memory, and then exploit the massive parallelism of graphics processing units (GPUs) to perform pairwise comparisons, using a pixel shader. This approach avoids the creation and maintenance of auxiliary geometric structures, such as a bounding volume hierarchy (BVH); but nevertheless we can plug in auxiliary culling schemes, and use stencils to indicate triangle pairs that do not need to be compared. To overcome the readback bottleneck between GPU and CPU, we use a hierarchical encoding scheme. We have applied our technique to detecting self-intersections in extensively deformed models, and we achieve an order of magnitude increase in performance over CPU-based techniques such as [17].
Show the fulltext
DOI
10.1007/s00371-006-0368-9
Appears in Collections:
엘텍공과대학 > 컴퓨터공학과 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE