Hybrid Booleans
| dc.contributor.author | Pavic, Darko | en_US |
| dc.contributor.author | Campen, Marcel | en_US |
| dc.contributor.author | Kobbelt, Leif | en_US |
| dc.date.accessioned | 2015-02-23T09:36:17Z | |
| dc.date.available | 2015-02-23T09:36:17Z | |
| dc.date.issued | 2010 | en_US |
| dc.description.abstract | In this paper, we present a novel method to compute Boolean operations on polygonal meshes. Given a Boolean expression over an arbitrary number of input meshes we reliably and efficiently compute an output mesh which faithfully preserves the existing sharp features and precisely reconstructs the new features appearing along the intersections of the input meshes. The term hybrid applies to our method in two ways: First, our algorithm operates on a hybrid data structure which stores the original input polygons (surface data) in an adaptively refined octree (volume data). By this we combine the robustness of volumetric techniques with the accuracy of surface-oriented techniques. Second, we generate a new triangulation only in a close vicinity around the intersections of the input meshes and thus preserve as much of the original mesh structure as possible (hybrid mesh). Since the actual processing of the Boolean operation is confined to a very small region around the intersections of the input meshes, we can achieve very high adaptive refinement resolutions and hence very high precision. We demonstrate our method on a number of challenging examples. | en_US |
| dc.description.number | 1 | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.description.volume | 29 | en_US |
| dc.identifier.doi | 10.1111/j.1467-8659.2009.01545.x | en_US |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.pages | 75-87 | en_US |
| dc.identifier.uri | https://doi.org/10.1111/j.1467-8659.2009.01545.x | en_US |
| dc.publisher | The Eurographics Association and Blackwell Publishing Ltd | en_US |
| dc.title | Hybrid Booleans | en_US |