G1 Hierarchical Bezier Surface over Arbitrary Meshes

Simple item page
dc.contributor.authorBercovier, M.en_US
dc.contributor.authorVolpin, O.en_US
dc.date.accessioned2015-02-16T06:59:12Z
dc.date.available2015-02-16T06:59:12Z
dc.date.issued1999en_US
dc.description.abstractThis paper presents a method for constructing composite surfaces based on a collection of quadrilateral patches. A global parameterization using bilinear quadrilateral meshes and FEM like minimization procedure are introduced. Smoothing conditions such as C1 and G1 are handled by constraint equation and a related duality argument is implemented. The surfaces that can be constructed in this way include conforming and non-conforming connections (3 n 6, T-nodes) between elementary patches. Non-manifold surfaces are automatically treated also by this data structure. The underlying quadratic programming with linear constraints is solved by duality methods. Hierarchical data structure with bordering matrices methods are implemented to deal with local refinement (subdivision). The present work details the actual implementation for the case of Bezier patches.en_US
dc.description.number4en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume18en_US
dc.identifier.doi10.1111/1467-8659.00376en_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages223-236en_US
dc.identifier.urihttps://doi.org/10.1111/1467-8659.00376en_US
dc.publisherBlackwell Publishers Ltd and the Eurographics Associationen_US
dc.titleG1 Hierarchical Bezier Surface over Arbitrary Meshesen_US
Files
Collections
Issue 4