Parallel and efficient Boolean on polygonal solids
College of Physics & Electronic Information Engineering, Wenzhou University, Wenzhou, 325035, China
The Visual Computer, Vol. 27, No. 6-8, 2011, page(s): 507-517
@article{zhao2011parallel,
title={Parallel and efficient Boolean on polygonal solids},
author={Zhao, H. and Wang, C.C.L. and Chen, Y. and Jin, X.},
journal={The Visual Computer},
pages={1–11},
year={2011},
publisher={Springer}
}
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.
October 9, 2011 by hgpu
