Parallel and efficient Boolean on polygonal solids
Hanli Zhao, Charlie C. L. Wang, Yong Chen, Xiaogang Jin
In The Visual Computer, 27(6-8), June 2011.
Abstract: We present a novel framework which can efficiently evaluate approximate Boolean set operations for B-rep models by highly parallel algorithms. This is achieved by taking axis-aligned surfels of Layered Depth Images (LDI) as a bridge and performing Boolean operations on the structured points. As compared with prior surfel-based approaches, this paper has much improvement. Firstly, we adopt key-data pairs to store LDI more compactly. Secondly, robust depth peeling is investigated to overcome the bottleneck of layer-complexity. Thirdly, an out-of-core tiling technique is presented to overcome the limitation of memory. Real-time feedback is provided by streaming the proposed pipeline on the many-core graphics hardware.
@article{Zhao:2011:PAE,
author = {Hanli Zhao and Charlie C. L. Wang and Yong Chen and Xiaogang Jin},
title = {Parallel and efficient Boolean on polygonal solids},
journal = {The Visual Computer},
volume = {27},
number = {6-8},
pages = {507--517},
month = jun,
year = {2011},
}
Return to the search page.
graphbib: Powered by "bibsql" and "SQLite3."