200 likes | 398 Views
9th International Fall Workshop VISION, MODELING, AND VISUALIZATION 2004 November 16 - 18, 2004 Stanford (California), USA. Poster Session 4. Geometry Processing. 9th International Fall Workshop VISION, MODELING, AND VISUALIZATION 2004 November 16 - 18, 2004 Stanford (California), USA.
E N D
9th International Fall Workshop VISION, MODELING, AND VISUALIZATION 2004 November 16 - 18, 2004Stanford (California), USA Poster Session 4 Geometry Processing
9th International Fall Workshop VISION, MODELING, AND VISUALIZATION 2004 November 16 - 18, 2004Stanford (California), USA Convexification of Unstructured Grids Stefan Röttger, Stefan Guthe University of Erlangen / Tübingen
Convexification of Unstructured Grids • Topic: depth sorting of tetrahedral grids • Fact: convex grids can be sorted easily • Contribution: we show a practical implementation of a convexification algorithm that transforms arbitrary concave grids into a convex representation • Result: high depth sorting performance • Additionally, we show pre-integrated tetrahedral lighting for the PT algorithm
9th International Fall Workshop VISION, MODELING, AND VISUALIZATION 2004 November 16 - 18, 2004Stanford (California), USA Hierarchical Shape-Adaptive Quantization for Geometry Compression Stefan Gumhold Max-Planck-Institut Informatik
Shape-Adaptive Coding • Quantization • vertex-vertex distance • Hausdorff bound • validity region • Rate Optimization • extensive search • hierarchical grid • Results • same decompression speed • save 3 bits per vertex
9th International Fall Workshop VISION, MODELING, AND VISUALIZATION 2004 November 16 - 18, 2004Stanford (California), USA Simplicial Isosurface Compression Thomas Lewiner1,2, Luiz Velho3, Hélio Lopes1 and Vinicius Mello3 1 PUC-Rio de Janeiro2 INRIA - Sophia Antipolis3 IMPA - Rio de Janeiro
Tools • Binary Multi-Triangulation • Adaptation • Prediction Regular Base Data Irregular Base Data
Features • Progressive compression • Distortion/Topology control • Better Rate/Distortion
9th International Fall Workshop VISION, MODELING, AND VISUALIZATION 2004 November 16 - 18, 2004Stanford (California), USA Hierarchy Accelerated Stochastic Collision Detection S. Kimmerle*, M. Nesme**, F. Faure** *WSI/GRIS University Tübingen, **GRAVIR INRIA Rhône-Alpes
Hierarchy Accelerated Stochastic Collision Detection Framework for collision and self-collision detection of deformable objects • Combines stochastic collision detection with a hierarchical bounding volume approach • BVH collision detection finds close areas • Within these areas close features are found by tracking randomly selected pairs of primitives • Time-coherence is employed • Trade-off between accuracy and computation time is possible
9th International Fall Workshop VISION, MODELING, AND VISUALIZATION 2004 November 16 - 18, 2004Stanford (California), USA Contact Handling for Deformable Point-Based Objects Richard Keiser¹, Matthias Müller¹, Bruno Heidelberger¹, Matthias Teschner², Markus Gross¹ ¹Computer Graphics Lab, ETH Zürich²Albert-Ludwigs-Universität Freiburg
Contact Handling for Deformable Point-Based Objects • Collision Detection • High resolution surface • Collision Response • Low resolution volume representation • Yielding Stable and Efficient Animations • Simple Computation of Contact Surface
9th International Fall Workshop VISION, MODELING, AND VISUALIZATION 2004 November 16 - 18, 2004Stanford (California), USA Real-time out-of-core trimmed NURBS rendering and editing M. Guthe, Á. Balázs, and R, Klein Institute of Computer Science IIUniversity of Bonn, Germany
Out-of-core support Fast preprocessing Real-time rendering Arbitrary precision High quality Interactive editing Out-of-core NURBS 24.25 fps ~1.1 million NURBS 34.92 fps 19.48 fps
9th International Fall Workshop VISION, MODELING, AND VISUALIZATION 2004 November 16 - 18, 2004Stanford (California), USA Hardware-accelerated ambient occlusion computation M.Sattler, R.Sarlette, G. Zachmann, R. Klein University of Bonn, Germanywww.cg.cs.uni-bonn.de
Hardware-accelerated ambient occlusion computation Problem • hard shadows insufficient for realistic appearance Goal • fast shadowing from natural illumination Idea • use occlusion queries for visibility determination Key features • no precomputation • arbitrary deforming geometry • HDR image based illumination • easy implementation
9th International Fall Workshop VISION, MODELING, AND VISUALIZATION 2004 November 16 - 18, 2004Stanford (California), USA Consistent Penetration Depth Estimation for Deformable Collision Response B. Heidelberger, M. Teschner, R. Keiser, M. Müller, M. Gross Computer Graphics LaboratoryETH Zurich, Switzerland
Consistent Penetration Depth Estimation for Deformable Collision Response Problem:Non-plausible collision response forces based on inconsistent penetration depth due to discrete simulation time steps and object discretization. Standard Approach:“Nearest Feature” Novel Approach:“Consistent Estimation”
9th International Fall Workshop VISION, MODELING, AND VISUALIZATION 2004 November 16 - 18, 2004Stanford (California), USA Efficient Iterative Solvers for Angle Based Flattening Rhaleb Zayer, Christian Rössl, Hans-Peter Seidel Max-Planck-Institut für Informatik
Efficient Iterative Solvers for ABF • Modified Uzawa • Modified Minres