Hardware-assisted natural neighbor interpolation

Quanfu Fan, Alon Efrat, Vladlen Koltun, Shankar Krishnan, Suresh Venkatasubramanian

Research output: Chapter in Book/Report/Conference proceedingConference contribution

21 Citations (Scopus)

Abstract

Natural neighbor interpolation is a weighted average interpolation method that is based on Voronoi tessellation. In this paper, we present and implement an algorithm for performing natural neighbor interpolation using graphics hardware. Unlike traditional software-based approaches that process one query at a time, we develop a scheme that computes the entire scalar field induced by natural neighbor interpolation, at which point a query is a trivial array lookup, arid range queries over the field are easy to perform. Our approach is faster than the best known software implementations and makes use of general purpose stream programming capabilities of current graphics cards. We also present a simple scheme that requires no advanced graphics capabilities and can process natural neighbor queries faster than existing software-based approaches. Finally, recognizing the limitation incurred by the bounded size of graphics frame buffers, we propose a sub-division approach that allows performing queries locally in a subdivision of the input domain. This approach can reduce to a negligibly small degree (< 1%) the loss of precision caused by the naive scaling method while still processing queries faster than the software-based approaches when the number of sites is large.

Original languageEnglish (US)
Title of host publicationProceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics
EditorsC. Demetrescu, R. Sedgewick, R. Tamassia
Pages111-120
Number of pages10
StatePublished - 2005
EventSeventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics - Vancouver, BC, Canada
Duration: Jan 22 2005Jan 22 2005

Other

OtherSeventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics
CountryCanada
CityVancouver, BC
Period1/22/051/22/05

Fingerprint

Computer hardware
Interpolation
Query processing

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Fan, Q., Efrat, A., Koltun, V., Krishnan, S., & Venkatasubramanian, S. (2005). Hardware-assisted natural neighbor interpolation. In C. Demetrescu, R. Sedgewick, & R. Tamassia (Eds.), Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics (pp. 111-120)

Hardware-assisted natural neighbor interpolation. / Fan, Quanfu; Efrat, Alon; Koltun, Vladlen; Krishnan, Shankar; Venkatasubramanian, Suresh.

Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics. ed. / C. Demetrescu; R. Sedgewick; R. Tamassia. 2005. p. 111-120.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Fan, Q, Efrat, A, Koltun, V, Krishnan, S & Venkatasubramanian, S 2005, Hardware-assisted natural neighbor interpolation. in C Demetrescu, R Sedgewick & R Tamassia (eds), Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics. pp. 111-120, Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics, Vancouver, BC, Canada, 1/22/05.
Fan Q, Efrat A, Koltun V, Krishnan S, Venkatasubramanian S. Hardware-assisted natural neighbor interpolation. In Demetrescu C, Sedgewick R, Tamassia R, editors, Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics. 2005. p. 111-120
Fan, Quanfu ; Efrat, Alon ; Koltun, Vladlen ; Krishnan, Shankar ; Venkatasubramanian, Suresh. / Hardware-assisted natural neighbor interpolation. Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics. editor / C. Demetrescu ; R. Sedgewick ; R. Tamassia. 2005. pp. 111-120
@inproceedings{8ac4b67713944ea7bf602112b0eab6d6,
title = "Hardware-assisted natural neighbor interpolation",
abstract = "Natural neighbor interpolation is a weighted average interpolation method that is based on Voronoi tessellation. In this paper, we present and implement an algorithm for performing natural neighbor interpolation using graphics hardware. Unlike traditional software-based approaches that process one query at a time, we develop a scheme that computes the entire scalar field induced by natural neighbor interpolation, at which point a query is a trivial array lookup, arid range queries over the field are easy to perform. Our approach is faster than the best known software implementations and makes use of general purpose stream programming capabilities of current graphics cards. We also present a simple scheme that requires no advanced graphics capabilities and can process natural neighbor queries faster than existing software-based approaches. Finally, recognizing the limitation incurred by the bounded size of graphics frame buffers, we propose a sub-division approach that allows performing queries locally in a subdivision of the input domain. This approach can reduce to a negligibly small degree (< 1{\%}) the loss of precision caused by the naive scaling method while still processing queries faster than the software-based approaches when the number of sites is large.",
author = "Quanfu Fan and Alon Efrat and Vladlen Koltun and Shankar Krishnan and Suresh Venkatasubramanian",
year = "2005",
language = "English (US)",
isbn = "0898715962",
pages = "111--120",
editor = "C. Demetrescu and R. Sedgewick and R. Tamassia",
booktitle = "Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics",

}

TY - GEN

T1 - Hardware-assisted natural neighbor interpolation

AU - Fan, Quanfu

AU - Efrat, Alon

AU - Koltun, Vladlen

AU - Krishnan, Shankar

AU - Venkatasubramanian, Suresh

PY - 2005

Y1 - 2005

N2 - Natural neighbor interpolation is a weighted average interpolation method that is based on Voronoi tessellation. In this paper, we present and implement an algorithm for performing natural neighbor interpolation using graphics hardware. Unlike traditional software-based approaches that process one query at a time, we develop a scheme that computes the entire scalar field induced by natural neighbor interpolation, at which point a query is a trivial array lookup, arid range queries over the field are easy to perform. Our approach is faster than the best known software implementations and makes use of general purpose stream programming capabilities of current graphics cards. We also present a simple scheme that requires no advanced graphics capabilities and can process natural neighbor queries faster than existing software-based approaches. Finally, recognizing the limitation incurred by the bounded size of graphics frame buffers, we propose a sub-division approach that allows performing queries locally in a subdivision of the input domain. This approach can reduce to a negligibly small degree (< 1%) the loss of precision caused by the naive scaling method while still processing queries faster than the software-based approaches when the number of sites is large.

AB - Natural neighbor interpolation is a weighted average interpolation method that is based on Voronoi tessellation. In this paper, we present and implement an algorithm for performing natural neighbor interpolation using graphics hardware. Unlike traditional software-based approaches that process one query at a time, we develop a scheme that computes the entire scalar field induced by natural neighbor interpolation, at which point a query is a trivial array lookup, arid range queries over the field are easy to perform. Our approach is faster than the best known software implementations and makes use of general purpose stream programming capabilities of current graphics cards. We also present a simple scheme that requires no advanced graphics capabilities and can process natural neighbor queries faster than existing software-based approaches. Finally, recognizing the limitation incurred by the bounded size of graphics frame buffers, we propose a sub-division approach that allows performing queries locally in a subdivision of the input domain. This approach can reduce to a negligibly small degree (< 1%) the loss of precision caused by the naive scaling method while still processing queries faster than the software-based approaches when the number of sites is large.

UR - http://www.scopus.com/inward/record.url?scp=32144460834&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=32144460834&partnerID=8YFLogxK

M3 - Conference contribution

SN - 0898715962

SN - 9780898715965

SP - 111

EP - 120

BT - Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics

A2 - Demetrescu, C.

A2 - Sedgewick, R.

A2 - Tamassia, R.

ER -