Boolean Operations on Surfel-Bounded Solids Using Programmable Graphics Hardware

Simple item page
dc.contributor.authorAdams, Barten_US
dc.contributor.authorDutré, Philipen_US
dc.contributor.editorMarkus Gross and Hanspeter Pfister and Marc Alexa and Szymon Rusinkiewiczen_US
dc.date.accessioned2014-01-29T16:25:33Z
dc.date.available2014-01-29T16:25:33Z
dc.date.issued2004en_US
dc.description.abstractIn 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.description.seriesinformationSPBG'04 Symposium on Point - Based Graphics 2004en_US
dc.identifier.isbn3-905673-09-6en_US
dc.identifier.issn1811-7813en_US
dc.identifier.urihttps://doi.org/10.2312/SPBG/SPBG04/019-024en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectCategories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: Computational Geometry and Object Modelingen_US
dc.titleBoolean Operations on Surfel-Bounded Solids Using Programmable Graphics Hardwareen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
019-024.pdf
Size:
1.14 MB
Format:
Adobe Portable Document Format
Download
Collections
Symposium on Point Based Graphics 04