Fair Surface Reconstruction Using Quadratic Functionals

Simple item page
dc.contributor.authorKolb, Andreasen_US
dc.contributor.authorPottmann, Helmuten_US
dc.contributor.authorSeidel, Hans-Peteren_US
dc.date.accessioned2014-10-21T07:37:53Z
dc.date.available2014-10-21T07:37:53Z
dc.date.issued1995en_US
dc.description.abstractAn algorithm for surface reconstruction from a polyhedron with arbitrary topology consisting of triangular faces is presented. The first variant of the algorithm constructs a curve network consisting of cubic Bezier curves meeting with tangent plane continuity at the vertices. This curve network is extended to a smooth surface by replacing each of the networks facets with a split patch consisting of three triangular Bezier patches. The remaining degrees of freedom of the curve network and the split patches are determined by minimizing a quadratic functional. This optimization process works either for the curve network and the split patches separately or in one simultaneous step. The second variant of our algorithm is based on the construction of an optimized curve network with higher continuity. Examples demonstrate the quality of the different methods.en_US
dc.description.number3en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume14en_US
dc.identifier.doi10.1111/j.1467-8659.1995.cgf143-0469.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages469-479en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.1995.cgf143-0469.xen_US
dc.publisherBlackwell Science Ltd and the Eurographics Associationen_US
dc.titleFair Surface Reconstruction Using Quadratic Functionalsen_US
Files
Collections
Issue 3
EG 1995 Conference Proceedings