|
|||||
|
|
Parallel and efficient Boolean on polygonal solids |
|
| Authors: | Hanli Zhao Charlie C. L. Wang Yong Chen Xiaogang Jin |
| Affiliation: | 1. College of Physics & Electronic Information Engineering, Wenzhou University, Wenzhou, 325035, China 2. Department of Mechanical and Automation Engineering, The Chinese University of Hong Kong, Hong Kong, China 3. Epstein Department of Industrial and Systems Engineering, University of Southern California, Los Angeles, CA, USA 4. State Key Lab of CAD & CG, Zhejiang University, Hangzhou, 310058, China |
| 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. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |