9th International Fall Workshop VISION, MODELING, AND VISUALIZATION 2004 November , 2004 Stanford (California), USA Poster Session 4 Geometry Processing

Stefan Röttger, Stefan Guthe 9th International Fall Workshop VISION, MODELING, AND VISUALIZATION 2004 November , 2004 Stanford (California), USA Convexification of Unstructured Grids 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

Stefan Gumhold 9th International Fall Workshop VISION, MODELING, AND VISUALIZATION 2004 November , 2004 Stanford (California), USA Hierarchical Shape-Adaptive Quantization for Geometry Compression 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

Thomas Lewiner 1,2, Luiz Velho 3, Hélio Lopes 1 and Vinicius Mello 3 9th International Fall Workshop VISION, MODELING, AND VISUALIZATION 2004 November , 2004 Stanford (California), USA Simplicial Isosurface Compression 1 PUC-Rio de Janeiro 2 INRIA - Sophia Antipolis 3 IMPA - Rio de Janeiro

Tools Binary Multi-Triangulation Irregular Base Data Prediction Adaptation Adaptation Regular Base Data

Features Progressive compressionProgressive compression Distortion/Topology controlDistortion/Topology control Better Rate/DistortionBetter Rate/Distortion

S. Kimmerle*, M. Nesme**, F. Faure** 9th International Fall Workshop VISION, MODELING, AND VISUALIZATION 2004 November , 2004 Stanford (California), USA Hierarchy Accelerated Stochastic Collision Detection *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

Richard Keiser¹, Matthias Müller¹, Bruno Heidelberger¹, Matthias Teschner², Markus Gross¹ 9th International Fall Workshop VISION, MODELING, AND VISUALIZATION 2004 November , 2004 Stanford (California), USA Contact Handling for Deformable Point-Based Objects ¹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

M. Guthe, Á. Balázs, and R, Klein 9th International Fall Workshop VISION, MODELING, AND VISUALIZATION 2004 November , 2004 Stanford (California), USA Real-time out-of-core trimmed NURBS rendering and editing Institute of Computer Science II University of Bonn, Germany

Out-of-core NURBS Out-of-core support Fast preprocessing Real-time rendering Arbitrary precision High quality Interactive editing fps ~1.1 million NURBS fps fps

M.Sattler, R.Sarlette, G. Zachmann, R. Klein 9th International Fall Workshop VISION, MODELING, AND VISUALIZATION 2004 November , 2004 Stanford (California), USA Hardware-accelerated ambient occlusion computation University of Bonn, Germany

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

B. Heidelberger, M. Teschner, R. Keiser, M. Müller, M. Gross 9th International Fall Workshop VISION, MODELING, AND VISUALIZATION 2004 November , 2004 Stanford (California), USA Consistent Penetration Depth Estimation for Deformable Collision Response Computer Graphics Laboratory ETH 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”

Rhaleb Zayer, Christian Rössl, Hans-Peter Seidel 9th International Fall Workshop VISION, MODELING, AND VISUALIZATION 2004 November , 2004 Stanford (California), USA Efficient Iterative Solvers for Angle Based Flattening Max-Planck-Institut für Informatik

Efficient Iterative Solvers for ABF Modified Uzawa Modified Minres