Skip to Main content Skip to Navigation
Conference papers

A Hardware Processing Unit for Point Sets

Abstract : We present a hardware architecture and processing unit for point sampled data. Our design is focused on fundamental and computationally expensive operations on point sets including k-nearest neighbors search, moving least squares approximation, and others. Our architecture includes a configurable processing module allowing users to implement custom operators and to run them directly on the chip. A key component of our design is the spatial search unit based on a kd-tree performing both kNN and eN searches. It utilizes stack recursions and features a novel advanced caching mechanism allowing direct reuse of previously computed neighborhoods for spatially coherent queries. In our FPGA prototype, both modules are multi-threaded, exploit full hardware parallelism, and utilize a fixed-function data path and control logic for maximum throughput and minimum chip surface. A detailed analysis demonstrates the performance and versatility of our design.
Document type :
Conference papers
Complete list of metadata
Contributor : Gaël Guennebaud Connect in order to contact the contributor
Submitted on : Wednesday, January 21, 2009 - 4:20:53 PM
Last modification on : Thursday, May 27, 2021 - 1:54:05 PM


  • HAL Id : inria-00354990, version 1


Simon Heinzle, Gael Guennebaud, Mario Botsch, Markus Gross. A Hardware Processing Unit for Point Sets. Graphics Hardware 2008, Jun 2008, Sarajevo, Bosnia and Herzegovina. pp.21-31. ⟨inria-00354990⟩



Record views