Memory Access Patterns of Occlusion-Compatible 3D Image Warping

dc.contributor.authorMurk, William R.en_US
dc.contributor.authorBishop, Garyen_US
dc.contributor.editorA. Kaufmann and W. Strasser and S. Molnar and B.-O. Schneideren_US
dc.date.accessioned2014-02-06T14:56:59Z
dc.date.available2014-02-06T14:56:59Z
dc.date.issued1997en_US
dc.description.abstractMcMillan and Bishop s 3D image warp can be efficiently implemented by exploiting the coherency of its memory accesses. We analyze this coherency, and present algorithms that take advantage of it. These algorithms traverse the reference image in an occlusion-compatible order, which is an order that can resolve visibility using a painter s algorithm. Required cache sizes are calculated for several one-pass 3D warp algorithms, and we develop a two-pass algorithm which requires a smaller cache size than any of the practical one-pass algorithms. We also show that reference image traversal orders that are occlusion-compatible for continuous images are not always occlusion-compatible when applied to the discrete images used in practice.en_US
dc.description.seriesinformationSIGGRAPH/Eurographics Workshop on Graphics Hardwareen_US
dc.identifier.isbn0-89791-961-0en_US
dc.identifier.issn1727-3471en_US
dc.identifier.urihttps://doi.org/10.2312/EGGH/EGGH97/035-043en_US
dc.publisherThe Eurographics Associationen_US
dc.subject1.3.3 [Computer Graphics]en_US
dc.subjectPicture/Image Generationen_US
dc.subjectDisplay Algorithmsen_US
dc.subject1.3.7 [Computer Graphics]en_US
dc.subjectThree Dimensional Graphics and Realismen_US
dc.subjectVisible lincfsurface algorithmsen_US
dc.subject1.3.1 [Computer Graphics]en_US
dc.subjectHardware Architectureen_US
dc.subjectGraphics processorsen_US
dc.titleMemory Access Patterns of Occlusion-Compatible 3D Image Warpingen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
035-043.pdf
Size:
1.16 MB
Format:
Adobe Portable Document Format