DOCSLIB.ORG

Computer Graphics Exercise – Jakob Wagner

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Computer Graphics Exercise – Jakob Wagner Computer Graphics Exercise – Jakob Wagner Computer Graphics Exercise 6. Transformation & Normal Mapping Jakob Wagner for internal use only 6 – Transformation & Normal Mapping Computer Graphics Exercise – Jakob Wagner Normal vector scaling (1.0, 1.0) (2.0, 1.0) - normal n represents orientation of plane p - normal is orthogonal to represented plane p’ . p . (2.0, 1.0) scaling n’ - scale normal like vertices: n (1.0, -1.0) (2.0, -1.0) -> points no longer lie on plane p’ (0.0, 0.0) (0.0, 0.0) represented by normal n’ (1.0, 1.0) (2.0, 1.0) - scale normal inversely to vertices: p . p’ (0.5, 1.0) scaling . -> points still lie on plane p’ represented by n n’ normal n’ (1.0, -1.0) (0.5, -1.0) (0.0, 0.0) (0.0, 0.0) 6 – Transformation & Normal Mapping 2 Computer Graphics Exercise – Jakob Wagner Normal transformation -1 - normal must be transformed with inverted scale -> Mnormal = Mvertex - through the matrix inversion an included rotation is also inverted - the inverse of a rotation matrix is its transpose -> R-1 = RT - the transposing does not change the effect of a scaling matrix -> ST = S -1 T - transpose inverted matrix to restore correct rotation -> Mnormal = (Mvertex ) - translation is irrelevant, as normals only represent orientation -T -> transform normals with inverse-transpose of vertex transform matrix -> Mnormal = Mvertex 6 – Transformation & Normal Mapping 3 Computer Graphics Exercise – Jakob Wagner Transformation spaces Model Space World Space View Space Model View Matrix Matrix - vertex attribute definition - model transformations - lighting computations 6 – Transformation & Normal Mapping 4 Computer Graphics Exercise – Jakob Wagner Normal Mapping vertex normals texture normals - normals are a vertex attribute -> surface orientation can only be defined at vertices -> no explicit normal definition between vertices possible - textures are looked up per-fragment -> level of detail solely dependent on texture resolution -> storing normals in a texture allows arbitrary surface detail http://blog.wolfire.com/2009/10/character-normal-maps/ 6 – Transformation & Normal Mapping 5 Computer Graphics Exercise – Jakob Wagner Model Space Normal Mapping - normals in texture replace vertex normals - R,G,B channels store X,Y,Z orientation of normal in model space channels: combined - x: direction to right & left x y z normal map - y: direction up & down - z: direction forward & backward - workflow: a. map texture to model b. encode normal orientation in texture c. apply normal map to model d. in fragment shader, read detail normal from texture e. transform detail normal from model- into view-space f. use detail normal in lighting computation http://blog.wolfire.com/2009/10/character-normal-maps/ 6 – Transformation & Normal Mapping 6 Computer Graphics Exercise – Jakob Wagner Normal Mapping Variants - model space normal map encodes normals of relative to model -> normal map replaces vertex normals -> normal map needs to be recomputed when the surface is deformed or rotated -> normal map cannot be used on other models (e.g. differently rotated flat planes) tangent space texture projection model space normals vertex normals normals top back normal mapping on a cube: right left - = botto front m - tangent space normal map encodes normals relative to covered surface -> normal map can still be used when the surface is deformed and rotated as it is defined relative to it -> normal map can be used on multiple models (e.g. all flat planes) http://www.3dtotal.com/index_tutorial_detailed.php?id=1106&page=2 6 – Transformation & Normal Mapping 7 Computer Graphics Exercise – Jakob Wagner Tangent Space - a space is defined by a reference frame of basis vectors - tangent space describes the underlying surface at a point on the mesh -> what are the basis vectors for tangent space? - a space is defined by a reference frame of basis vectors - the normal vector represents the z-axis, pointing away from the surface - two more vectors are required, must lie on the surface to be orthogonal to normal vector - only existent further information about surface are the texture coordinates of surrounding vertices -> use texture u- and v-axes to span two additional vectors, tangent and bitangent normal and texture normal with tangent and normal coordinates bitagent n n n . v u 6 – Transformation & Normal Mapping 8 Computer Graphics Exercise – Jakob Wagner Tangent Space - d1 and d2 are the triangle edge directions in model space - d1’ and d2’ are edge directions in texture space (relative to u and v base axes) - u’ and v’ are the texture space bases in model space called tangent and bitangent - tangent and bitangent form together with the surface normal an orthogonal space, the tangent space representing the surface of a triangle model space texture space model space 1 1 2 n u’ d2’ d1 v d1 . v’ d ’ 1 1 3 3 2 d2 3 2 u d2 6 – Transformation & Normal Mapping 9 Computer Graphics Exercise – Jakob Wagner p Tangent Calculation 1 - tangent t and bitangent b represent the texture u- and v-axes in model space Δp1 p - ti is the texture coordinate of pi: ti = (ui, vi) b - Δp1 = p1 - p0 , Δp2 = p2 - p0 p t p - the position of any point on the plane can be calculated using its uv-coordinates: 0 Δp2 2 pi = p0 + Δui ∙ t + Δvi ∙ b - this equation must also hold for p1 and p2: Δp1 = Δu1 ∙ t + Δv1 ∙ b and Δp2 = Δu2 ∙ t + Δv2 ∙ b in matrix form: Δp : x Δp : y Δp : z Δu Δv t : x t : y t : z 1 1 1 = 1 1 ∙ Δp2 : x Δp2 : y Δp2 : z Δu2 Δv2 b : x b : y b : z - multiply with inverse of uv-coordinate matrix: t : x t : y t : z 1 Δv2 -Δv1 Δp1 : x Δp1 : y Δp1 : z ____________________ ∙ = Δu ∙Δv - Δu ∙Δv ∙ b : x b : y b : z 1 2 2 1 -Δu2 Δu1 Δp2 : x Δp2 : y Δp2 : z http://web.archive.org/web/20160409104130/http://www.terathon.com/code/tangent.html 6 – Transformation & Normal Mapping 10 Computer Graphics Exercise – Jakob Wagner Tangent Computation 1. start with null-vectors for vertex tangents ti 2. for each triangle a. calculate tangent t of current triangle and normalize it b. add t to ti of the three vertices forming the triangle 3. for each vertex a. orthogonalize tangent relative to normal: t’ = t - n ∙ dot(n, t) b. normalize tangent - for mirrored texture projections the handedness of the tangent also needs to be stored (ignored in the exercise) - the bitangent is assumed to be orthogonal to the normal and tangent -> calculating it with cross(n, t) in the fragment shader saves the space of an additional vertex attribute http://www.terathon.com/code/tangent.html 6 – Transformation & Normal Mapping 11 Computer Graphics Exercise – Jakob Wagner Tangent Space Normal Mapping p - tangent-space normal maps can be interpreted as containing offsets or a rotation v of the vertex normal - the red component controls the offset along the horizontal axis (u / tangent) - the green component controls the offset along the vertical axis (v / bitangent) - the blue component controls the offset along the outward axis (w / normal) w u - concept: the normal np at position p is defined as np = cr∙ t + cg∙ b + cb∙ n with c = (cr, cg, cb) being the normal texture color at p - implementation: np = Mtangent∙ (cr, cg, cb) – with Mtangent = [t, b, n] b n n - workflow: p p a. map texture to model b. encode normal orientation in texture t c. apply normal map to model d. in fragment shader, read the detail normal from the texture e. create tangent-space matrix from tangent, bitangent and normal in view-space f. transform detail normal from tangent- into view-space using tangent-space matrix g. use detail normal in lighting computation 6 – Transformation & Normal Mapping 12 Computer Graphics Exercise – Jakob Wagner Transformation spaces - texture channels are normalized (from 0 to 1) but normal direction components have different ranges: - X-axis: right: 1.0 to left: -1.0 - Y-axis: up: 1.0 to down: -1.0 - Z-axis: forward: 1.0 to nothing: 0.0 (normal cannot point inwards) -> after reading the normal from the texture, the values must be adjusted so that they lie in the correct range View Space Tangent Space Texture Space b n Tangent range v Matrix adjust t w u - lighting computations - detail normals - encoded normals with normalized ranges 6 – Transformation & Normal Mapping 13 Computer Graphics Exercise – Jakob Wagner Assignment 4 – Normal Mapping Tangent Calculation - implement the model_loader::generate_tangents() function - request the model loader to calculate the tangents by replacing the last parameter “model::NORMAL|model::TEXCOORD” of the model_loader::obj() function call with “model::NORMAL|model::TEXCOORD|model::TANGENT” - in the planet_object initialisation, add another attribute of the type “model::TANGENT” Normal map - load a normal map for a planet and bind it to an additional Texture Unit and upload its index to a new uniform in the shader Normal mapping - in the planet vertex shader add another input attribute “layout(location = 3) in vec3 in_Tangent“ that is transformed into view-space using the Normal Matrix and then assigned to an output variable “vec3 pass_Tangent” - in the fragment shader add another input “vec3 pass_Tangent” - sample the normal texture with “pass_TexCoord” and use the resulting rgb color as the normal in texture space - transform the normal from texture into tangent space by adjusting the range of the components - transform the normal from tangent- into view-space by multiplying it with the tangent matrix built from view-space normal, tangent and bitangent 6 – Transformation & Normal Mapping 14.
Load more

Recommended publications
  • Game Developers Conference Europe Wrap, New Women’S Group Forms, Licensed to Steal Super Genre Break Out, and More
    >> PRODUCT REVIEWS SPEEDTREE RT 1.7 * SPACEPILOT OCTOBER 2005 THE LEADING GAME INDUSTRY MAGAZINE >>POSTMORTEM >>WALKING THE PLANK >>INNER PRODUCT ART & ARTIFICE IN DANIEL JAMES ON DEBUG? RELEASE? RESIDENT EVIL 4 CASUAL MMO GOLD LET’S DEVELOP! Thanks to our publishers for helping us create a new world of video games. GameTapTM and many of the video game industry’s leading publishers have joined together to create a new world where you can play hundreds of the greatest games right from your broadband-connected PC. It’s gaming freedom like never before. START PLAYING AT GAMETAP.COM TM & © 2005 Turner Broadcasting System, Inc. A Time Warner Company. Patent Pending. All Rights Reserved. GTP1-05-116-104_mstrA_v2.indd 1 9/7/05 10:58:02 PM []CONTENTS OCTOBER 2005 VOLUME 12, NUMBER 9 FEATURES 11 TOP 20 PUBLISHERS Who’s the top dog on the publishing block? Ranked by their revenues, the quality of the games they release, developer ratings, and other factors pertinent to serious professionals, our annual Top 20 list calls attention to the definitive movers and shakers in the publishing world. 11 By Tristan Donovan 21 INTERVIEW: A PIRATE’S LIFE What do pirates, cowboys, and massively multiplayer online games have in common? They all have Daniel James on their side. CEO of Three Rings, James’ mission has been to create an addictive MMO (or two) that has the pick-up-put- down rhythm of a casual game. In this interview, James discusses the barriers to distributing and charging for such 21 games, the beauty of the web, and the trouble with executables.
    [Show full text]
  • GAME DEVELOPERS a One-Of-A-Kind Game Concept, an Instantly Recognizable Character, a Clever Phrase— These Are All a Game Developer’S Most Valuable Assets
    HOLLYWOOD >> REVIEWS ALIAS MAYA 6 * RTZEN RT/SHADER ISSUE AUGUST 2004 THE LEADING GAME INDUSTRY MAGAZINE >>SIGGRAPH 2004 >>DEVELOPER DEFENSE >>FAST RADIOSITY SNEAK PEEK: LEGAL TOOLS TO SPEEDING UP LIGHTMAPS DISCREET 3DS MAX 7 PROTECT YOUR I.P. WITH PIXEL SHADERS POSTMORTEM: THE CINEMATIC EFFECT OF ZOMBIE STUDIOS’ SHADOW OPS: RED MERCURY []CONTENTS AUGUST 2004 VOLUME 11, NUMBER 7 FEATURES 14 COPYRIGHT: THE BIG GUN FOR GAME DEVELOPERS A one-of-a-kind game concept, an instantly recognizable character, a clever phrase— these are all a game developer’s most valuable assets. To protect such intangible properties from pirates, you’ll need to bring out the big gun—copyright. Here’s some free advice from a lawyer. By S. Gregory Boyd 20 FAST RADIOSITY: USING PIXEL SHADERS 14 With the latest advances in hardware, GPU, 34 and graphics technology, it’s time to take another look at lightmapping, the divine art of illuminating a digital environment. By Brian Ramage 20 POSTMORTEM 30 FROM BUNGIE TO WIDELOAD, SEROPIAN’S BEAT GOES ON 34 THE CINEMATIC EFFECT OF ZOMBIE STUDIOS’ A decade ago, Alexander Seropian founded a SHADOW OPS: RED MERCURY one-man company called Bungie, the studio that would eventually give us MYTH, ONI, and How do you give a player that vicarious presence in an imaginary HALO. Now, after his departure from Bungie, environment—that “you-are-there” feeling that a good movie often gives? he’s trying to repeat history by starting a new Zombie’s answer was to adopt many of the standard movie production studio: Wideload Games.
    [Show full text]
  • Steve Marschner CS5625 Spring 2019 Predicting Reflectance Functions from Complex Surfaces
    08 Detail mapping Steve Marschner CS5625 Spring 2019 Predicting Reflectance Functions from Complex Surfaces Stephen H. Westin James R. Arvo Kenneth E. Torrance Program of Computer Graphics Cornell University Ithaca, New York 14853 Hierarchy of scales Abstract 1000 macroscopic Geometry We describe a physically-based Monte Carlo technique for ap- proximating bidirectional reflectance distribution functions Object scale (BRDFs) for a large class of geometriesmesoscopic by directly simulating 100 optical scattering. The technique is more general than pre- vious analytical models: it removesmicroscopic most restrictions on sur- Texture, face microgeometry. Three main points are described: a new bump maps 10 representation of the BRDF, a Monte Carlo technique to esti- mate the coefficients of the representation, and the means of creating a milliscale BRDF from microscale scattering events. Milliscale These allow the prediction of scattering from essentially ar- (Mesoscale) 1 mm Texels bitrary roughness geometries. The BRDF is concisely repre- sented by a matrix of spherical harmonic coefficients; the ma- 0.1 trix is directly estimated from a geometric optics simulation, BRDF enforcing exact reciprocity. The method applies to rough- ness scales that are large with respect to the wavelength of Microscale light and small with respect to the spatial density at which 0.01 the BRDF is sampled across the surface; examples include brushed metal and textiles. The method is validated by com- paring with an existing scattering model and sample images are generated with a physically-based global illumination al- Figure 1: Applicability of Techniques gorithm. CR Categories and Subject Descriptors: I.3.7 [Computer model many surfaces, such as those with anisotropic rough- Graphics]: Three-Dimensional Graphics and Realism.
    [Show full text]
  • Procedural Modeling
    Procedural Modeling From Last Time • Many “Mapping” techniques – Bump Mapping – Normal Mapping – Displacement Mapping – Parallax Mapping – Environment Mapping – Parallax Occlusion – Light Mapping Mapping Bump Mapping • Use textures to alter the surface normal – Does not change the actual shape of the surface – Just shaded as if it were a different shape Sphere w/Diffuse Texture Swirly Bump Map Sphere w/Diffuse Texture & Bump Map Bump Mapping • Treat a greyscale texture as a single-valued height function • Compute the normal from the partial derivatives in the texture Another Bump Map Example Bump Map Cylinder w/Diffuse Texture Map Cylinder w/Texture Map & Bump Map Normal Mapping • Variation on Bump Mapping: Use an RGB texture to directly encode the normal http://en.wikipedia.org/wiki/File:Normal_map_example.png What's Missing? • There are no bumps on the silhouette of a bump-mapped or normal-mapped object • Bump/Normal maps don’t allow self-occlusion or self-shadowing From Last Time • Many “Mapping” techniques – Bump Mapping – Normal Mapping – Displacement Mapping – Parallax Mapping – Environment Mapping – Parallax Occlusion – Light Mapping Mapping Displacement Mapping • Use the texture map to actually move the surface point • The geometry must be displaced before visibility is determined Displacement Mapping Image from: Geometry Caching for Ray-Tracing Displacement Maps EGRW 1996 Matt Pharr and Pat Hanrahan note the detailed shadows cast by the stones Displacement Mapping Ken Musgrave a.k.a. Offset Mapping or Parallax Mapping Virtual Displacement Mapping • Displace the texture coordinates for each pixel based on view angle and value of the height map at that point • At steeper view-angles, texture coordinates are displaced more, giving illusion of depth due to parallax effects “Detailed shape representation with parallax mapping”, Kaneko et al.
    [Show full text]
  • Per-Pixel Displacement Mapping with Distance Functions
    108_gems2_ch08_new.qxp 2/2/2005 2:20 PM Page 123 Chapter 8 Per-Pixel Displacement Mapping with Distance Functions William Donnelly University of Waterloo In this chapter, we present distance mapping, a technique for adding small-scale dis- placement mapping to objects in a pixel shader. We treat displacement mapping as a ray-tracing problem, beginning with texture coordinates on the base surface and calcu- lating texture coordinates where the viewing ray intersects the displaced surface. For this purpose, we precompute a three-dimensional distance map, which gives a measure of the distance between points in space and the displaced surface. This distance map gives us all the information necessary to quickly intersect a ray with the surface. Our algorithm significantly increases the perceived geometric complexity of a scene while maintaining real-time performance. 8.1 Introduction Cook (1984) introduced displacement mapping as a method for adding small-scale detail to surfaces. Unlike bump mapping, which affects only the shading of surfaces, displacement mapping adjusts the positions of surface elements. This leads to effects not possible with bump mapping, such as surface features that occlude each other and nonpolygonal silhouettes. Figure 8-1 shows a rendering of a stone surface in which occlusion between features contributes to the illusion of depth. The usual implementation of displacement mapping iteratively tessellates a base sur- face, pushing vertices out along the normal of the base surface, and continuing until 8.1 Introduction 123 Copyright 2005 by NVIDIA Corporation 108_gems2_ch08_new.qxp 2/2/2005 2:20 PM Page 124 Figure 8-1. A Displaced Stone Surface Displacement mapping (top) gives an illusion of depth not possible with bump mapping alone (bottom).
    [Show full text]
  • Analytic Displacement Mapping Using Hardware Tessellation
    Analytic Displacement Mapping using Hardware Tessellation Matthias Nießner University of Erlangen-Nuremberg and Charles Loop Microsoft Research Displacement mapping is ideal for modern GPUs since it enables high- 1. INTRODUCTION frequency geometric surface detail on models with low memory I/O. How- ever, problems such as texture seams, normal re-computation, and under- Displacement mapping has been used as a means of efficiently rep- sampling artifacts have limited its adoption. We provide a comprehensive resenting and animating 3D objects with high frequency surface solution to these problems by introducing a smooth analytic displacement detail. Where texture mapping assigns color to surface points at function. Coefficients are stored in a GPU-friendly tile based texture format, u; v parameter values, displacement mapping assigns vector off- and a multi-resolution mip hierarchy of this function is formed. We propose sets. The advantages of this approach are two-fold. First, only the a novel level-of-detail scheme by computing per vertex adaptive tessellation vertices of a coarse (low frequency) base mesh need to be updated factors and select the appropriate pre-filtered mip levels of the displace- each frame to animate the model. Second, since the only connec- ment function. Our method obviates the need for a pre-computed normal tivity data needed is for the coarse base mesh, significantly less map since normals are directly derived from the displacements. Thus, we space is needed to store the equivalent highly detailed mesh. Fur- are able to perform authoring and rendering simultaneously without typical ther space reductions are realized by storing scalar, rather than vec- displacement map extraction from a dense triangle mesh.
    [Show full text]
  • Gpu-Based Normal Map Generation
    GPU-BASED NORMAL MAP GENERATION Jesús Gumbau, Carlos González Universitat Jaume I. Castellón, Spain Miguel Chover Universitat Jaume I. Castellón, Spain Keywords: GPU, normal maps, graphics hardware. Abstract: This work presents a method for the generation of normal maps from two polygonal models: a very detailed one with a high polygonal density, and a coarser one which will be used for real-time rendering. This method generates the normal map of the high resolution model which can be applied to the coarser model to improve its shading. The normal maps are completely generated on the graphics hardware. 1 INTRODUCTION a common texture coordinate system, this is not always the case and thus, it is not trivial to A normal map is a two-dimensional image whose implement on the graphics hardware. This is the contents are RGB colour elements which are reason why this kind of tools are often implemented interpreted as 3D vectors containing the direction of on software. the normal of the surface in each point. This is The high programmability of current graphics especially useful in real-time applications when this hardware allows for the implementation of these image is used as a texture applied onto a 3D model, kinds of methods on the GPU. This way, the great because normals for each point of a model can be scalability of the graphics hardware, which is specified without needing more geometry. This increased even more each year, can be used to feature enables the use of correct per-pixel lighting perform this task. using the Phong lighting equation.
    [Show full text]
  • LEAN Mapping
    LEAN Mapping Marc Olano∗ Dan Bakery Firaxis Games Firaxis Games (a) (b) (c) Figure 1: In-game views of a two-layer LEAN map ocean with sun just off screen to the right, and artist-selected shininess equivalent to a Blinn-Phong specular exponent of 13,777: (a) near, (b) mid, and (c) far. Note the lack of aliasing, even with an extremely high power. Abstract 1 Introduction For over thirty years, bump mapping has been an effective method We introduce Linear Efficient Antialiased Normal (LEAN) Map- for adding apparent detail to a surface [Blinn 1978]. We use the ping, a method for real-time filtering of specular highlights in bump term bump mapping to refer to both the original height texture that and normal maps. The method evaluates bumps as part of a shading defines surface normal perturbation for shading, and the more com- computation in the tangent space of the polygonal surface rather mon and general normal mapping, where the texture holds the ac- than in the tangent space of the individual bumps. By operat- tual surface normal. These methods are extremely common in video ing in a common tangent space, we are able to store information games, where the additional surface detail allows a rich visual ex- on the distribution of bump normals in a linearly-filterable form perience without complex high-polygon models. compatible with standard MIP and anisotropic filtering hardware. The necessary textures can be computed in a preprocess or gener- Unfortunately, bump mapping has serious drawbacks with filtering ated in real-time on the GPU for time-varying normal maps.
    [Show full text]
  • Real-Time Rendering of Normal Maps with Discontinuities
    Evgueni Parilov · Ilya Rosenberg · Denis Zorin Real-time rendering of normal maps with discontinuities CIMS Technical Report, TR2005-872 August, 2005 Abstract Normal mapping uses normal perturbations stored in a texture to give objects a more geometrically complex appearance without increasing the number of geometric primitives. Standard bi- and trilinear inter- polation of normal maps works well if the normal field is continuous, but may result in visible artifacts in the areas where the field is discontinuous, which is common for surfaces with creases and dents. In this paper we describe a real-time rendering technique which preserves the discontinuity curves of the normal field at sub-pixel level and its GPU implementation. Our representation of the piecewise-continuous normal field is based on approximations of the distance function to the discontinuity set and its gradient. Using these approximations we can efficiently reconstruct discontinuities at arbitrary resolution and ensure that no normals are interpolated across the discontinuity. We also described a method for updating the normal field along the discontinuities in real-time based on blending the original field with the one calculated from a user-defined surface profile. Keywords Interactive rendering · real-time normal mapping · discontinuous normal field · distance function approximation · constrained Laplacian smoothing 1 Introduction Bump and normal mapping is a widely used technique for adding complex small-scale geometric detail to models, in which only the normals are modified using perturbations stored in a texture. Bump mapping and related techniques were successfully applied in combination with a variety of rendering algorithms, and thanks to the advances in graphics hardware its use is becoming routine in interactive applications.
    [Show full text]
  • Review of Displacement Mapping Techniques and Optimization
    BLEKINGE TEKNISKA HÖGSKOLA Review of Displacement Mapping Techniques and Optimization Ermin Hrkalovic Mikael Lundgren 2012-05-01 Contents 1 Introduction .......................................................................................................................................... 3 2 Purpose and Objectives ........................................................................................................................ 4 3 Research Questions .............................................................................................................................. 4 4 Research Methodology ........................................................................................................................ 4 5 Normal Mapping ................................................................................................................................... 4 6 Relief Mapping ..................................................................................................................................... 5 7 Parallax Occlusion Mapping ................................................................................................................. 7 8 Quadtree Displacement Mapping ........................................................................................................ 8 9 Implementation .................................................................................................................................... 8 9.1 Optimization ...............................................................................................................................
    [Show full text]
  • IMAGE-BASED MODELING TECHNIQUES for ARTISTIC RENDERING Bynum Murray Iii Clemson University, [email protected]
    Clemson University TigerPrints All Theses Theses 5-2010 IMAGE-BASED MODELING TECHNIQUES FOR ARTISTIC RENDERING Bynum Murray iii Clemson University, [email protected] Follow this and additional works at: https://tigerprints.clemson.edu/all_theses Part of the Fine Arts Commons Recommended Citation Murray iii, Bynum, "IMAGE-BASED MODELING TECHNIQUES FOR ARTISTIC RENDERING" (2010). All Theses. 777. https://tigerprints.clemson.edu/all_theses/777 This Thesis is brought to you for free and open access by the Theses at TigerPrints. It has been accepted for inclusion in All Theses by an authorized administrator of TigerPrints. For more information, please contact [email protected]. IMAGE-BASED MODELING TECHNIQUES FOR ARTISTIC RENDERING A Thesis Presented to the Graduate School of Clemson University In Partial Fulfillment of the Requirements for the Degree Master of Arts Digital Production Arts by Bynum Edward Murray III May 2010 Accepted by: Timothy Davis, Ph.D. Committee Chair David Donar, M.F.A. Tony Penna, M.F.A. ABSTRACT This thesis presents various techniques for recreating and enhancing two- dimensional paintings and images in three-dimensional ways. The techniques include camera projection modeling, digital relief sculpture, and digital impasto. We also explore current problems of replicating and enhancing natural media and describe various solutions, along with their relative strengths and weaknesses. The importance of artistic skill in the implementation of these techniques is covered, along with implementation within the current industry applications Autodesk Maya, Adobe Photoshop, Corel Painter, and Pixologic Zbrush. The result is a set of methods for the digital artist to create effects that would not otherwise be possible.
    [Show full text]
  • An Overview Study of Game Engines
    Faizi Noor Ahmad Int. Journal of Engineering Research and Applications www.ijera.com ISSN : 2248-9622, Vol. 3, Issue 5, Sep-Oct 2013, pp.1673-1693 RESEARCH ARTICLE OPEN ACCESS An Overview Study of Game Engines Faizi Noor Ahmad Student at Department of Computer Science, ACNCEMS (Mahamaya Technical University), Aligarh-202002, U.P., India ABSTRACT We live in a world where people always try to find a way to escape the bitter realities of hubbub life. This escapism gives rise to indulgences. Products of such indulgence are the video games people play. Back in the past the term ―game engine‖ did not exist. Back then, video games were considered by most adults to be nothing more than toys, and the software that made them tick was highly specialized to both the game and the hardware on which it ran. Today, video game industry is a multi-billion-dollar industry rivaling even the Hollywood. The software that drives these three dimensional worlds- the game engines-have become fully reusable software development kits. In this paper, I discuss the specifications of some of the top contenders in video game engines employed in the market today. I also try to compare up to some extent these engines and take a look at the games in which they are used. Keywords – engines comparison, engines overview, engines specification, video games, video game engines I. INTRODUCTION 1.1.2 Artists Back in the past the term ―game engine‖ did The artists produce all of the visual and audio not exist. Back then, video games were considered by content in the game, and the quality of their work can most adults to be nothing more than toys, and the literally make or break a game.
    [Show full text]