Non-Photorealistic Rendering FORMS. Model dependent Threshold dependent View dependent Outline form of the object Interior form of the object Boundary.

Slides:



Advertisements
Similar presentations
Saito, T. and Takahashi, T. Comprehensible Rendering of 3-D Shapes Proc. of SIGGRAPH '90 Genesis of Image Space NPR.
Advertisements

Optimized Stencil Shadow Volumes
Illustrating Smooth Surfaces Aaron Hertzmann Denis Zorin New York University Presented by Mark Blackburn, Fall 2005.
Non-Photorealistic Rendering FORMS. Mesh (~170) Parametric (~16) Implicit/CSG (~9) Volumetric (~28) 3D Object Representation in NPR Point Cloud (~4)
COMPUTER GRAPHICS CS 482 – FALL 2014 OCTOBER 13, 2014 IMPLICIT REPRESENTATIONS IMPLICIT FUNCTIONS IMPLICIT SURFACES MARCHING CUBES.
Non-Photo Realistic Rendering Jian Huang CS594 Fall 2003 This set of slides are modified from the NPR Course during SIGGRAPH’2003.
MIT EECS 6.837, Durand and Cutler Curves & Surfaces.
Pedro V. Sander Xianfeng Gu Steven J. Gortler Harvard University
Discontinuity Edge Overdraw
Chapter 6: Vertices to Fragments Part 2 E. Angel and D. Shreiner: Interactive Computer Graphics 6E © Addison-Wesley Mohan Sridharan Based on Slides.
University of British Columbia CPSC 314 Computer Graphics Jan-Apr 2008 Alla Sheffer Advanced Rendering Week.
CS6500 Adv. Computer Graphics © Chun-Fa Chang, Spring 2003 Object-Order vs. Screen-Order Rendering April 24, 2003.
Computer Graphics (Fall 2005) COMS 4160, Lecture 21: Ray Tracing
Advanced Computer Graphics (Fall 2010) CS 283, Lecture 4: 3D Objects and Meshes Ravi Ramamoorthi
Suggestive Contours Final programming assignment Advanced topics in Computer Graphics.
Vertices and Fragments III Mohan Sridharan Based on slides created by Edward Angel 1 CS4395: Computer Graphics.
 Marc Levoy IBM / IBR “The study of image-based modeling and rendering is the study of sampled representations of geometry.”
Research Goal  We provide physical visualizations to modern structural biologists, thus reviving tactile feedback, in addition to immersive environments.
Part I: Basics of Computer Graphics Rendering Polygonal Objects (Read Chapter 1 of Advanced Animation and Rendering Techniques) Chapter
Non-photorealistic Rendering Pablo Picasso - The Bird Cage No electrons were harmed during the production of this presentation.
Non-Photorealistic Rendering Greg Turk College of Computing and GVU Center.
Week 14 - Wednesday.  What did we talk about last time?  Collision handling  Collision detection  Collision determination  Collision response  BSPs.
Computer Graphics Shadows
Art-Based Rendering of Fur, Grass, and Trees Michael A. Kowalski, Lee Markosian, J.D. Northrup, Lubomir Bourdev, Ronen Barzel.
Computer-Generated Pen- and-Ink Illustration Georges Winkenbach, David H. Salesin.
Erdem Alpay Ala Nawaiseh. Why Shadows? Real world has shadows More control of the game’s feel  dramatic effects  spooky effects Without shadows the.
Modeling and representation 1 – comparative review and polygon mesh models 2.1 Introduction 2.2 Polygonal representation of three-dimensional objects 2.3.
Marching Cubes: A High Resolution 3D Surface Construction Algorithm
03/30/05© 2005 University of Wisconsin NPR Today “Stylized Rendering Techniques for Scalable Real-Time 3D Animation”, Adam Lake, Carl Marshall, Mark Harris.
KinectFusion : Real-Time Dense Surface Mapping and Tracking IEEE International Symposium on Mixed and Augmented Reality 2011 Science and Technology Proceedings.
Advanced Computer Graphics March 06, Grading Programming assignments Paper study and reports (flipped classroom) Final project No written exams.
A Non-Photorealistic Model for Automatic Technical Illustration Amy Gooch Bruce Gooch Peter Shirley Elaine Cohen SIGGRAPH 1998 Presented by Anteneh.
University of Coimbra Reconstruction of Voxels from Sensor Data Ricardo Martins Coimbra, 19 th January 2010 Doctoral Programme in Electrical Engineering.
Polygon Modelling. 3D Representation Wire frame NURBS surface Solid Voxel Mesh.
Reporter: Zhonggui Chen
Marching Cubes: A High Resolution 3D Surface Construction Algorithm William E. Lorenson Harvey E. Cline General Electric Company Corporate Research and.
Shape Analysis and Retrieval Structural Shape Descriptors Notes courtesy of Funk et al., SIGGRAPH 2004.
Computer-Generated Pen-and-Ink Illustration of Trees Oliver Deussen & Thomas Strothotte University of Magdeburg.
Cel Shading Jason McCollum. Overview Nonphotorealistic Rendering (NPR) Cel-shading Concepts Demonstration.
Ink Line Rendering for Film Production
Implementation II Ed Angel Professor of Computer Science, Electrical and Computer Engineering, and Media Arts University of New Mexico.
Vector Graphics Digital Multimedia Chap 이병희
Non-Photorealistic Rendering: Toon Shading David Luebke University of Virginia.
3D Object Representations
Implementation II.
Ramesh Raskar University of North Carolina at Chapel Hill Ramesh Raskar University of North Carolina at Chapel Hill Image Precision Silhouette Edges Michael.
CS 325 Introduction to Computer Graphics 03 / 29 / 2010 Instructor: Michael Eckmann.
A New Voronoi-based Reconstruction Algorithm
CS123 | INTRODUCTION TO COMPUTER GRAPHICS Andries van Dam © Visible Surface Determination (VSD) To render or not to render, that is the question… 1 of.
A Very Brief Overview of Non-Photorealistic Rendering Conrad Albrecht-Buehler Graduate Thesis Seminar September 24, 2001.
Computer-Generated Medical, Technical, and Scientific Illustration SIGGRAPH 2005 Course #31 Half-Day, Tuesday, 2 August, 8:30 am - 12:15 pm Level: Intermediate.
Volume and Solid Modeling
Computer Graphics I, Fall 2010 Implementation II.
Real Time Nonphotorealistic Rendering. How to achieve real time NPR? Economy of line: present a lot of information with very few strokes. Silhouettes.
Painterly Rendering for Animation Introduction speaks of focus and detail –Small brush strokes focus and provide detail –Large strokes are abstract and.
1 Shadow Rendering Techniques: Hard and Soft Author: Jamiur Rahman Supervisor: Mushfiqur Rouf Department of CSE BRAC University.
Stencil Shadows Garrett Weng. What are stencil shadows? Also known as shadow volumes Relies on use of the stencil buffer Create volumes of the shadows.
Kansas State University Department of Computing and Information Sciences CIS 736: Computer Graphics Wednesday, March 1, 2000 William H. Hsu Department.
1 Computer Graphics Week11 : Hidden Surface Removal.
Non-Photorealistic Rendering FORMS. Model dependent Threshold dependent View dependent Outline form of the object Interior form of the object Boundary.
Solid Modeling Dr. Scott Schaefer.
Visible surface determination
Computer Graphics Implementation II
Week 14 - Wednesday CS361.
Jim X. Chen George Mason University
Cel Shading Jason McCollum.
Implementation II Ed Angel Professor Emeritus of Computer Science
Introduction to Computer Graphics with WebGL
Implementation II Ed Angel Professor Emeritus of Computer Science
Presentation transcript:

Non-Photorealistic Rendering FORMS

Model dependent Threshold dependent View dependent Outline form of the object Interior form of the object Boundary Crease (+ other discontinuities) Crease (+ other discontinuities) Silhouette X X

Object Space Involve computations in 3D and produce a list of silhouette edges or curves for a given viewpoint 1. Brute Force 2. Edge Buffer 3. Probabilistic 4. Gauss Map Arc Hierarchy 5. Normal Cone Hierarchy 6. Implicit Surfaces 7. NURBS Surfaces Image Space involve image processing techniques 1. Two Pass Methods 2. Environment Map 3. One Pass Method 4. Model Augmentation 5. Depth Discontinuity Methods Silhouette Algorithms

Object Space Involve computations in 3D and produce a list of silhouette edges or curves for a given viewpoint 1. Brute Force 2. Edge Buffer 3. Probabilistic 4. Gauss Map Arc Hierarchy 5. Normal Cone Hierarchy 6. Implicit Surfaces 7. NURBS Surfaces Image Space involve image processing techniques 1. Two Pass Methods 2. Environment Map 3. One Pass Method 4. Model Augmentation 5. Depth Discontinuity Methods Silhouette Algorithms

Object Space  1. Brute Force Iterate through each edge in a polygonal model and test whether each edge is a silhouette edge

edge list polygon list N N V For every frame : { For every edge e : { If (e  N1.dot (V) = 0 ) || (e  N2.dot (V) = 0 ) (e  N2.dot (V) = 0 ) e  is_silhouette = TRUE e  is_silhouette = TRUEelse e  is_silhouette = FALSE e  is_silhouette = FALSE}} N1 N2

edge list polygon list N N V For every frame : { For every edge e : { If ( e  N1.dot (V) * e  N2.dot(V) ) <= 0 e  is_silhouette = TRUE e  is_silhouette = TRUEelse e  is_silhouette = FALSE e  is_silhouette = FALSE}} N1 N2

Object Space Involve computations in 3D and produce a list of silhouette edges or curves for a given viewpoint 1. Brute Force 2. Edge Buffer 3. Probabilistic 4. Gauss Map Arc Hierarchy 5. Normal Cone Hierarchy 6. Implicit Surfaces 7. NURBS Surfaces Image Space involve image processing techniques 1. Two Pass Methods 2. Environment Map 3. One Pass Method 4. Model Augmentation 5. Depth Discontinuity Methods Silhouette Algorithms

Object Space  2. Edge Buffer Using the “Edge Buffer” data structure of Buchanan and Sousa to iterate over facets instead of edges. Buchanan, J. W. and Sousa, M. C. The edge buffer: A data structure for easy silhouette rendering Proc. of NPAR '00

Object Space Involve computations in 3D and produce a list of silhouette edges or curves for a given viewpoint 1. Brute Force 2. Edge Buffer 3. Probabilistic 4. Gauss Map Arc Hierarchy 5. Normal Cone Hierarchy 6. Implicit Surfaces 7. NURBS Surfaces Image Space involve image processing techniques 1. Two Pass Methods 2. Environment Map 3. One Pass Method 4. Model Augmentation 5. Depth Discontinuity Methods Silhouette Algorithms

Object Space  3. Probabilistic An edge tracing method where a finite number of “seed” edges are chosen of reach viewpoint based on a measure of the likelihood that the “seed” edges are silhouettes. Markosian, L., Kowalski, M. A., Trychin, S. J., Bourdev, L. D., Goldstein, D., and Hughes, J. F.. Real-Time Nonphotorealistic Rendering. Proc. of SIGGRAPH '97, pp

1997Markosian et al Real-Time Nonphotorealistic Rendering SIGGRAPH 1997 Markosian et al Real-Time Nonphotorealistic Rendering SIGGRAPH A small number of edges are chosen based on the probability that they are silhouette edges: Edges with higher dihedral angles Silhouette edges from the previous frame …then tested to see if they are silhouette edges. When a silhouette edge is found, its adjacent edges are tested to see if any of these edges is also a silhouette edge.

1979 Appel et al The haloed line effect for hidden line elimination SIGGRAPH 1982Roth 1982 Roth Ray Casting for Modeling Solids Computer Graphics and Image Processing 1987Wyvill et al 1987 Wyvill et al Sketches by Ray Tracing Computer Graphics International 1987Sasada 1987 Sasada Drawing Natural Scenery by Computer Graphics Computer-Aided Design 1988Veenstra and Ahuja 1988 Veenstra and Ahuja Line drawings of octree-represented objects ACM Transactions on Graphics 1997Markosian et al 1997 Markosian et al Real-Time Nonphotorealistic Rendering SIGGRAPH Line Drawing of 3D Models

Object Space Involve computations in 3D and produce a list of silhouette edges or curves for a given viewpoint 1. Brute Force 2. Edge Buffer 3. Probabilistic 4. Gauss Map Arc Hierarchy 5. Normal Cone Hierarchy 6. Implicit Surfaces 7. NURBS Surfaces Image Space involve image processing techniques 1. Two Pass Methods 2. Environment Map 3. One Pass Method 4. Model Augmentation 5. Depth Discontinuity Methods Silhouette Algorithms

Object Space  4. Gauss Map Hierarchy The angles of arcs between front and back facing polygons are stored in a tree structure 2 papers (1999)

1999Benichou and Elber Pacific Graphics 1999 Benichou and Elber Output sensitive extraction of silhouettes from polygonal geometry Pacific Graphics

Object Space Involve computations in 3D and produce a list of silhouette edges or curves for a given viewpoint 1. Brute Force 2. Edge Buffer 3. Probabilistic 4. Gauss Map Arc Hierarchy 5. Normal Cone Hierarchy 6. Implicit Surfaces 7. NURBS Surfaces Image Space involve image processing techniques 1. Two Pass Methods 2. Environment Map 3. One Pass Method 4. Model Augmentation 5. Depth Discontinuity Methods Silhouette Algorithms

Object Space  5. Normal Cone Hierarchy Polygon normals are grouped into cones and these cones are stored in a tree structure 4 papers (2000, 2001)

2001Johnson and Cohen 2001 Johnson and Cohen Spatialized normal cone hierarchies ACM Symposium on Interactive 3D Graphics The cone encompasses the range of normals and bounds the geometry The view cone starts at the eye and encloses the bounding sphere.

Object Space Involve computations in 3D and produce a list of silhouette edges or curves for a given viewpoint 1. Brute Force 2. Edge Buffer 3. Probabilistic 4. Gauss Map Arc Hierarchy 5. Normal Cone Hierarchy 6. Implicit Surfaces 7. NURBS Surfaces Image Space involve image processing techniques 1. Two Pass Methods 2. Environment Map 3. One Pass Method 4. Model Augmentation 5. Depth Discontinuity Methods Silhouette Algorithms

Object Space  6. Implicit Surfaces A silhouette tracing method where points on the silhouette curve are found using ”ray tests” Bremer, D.J. and Hughes, J. F. Rapid approximate silhouette rendering of implicit surfaces Proc. of Implicit Surfaces '98. pp

Object Space Involve computations in 3D and produce a list of silhouette edges or curves for a given viewpoint 1. Brute Force 2. Edge Buffer 3. Probabilistic 4. Gauss Map Arc Hierarchy 5. Normal Cone Hierarchy 6. Implicit Surfaces 7. NURBS Surfaces Image Space involve image processing techniques 1. Two Pass Methods 2. Environment Map 3. One Pass Method 4. Model Augmentation 5. Depth Discontinuity Methods Silhouette Algorithms

Object Space  7. NURBS Surfaces Silhouette curves on a model are found by using a ”marching cube” algorithm to find surface patches which the silhouette curve passes through. Silhouette curves are then interpolated from the entry and exit points of the patch. Gooch, A. Interactive Non-Photorealistic Technical Illustration. MSc thesis Department of Computer Science, University of Utah, 1998.