HLODs: Hierarchical Levels of Detail Hierarchical Simplifications for Faster Display of Massive Geometric Environments Carl Erikson, Dinesh Manochahttp://www.cs.unc.edu/~walk/hlod.

Slides:



Advertisements
Similar presentations

Advertisements

Surface Simplification Using Quadric Error Metrics Speaker: Fengwei Zhang September
H3: Laying Out Large Directed Graphs in 3D Hyperbolic Space Tamara Munzner, Stanford University.
Introduction to Massive Model Visualization Patrick Cozzi Analytical Graphics, Inc.
CSE 381 – Advanced Game Programming Scene Management
View-Dependent Simplification of Arbitrary Polygonal Environments David Luebke.
Developer’s Survey of Polygonal Simplification Algorithms Based on David Luebke’s IEEE CG&A survey paper.
Progressive Transmission of Appearance Preserving Octree-Textures Camille Perin Web3D 2008 August 9, 2008 Julien LacosteBruno Jobard LIUPPA University.
Visibility Culling using Hierarchical Occlusion Maps Hansong Zhang, Dinesh Manocha, Tom Hudson, Kenneth E. Hoff III Presented by: Chris Wassenius.
4.4. L EVEL OF D ETAIL Exploration of 3D mesh level-of-detail approaches.
CPSC 335 Computer Science University of Calgary Canada.
Haptic Rendering using Simplification Comp259 Sung-Eui Yoon.
1 Dr. Scott Schaefer Hidden Surfaces. 2/62 Hidden Surfaces.
Rendering of Realistic Grass (In Real Time) Sami Benzaid.
Bounding Volume Hierarchy “Efficient Distance Computation Between Non-Convex Objects” Sean Quinlan Stanford, 1994 Presented by Mathieu Brédif.
Tomas Mőller © 2000 Speeding up your game The scene graph Culling techniques Level-of-detail rendering (LODs) Collision detection Resources and pointers.
Parallel Occlusion Culling for Interactive Walkthrough using Multiple GPUs Naga K Govindaraju, Avneesh Sud, Sun-Eui Yoon, Dinesh Manocha University of.
Tomas Mőller © 2000 Speed-up Techniques for Real-Time Rendering or “What makes your real-time video game fly” Tomas Möller Chalmers University of Technology,
Interactive Shadow Generation in Complex Environments Naga K. Govindaraju, Brandon Lloyd, Sung-Eui Yoon, Avneesh Sud, Dinesh Manocha Speaker: Alvin Date:
Image-Based Techniques Hierarchical Image Caching Michael Chung.
11/08/00 Dinesh Manocha, COMP258 Subdivision Curves & Surfaces Work of G. de Rham on Corner Cutting in 40’s and 50’s Work of Catmull/Clark and Doo/Sabin.
Visualization and graphics research group CIPIC January 21, 2003Multiresolution (ECS 289L) - Winter Dynamic View-Dependent Simplification for Polygonal.
Visualization and graphics research group CIPIC January 21, 2003Multiresolution (ECS 289L) - Winter Surface Simplification Using Quadric Error Metrics.
Visualization and graphics research group CIPIC February 13, 2003ECS289L – Multiresolution Methods – Winter Illumination Dependent Refinement of.
Hidden Surface Removal
Modeling and representation 1 – comparative review and polygon mesh models 2.1 Introduction 2.2 Polygonal representation of three-dimensional objects 2.3.
Managing Your Objects Paul Taylor 2009 Assignment Due Fri 5/6/2009.
Surface Simplification Using Quadric Error Metrics Michael Garland Paul S. Heckbert.
Level of Detail David Luebke University of Virginia.
The Electronic Geometry Textbook Project Xiaoyu Chen LMIB - Department of Mathematics Beihang University, China.
CSE 381 – Advanced Game Programming Quickhull and GJK.
On-line Space Sculpturing for 3D Shape Manipulation
Culling Techniques “To cull” means “to select from group” In graphics context: do not process data that will not contribute to the final image The “group”
NDVI-based Vegetation Rendering CGIM ‘07 Stefan Roettger, University of Erlangen
Level of Detail & Visibility: A Brief Overview David Luebke University of Virginia.
Accelerating Ray Tracing using Constrained Tetrahedralizations Ares Lagae & Philip Dutré 19 th Eurographics Symposium on Rendering EGSR 2008Wednesday,
An Application of Tetrahedrisation to From-Point Visibility Honours Project Proposal Gerard Ryan and Brendon Miszka
Real-Time Rendering SPEEDING UP RENDERING Lecture 04 Marina Gavrilova.
Real-Time Rendering & Game Technology CS 446/651 David Luebke.
GPU Graftals: Stylized Rendering of Fluffy Objects Michael Lester.
Ground Truth Free Evaluation of Segment Based Maps Rolf Lakaemper Temple University, Philadelphia,PA,USA.
Real-time Graphics for VR Chapter 23. What is it about? In this part of the course we will look at how to render images given the constrains of VR: –we.
1 Visiblity: Culling and Clipping Computer Graphics COMP 770 (236) Spring 2009 January 21 & 26: 2009.
Geometric Modeling How to design a graphical model? How to create a digital description of a real-world object? Design Digitize.
112/5/ :54 Graphics II Image Based Rendering Session 11.
Emerging Technologies for Games Deferred Rendering CO3303 Week 22.
Modeling, CG, and others Jyun-Ming Chen Fall 2001.
Coherent Hierarchical Culling: Hardware Occlusion Queries Made Useful Jiri Bittner 1, Michael Wimmer 1, Harald Piringer 2, Werner Purgathofer 1 1 Vienna.
Graphics Graphics Korea University cgvr.korea.ac.kr 1 7. Speed-up Techniques Presented by SooKyun Kim.
Approach Outline Polygonal-Functional Hybrids for Computer Animation and Games The modern world of computer graphics is mostly dominated by polygonal models.
Tree Traversals, TreeSort 20 February Expression Tree Leaves are operands Interior nodes are operators A binary tree to represent (A - B) + C.
LODManager A framework for rendering multiresolution models in real-time applications J. Gumbau O. Ripollés M. Chover.
Zhang & Liang, Computer Graphics Using Java 2D and 3D (c) 2007 Pearson Education, Inc. All rights reserved. 1 Chapter 11 Animation.
1 INTRODUCTIONINTRODUCTION VIS98 Tutorial Level-of-Detail in Surface and Volume Modeling Leila De Floriani University of Genova Genova (Italy) Enrico Puppo.
Module 06 –environment mapping Module 06 – environment mapping Module 06 Advanced mapping techniques: Environment mapping.
David Luebke2/12/2016 CS 551 / 645: Introductory Computer Graphics David Luebke
1 CSCE 441: Computer Graphics Hidden Surface Removal Jinxiang Chai.
Rendering Large Models (in real time)
Controlling Memory Consumption of Hierarchical Radiosity with Clustering iMAGIS -GRAVIR/IMAG-INRIA iMAGIS is a joint project of CNRS/INRIA/UJF/INPG Xavier.
Scheduling Level of Detail with guaranteed Quality and Cost W. Pasman, F. W. Jansen Delft University of Technology.
Advanced Computer Graphics (Spring 2013) Mesh representation, overview of mesh simplification Many slides courtesy Szymon Rusinkiewicz.
Computer Graphics One of the central components of three-dimensional graphics has been a basic system that renders objects represented by a set of polygons.
3D Object Representations 2009, Fall. Introduction What is CG?  Imaging : Representing 2D images  Modeling : Representing 3D objects  Rendering : Constructing.
Real-Time Rendering & Game Technology CS 446/651 David Luebke.
Distance Computation “Efficient Distance Computation Between Non-Convex Objects” Sean Quinlan Stanford, 1994 Presentation by Julie Letchner.
Level of Detail: A Brief Overview
CS475 3D Game Development Level Of Detail Nodes (LOD)
Meshes.
Run-Time LOD Run-time algorithms may use static or dynamic LOD models:
Presentation transcript:

HLODs: Hierarchical Levels of Detail Hierarchical Simplifications for Faster Display of Massive Geometric Environments Carl Erikson, Dinesh Manochahttp:// April 2000 Approach Traditional LODs represent the geometry of single nodes in the environment’s scene graph. HLODs represent branches of the scene graph, or the polygons of multiple nodes. In a traditional LOD rendering system, the display algorithm will render an appropriate level of detail for every object or node in the scene. Since an HLOD of a node in the scene graph is an approximation for the node as well as its descendants, if we render a node’s HLOD in traversing the scene graph, we do not need to visit its descendants. Figure 1: The Double Eagle tanker. The model has 126,630 objects and 82,361,612 triangles. Figure 4: Rendering a face model using LODs and HLODs. Our algorithm traverses the scene graph starting at Face. Since the viewer is far away, it renders a representation of Face using HLOD 0. Since this HLOD represents the entire scene graph, the system stops the traversal. Basic Algorithm Group Nodes Partition Model Make LODs Make HLODs Advantages of HLODs Fidelity: We group objects to create HLODs, thus increasing the visual quality of drastic approximations. Automatic Generation: We compute the HLODs of a scene graph without user intervention. Generality: We make no assumptions about topological information or representation. Efficiency: HLODs are static, so they can be rendered using display lists. Flexibility: Our HLOD scene graph structure allows us to render in constant frame-rate mode or image-fidelity mode. Algorithm HLODs are a generalization of the level-of-detail concept to hierarchical aggregations of objects. We use HLODs to accelerate the rendering of very large static environments. The principal motivation for using such a hierarchical method is to produce better global approximations. Since traditional LOD methods work only on single objects at a time they can only minimize errors local to a particular object. The aggregate of these local approximations will typically have greater error than an approximation generated by considering all of the objects at once. To this end we generate HLODs by simplifying separate portions of a scene together. HLODs are higher fidelity global approximations, especially for drastic simplifications. We represent the environment using a scene graph and compute LODs for each node. HLODs are computed in a bottom-up hierarchical manner based on these LODs. Overview Traditional LOD methods can typically only simplify a single object at a time. Given a scene containing multiple objects, these methods can only minimize errors local to individual objects and not the scene as a whole. Hierarchical LODs, or HLODs, are a generalization of traditional LOD methods to hierarchical aggregations of objects. We generate HLODs by simplifying separate portions of a scene together, producing higher fidelity global approximations, especially for drastic simplifications. Creating HLODs While traditional LODs represent the geometry of a single node in the environment, HLODs represent entire branches of the scene graph, or the geometry of multiple nodes. We represent the environment using a scene graph and compute LODs for each node. We then compute HLODs at each node in a bottom- up fashion based on these LODs. Rendering HLODs In a traditional LOD rendering system, the display algorithm will render an appropriate level of detail for every object or node in the scene graph. Since an HLOD of a node is an approximation of the geometry of that node as well as its descendants, if we render a node’s HLOD while traversing the scene graph, we do not need to visit its descendants (see Figure 4). In this way we can aggressively cull out entire portions of the scene by merely rendering the HLODs at a node when appropriate. Figure 3:HLODs of the Double Eagle. They consist of 7,710 and 1,914 faces. Figure 2:LODs of the Double Eagle. They consist of 7,887 and 1,922 faces. Figure 5: The power plant model, containing 12,731,154 faces and 1,477 objects. Notice how the HLOD approximation has a more solid feel than LODs alone. The original model.LODs containing 2,515 faces.HLODs containing 2,379 faces.