If you are seeing this message, you may be experiencing temporary network problems. Please wait a few minutes and refresh the page. If the problem persists, you may wish to report it to your local Network Manager.
It is also possible that your web browser is not configured or not able to display style sheets. In this case, although the visual presentation will be degraded, the site should continue to be functional. We recommend using the latest version of Microsoft or Mozilla web browser to help minimise these problems.
Wiley InterScience | |||||||||||||
![]() Computer Graphics ForumVolume 21 Issue 2, Pages 121 - 134 Published Online: 9 Aug 2002 Journal compilation © 2009 The Eurographics Association and Blackwell Publishing
Abstract | References | Full Text: HTML, PDF (Size: 484K) | Related Articles | Citation Tracking Multiresolution Surfaces having Arbitrary Topologies by a Reverse Doo Subdivision Method Copyright Blackwell Publishers Ltd., 2002 KEYWORDS Multiresolution • Doo subdivision • Surfaces • B-splines • Data fitting ABSTRACTWe have shown how to construct multiresolution structures for reversing subdivision rules using global least squares models (Samavati and Bartels, Computer Graphics Forum, 18(2):97–119, June 1999). As a result, semiorthogonal wavelet systems have also been generated. To construct a multiresolution surface of an arbitrary topology, however, biorthogonal wavelets are needed. In Bartels and Samavati (Journal of Computational and Applied Mathematics, 119:29–67, 2000) we introduced local least squares models for reversing subdivision rules to construct multiresolution curves and tensor product surfaces, noticing that the resulting wavelets were biorthogonal (under an induced inner product). Here, we construct multiresolution surfaces of arbitrary topologies by locally reversing the Doo subdivision scheme. In a Doo subdivision, a coarse surface is converted into a fine one by the contraction of coarse faces and the addition of new adjoining faces. We propose a novel reversing process to convert a fine surface into a coarse one plus an error. The conversion has the property that the subdivision of the resulting coarse surface is locally closest to the original fine surface, in the least squares sense, for two important face geometries. In this process, we first find those faces of the fine surface which might have been produced by the contraction of a coarse face in a Doo subdivision scheme. Then, we expand these faces. Since the expanded faces are not necessarily joined properly, several candidates are usually at hand for a single vertex of the coarse surface. To identify the set of candidates corresponding to a vertex, we construct a graph in such a way that any set of candidates corresponds to a connected component. The connected components can easily be identified by a depth first search traversal of the graph. Finally, vertices of the coarse surface are set to be the average of their corresponding candidates, and this is shown to be equivalent to local least squares approximation for regular arrangements of triangular and quadrilateral faces. |
|
| |||||||||||
![]() | Expert Systems |