32-Issue 7

Permanent URI for this collection

https://diglib.eg.org/handle/10.2312/185

Browse

Browsing 32-Issue 7 by Subject "Computer Graphics"

Now showing 1 - 2 of 2
  • No Thumbnail Available
    Item
    Constrainable Multigrid for Cloth
    (The Eurographics Association and Blackwell Publishing Ltd., 2013) Jeon, Inyong; Choi, Kwang-Jin; Kim, Tae-Yong; Choi, Bong-Ouk; Ko, Hyeong-Seok; B. Levy, X. Tong, and K. Yin
    We present a new technique which can handle both point and sliding constraints in the multigrid (MG) framework. Although the MG method can theoretically perform as fast as O(N), the development of a clothing simulator based on the MG method calls for solving an important technical challenge: handling the constraints. Resolving constrains has been difficult in MG because there has been no clear way to transfer the constraints existing in the finest level mesh to the coarser level meshes. This paper presents a new formulation based on soft constraints, which can coarsen the constraints defined in the finest level to the coarser levels. Experiments are performed which show that the proposed method can solve the linear system up to 4-9 times faster in comparison with the modified preconditioned conjugate gradient method (MPCG) without quality degradation. The proposed method is easy to implement and can be straightforwardly applied to existing clothing simulators which are based on implicit time integration.
  • No Thumbnail Available
    Item
    The POP Buffer: Rapid Progressive Clustering by Geometry Quantization
    (The Eurographics Association and Blackwell Publishing Ltd., 2013) Limper, Max; Jung, Yvonne; Behr, Johannes; Alexa, Marc; B. Levy, X. Tong, and K. Yin
    Within this paper, we present a novel, straightforward progressive encoding scheme for general triangle soups, which is particularly well-suited for mobile and Web-based environments due to its minimal requirements on the client's hardware and software. Our rapid encoding method uses a hierarchy of quantization to effectively reorder the original primitive data into several nested levels of detail. The resulting stateless buffer can progressively be transferred as-is to the GPU, where clustering is efficiently performed in parallel during rendering. We combine our approach with a crack-free mesh partitioning scheme to obtain a straightforward method for fast streaming and basic view-dependent LOD control.