| dc.contributor.author | Adams, Bart | en_US |
| dc.contributor.author | Dutré, Philip | en_US |
| dc.contributor.editor | Markus Gross and Hanspeter Pfister and Marc Alexa and Szymon Rusinkiewicz | en_US |
| dc.date.accessioned | 2014-01-29T16:25:33Z | |
| dc.date.available | 2014-01-29T16:25:33Z | |
| dc.date.issued | 2004 | en_US |
| dc.identifier.isbn | 3-905673-09-6 | en_US |
| dc.identifier.issn | 1811-7813 | en_US |
| dc.identifier.uri | http://dx.doi.org/10.2312/SPBG/SPBG04/019-024 | en_US |
| dc.description.abstract | In this paper we present an algorithm to compute boolean operations on free-form solids bounded by surfels using programmable graphics hardware. The intersection, union and difference of two or more solids, is calculated on the GPU using vertex and fragment programs. First, we construct an inside-outside partitioning using 3-color grids and signed distance fields. Next, we use this partitioning to classify the surfels of both solids as inside or outside the other solid. For surfels close to the boundary of the other solid, we use the distance field and its gradient to define a clipping plane, which can be used to resample or clip the surfel. Our algorithm runs at interactive rates on consumer-level graphics hardware. | en_US |
| dc.publisher | The Eurographics Association | en_US |
| dc.subject | Categories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling | en_US |
| dc.title | Boolean Operations on Surfel-Bounded Solids Using Programmable Graphics Hardware | en_US |
| dc.description.seriesinformation | SPBG'04 Symposium on Point - Based Graphics 2004 | en_US |
