Parallel and efficient Boolean on polygonal solids

Authors:
Hanli Zhao;Charlie C. L. Wang;Yong Chen;Xiaogang Jin
Affiliations:
Wenzhou University, College of Physics & Electronic Information Engineering, 325035, Wenzhou, China;The Chinese University of Hong Kong, Department of Mechanical and Automation Engineering, Hong Kong, China;University of Southern California, Epstein Department of Industrial and Systems Engineering, Los Angeles, CA, USA;Zhejiang University, State Key Lab of CAD & CG, 310058, Hangzhou, China
Venue:
The Visual Computer: International Journal of Computer Graphics - CGI'2011 Conference
Year:
2011

Citing 0
Cited 3

Direct rendering of Boolean combinations of self-trimmed surfaces

Computer-Aided Design
GPU-based offset surface computation using point samples

Computer-Aided Design
Fast and accurate evaluation of regularized Boolean operations on triangulated solids

Computer-Aided Design

Quantified Score

Hi-index	0.00

Visualization

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.