Many of the figures from this book may be reproduced free of charge in scholarly articles, proceedings, and presentations, provided only that the following.

Slides:

Advertisements

Similar presentations

COMP 175 | COMPUTER GRAPHICS Remco Chang1/6103b – Shapes Lecture 03b: Shapes COMP 175: Computer Graphics February 3, 2015.

Advertisements

Sorce: Suggestive Contours for Conveying Shape. (SIGGRAPH 2003) Doug DeCarlo, Adam Finkelstein, Szymon Rusinkiewicz, Anthony Santella. 1 Suggestive Contours.

MECHANICAL DRAWING MULTIVIEW DRAWINGS.

3D Skeletons Using Graphics Hardware Jonathan Bilodeau Chris Niski.

Many of the figures from this book may be reproduced free of charge in scholarly articles, proceedings, and presentations, provided only that the following.

Descriptive Geometry:

CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2013.

Topographic Maps A Topographic map, or contour map is used to show the shape of the Earth’s surface. Elevation is the height above or below sea level.

11-1 Space Figures and Cross Sections

Graphics Programming: Polygon Filling

MSU CSE 803 Stockman1 CV: Perceiving 3D from 2D Many cues from 2D images enable interpretation of the structure of the 3D world producing them.

Advanced Visualization Techniques

© Dr Simin Nasseri Southern Polytechnic State University 1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

Multi-View Drawing (Text Chapter 8)

Multiview Drawing 5.00 Demonstrate orthographic projection techniques and principles as they apply to multiview drawings.

Many of the figures from this book may be reproduced free of charge in scholarly articles, proceedings, and presentations, provided only that the following.

1 Computer Graphics Week13 –Shading Models. Shading Models Flat Shading Model: In this technique, each surface is assumed to have one normal vector (usually.

Many of the figures from this book may be reproduced free of charge in scholarly articles, proceedings, and presentations, provided only that the following.

CS 450: Computer Graphics REVIEW: OVERVIEW OF POLYGONS

C O M P U T E R G R A P H I C S Stuff Jian Chen January 15, 2010 Transformations 1/10 Describing Shape By Andries van Dam.

Implementing the 7 th Grade GPS: Constructions, Transformations, and Three-Dimensional Figures Presented by Judy O’Neal North Georgia.

CS 325 Introduction to Computer Graphics 03 / 08 / 2010 Instructor: Michael Eckmann.

ENTC 1110 OBLIQUE PICTORIALS.

Many of the figures from this book may be reproduced free of charge in scholarly articles, proceedings, and presentations, provided only that the following.

Many of the figures from this book may be reproduced free of charge in scholarly articles, proceedings, and presentations, provided only that the following.

Hidden Surface Removal 1.  Suppose that we have the polyhedron which has 3 totally visible surfaces, 4 totally invisible/hidden surfaces, and 1 partially.

Many of the figures from this book may be reproduced free of charge in scholarly articles, proceedings, and presentations, provided only that the following.

Many of the figures from this book may be reproduced free of charge in scholarly articles, proceedings, and presentations, provided only that the following.

Many of the figures from this book may be reproduced free of charge in scholarly articles, proceedings, and presentations, provided only that the following.

CSE554Fairing and simplificationSlide 1 CSE 554 Lecture 6: Fairing and Simplification Fall 2012.

Copyright © 2010 Pearson Education, Inc. All rights reserved. 4.5 – Slide 1.

Many of the figures from this book may be reproduced free of charge in scholarly articles, proceedings, and presentations, provided only that the following.

Many of the figures from this book may be reproduced free of charge in scholarly articles, proceedings, and presentations, provided only that the following.

CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2015.

Many of the figures from this book may be reproduced free of charge in scholarly articles, proceedings, and presentations, provided only that the following.

Vertices, Edges and Faces By Jordan Diamond. Vertices In geometry, a vertices is a special kind of point which describes the corners or intersections.

Mapping. What is a map? It is a representation of something (Earth, stars, solar system, a building, etc… It is a representation of something (Earth,

Many of the figures from this book may be reproduced free of charge in scholarly articles, proceedings, and presentations, provided only that the following.

Many of the figures from this book may be reproduced free of charge in scholarly articles, proceedings, and presentations, provided only that the following.

Many of the figures from this book may be reproduced free of charge in scholarly articles, proceedings, and presentations, provided only that the following.

Many of the figures from this book may be reproduced free of charge in scholarly articles, proceedings, and presentations, provided only that the following.

PHS 120 TOPOGRAPHIC MAP BASICS

SANTANA DRAFTING MULTIVIEWS 1 An introduction Mr. Fitzgerald Rm

Many of the figures from this book may be reproduced free of charge in scholarly articles, proceedings, and presentations, provided only that the following.

Many of the figures from this book may be reproduced free of charge in scholarly articles, proceedings, and presentations, provided only that the following.

Unit 2 Measuring the Earth Mapping. Size and Shape Almost a perfect sphere- slight flattening in the polar regions and a slight bulging at the equatorial.

1 CSCE 441: Computer Graphics Hidden Surface Removal Jinxiang Chai.

Many of the figures from this book may be reproduced free of charge in scholarly articles, proceedings, and presentations, provided only that the following.

Many of the figures from this book may be reproduced free of charge in scholarly articles, proceedings, and presentations, provided only that the following.

Many of the figures from this book may be reproduced free of charge in scholarly articles, proceedings, and presentations, provided only that the following.

Many of the figures from this book may be reproduced free of charge in scholarly articles, proceedings, and presentations, provided only that the following.

Orthographic Projection Review: -Projections -Orthographic projections Home work: -Glass Box Unfolded -Multiview Projection Simple (duplicate) - Lettering.

Many of the figures from this book may be reproduced free of charge in scholarly articles, proceedings, and presentations, provided only that the following.

Many of the figures from this book may be reproduced free of charge in scholarly articles, proceedings, and presentations, provided only that the following.

Illumination and Shading. Illumination (Lighting) Model the interaction of light with surface points to determine their final color and brightness OpenGL.

Many of the figures from this book may be reproduced free of charge in scholarly articles, proceedings, and presentations, provided only that the following.

Many of the figures from this book may be reproduced free of charge in scholarly articles, proceedings, and presentations, provided only that the following.

Many of the figures from this book may be reproduced free of charge in scholarly articles, proceedings, and presentations, provided only that the following.

Constructing Objects in Computer Graphics By Andries van Dam©

Many of the figures from this book may be reproduced free of charge in scholarly articles, proceedings, and presentations, provided only that the following.

Multiview drawings AC-IDD-5. Students will create technical freehand sketches. AC-IDD-11. Students will use orthographic projection to create and dimension.

Many of the figures from this book may be reproduced free of charge in scholarly articles, proceedings, and presentations, provided only that the following.

Many of the figures from this book may be reproduced free of charge in scholarly articles, proceedings, and presentations, provided only that the following.

Inequalities in Two Variables

Many of the figures from this book may be reproduced free of charge in scholarly articles, proceedings, and presentations, provided only that the following.

Many of the figures from this book may be reproduced free of charge in scholarly articles, proceedings, and presentations, provided only that the following.

Orthographic Projection

Presentation transcript:

Many of the figures from this book may be reproduced free of charge in scholarly articles, proceedings, and presentations, provided only that the following citation is clearly indicated: “Reproduced with the permission of the publisher from Computer Graphics: Principles and Practice, Third Edition, by John F. Hughes, Andries van Dam, Morgan McGuire, David F. Sklar, James D. Foley, Steven K. Feiner, and Kurt Akeley. Copyright 2014 by Pearson Education, Inc.” Reproduction for any use other than as stated above requires the written permission of Pearson Education, Inc. Reproduction of any figure that bears a copyright notice other than that of Pearson Education, Inc., requires the permission of that copyright holder.

From Computer Graphics, Third Edition, by John F. Hughes, Andries van Dam, Morgan McGuire, David F. Sklar, James D. Foley, Steven K. Feiner, and Kurt Akeley (ISBN-13: ). Copyright © 2014 by Pearson Education, Inc. All rights reserved. Figure 25.1 A triangle strip is represented by a stream of vertex indices; every group of three adjacent indices describes another triangle in the strip. The communication attributable to a typical triangle is therefore just a single vertex index, rather than three vertex indices.

From Computer Graphics, Third Edition, by John F. Hughes, Andries van Dam, Morgan McGuire, David F. Sklar, James D. Foley, Steven K. Feiner, and Kurt Akeley (ISBN-13: ). Copyright © 2014 by Pearson Education, Inc. All rights reserved. Figure 25.2 Polygonal meshes used to represent a cube, a teapot, and a smooth, wavy surface.

From Computer Graphics, Third Edition, by John F. Hughes, Andries van Dam, Morgan McGuire, David F. Sklar, James D. Foley, Steven K. Feiner, and Kurt Akeley (ISBN-13: ). Copyright © 2014 by Pearson Education, Inc. All rights reserved. Figure 25.3 A small mesh with interior edges drawn in green and boundary edges drawn in blue. The red edge, which is not adjacent to any faces, is a “dangling” edge and is not allowed in our meshes.

From Computer Graphics, Third Edition, by John F. Hughes, Andries van Dam, Morgan McGuire, David F. Sklar, James D. Foley, Steven K. Feiner, and Kurt Akeley (ISBN-13: ). Copyright © 2014 by Pearson Education, Inc. All rights reserved. Figure 25.4 The red vertex marked with a dot in the top mesh is an interior vertex; the one in the bottom mesh is a boundary vertex.

From Computer Graphics, Third Edition, by John F. Hughes, Andries van Dam, Morgan McGuire, David F. Sklar, James D. Foley, Steven K. Feiner, and Kurt Akeley (ISBN-13: ). Copyright © 2014 by Pearson Education, Inc. All rights reserved. Figure 25.5 Each of these fails to be a surface mesh in some way.

From Computer Graphics, Third Edition, by John F. Hughes, Andries van Dam, Morgan McGuire, David F. Sklar, James D. Foley, Steven K. Feiner, and Kurt Akeley (ISBN-13: ). Copyright © 2014 by Pearson Education, Inc. All rights reserved. Figure 25.6 Two oriented adjacent faces, (2, 3, 7) and (7, 3, 4). The oriented edge (3, 7) is in the boundary of the first face, while (7, 3) is in the boundary of the second.

From Computer Graphics, Third Edition, by John F. Hughes, Andries van Dam, Morgan McGuire, David F. Sklar, James D. Foley, Steven K. Feiner, and Kurt Akeley (ISBN-13: ). Copyright © 2014 by Pearson Education, Inc. All rights reserved. Figure 25.7 The point P is on the same side of the plane J as C, and therefore may be in the triangle ABC. If it passes corresponding tests for planes containing the edges BC and CA, we know it’s in the triangle.

From Computer Graphics, Third Edition, by John F. Hughes, Andries van Dam, Morgan McGuire, David F. Sklar, James D. Foley, Steven K. Feiner, and Kurt Akeley (ISBN-13: ). Copyright © 2014 by Pearson Education, Inc. All rights reserved. Figure 25.8 The star of a simplex consists of all simplices containing it.

From Computer Graphics, Third Edition, by John F. Hughes, Andries van Dam, Morgan McGuire, David F. Sklar, James D. Foley, Steven K. Feiner, and Kurt Akeley (ISBN-13: ). Copyright © 2014 by Pearson Education, Inc. All rights reserved. Figure 25.9 The 1-ring of V is drawn in large red dots; the 2-ring in smaller green dots.

From Computer Graphics, Third Edition, by John F. Hughes, Andries van Dam, Morgan McGuire, David F. Sklar, James D. Foley, Steven K. Feiner, and Kurt Akeley (ISBN-13: ). Copyright © 2014 by Pearson Education, Inc. All rights reserved. Figure The star of the top vertex is drawn in brown; the 1-ring, which forms an octagon in the middle level, in red. The 2-ring, at the bottom drawn in bright green, is connected into a figure-eight shape.

From Computer Graphics, Third Edition, by John F. Hughes, Andries van Dam, Morgan McGuire, David F. Sklar, James D. Foley, Steven K. Feiner, and Kurt Akeley (ISBN-13: ). Copyright © 2014 by Pearson Education, Inc. All rights reserved. Figure (Top) A mesh with bad self-intersections. (Middle) A mesh in which a vertex of the pink face at the right lies in the middle of an edge of the green face at the top right. (Bottom) The red vertex marked with a dot is a T-junction.

From Computer Graphics, Third Edition, by John F. Hughes, Andries van Dam, Morgan McGuire, David F. Sklar, James D. Foley, Steven K. Feiner, and Kurt Akeley (ISBN-13: ). Copyright © 2014 by Pearson Education, Inc. All rights reserved. Figure A see-through view of the torso and arm of a simple robot character.

From Computer Graphics, Third Edition, by John F. Hughes, Andries van Dam, Morgan McGuire, David F. Sklar, James D. Foley, Steven K. Feiner, and Kurt Akeley (ISBN-13: ). Copyright © 2014 by Pearson Education, Inc. All rights reserved. Figure In this simple model of Earth, a small disk around the North Pole projects injectively onto a disk in the horizontal tangent plane to the North Pole.

From Computer Graphics, Third Edition, by John F. Hughes, Andries van Dam, Morgan McGuire, David F. Sklar, James D. Foley, Steven K. Feiner, and Kurt Akeley (ISBN-13: ). Copyright © 2014 by Pearson Education, Inc. All rights reserved. Figure Projection from the mesh onto any plane passing through the central red vertex will not be injective. The large green vertices are closer to the eye; the small aqua ones are farther away.

From Computer Graphics, Third Edition, by John F. Hughes, Andries van Dam, Morgan McGuire, David F. Sklar, James D. Foley, Steven K. Feiner, and Kurt Akeley (ISBN-13: ). Copyright © 2014 by Pearson Education, Inc. All rights reserved. Figure The slices of a torus are smooth (blue) except at the min, max, and the two “critical” levels where the slices are figure-eights (red).

From Computer Graphics, Third Edition, by John F. Hughes, Andries van Dam, Morgan McGuire, David F. Sklar, James D. Foley, Steven K. Feiner, and Kurt Akeley (ISBN-13: ). Copyright © 2014 by Pearson Education, Inc. All rights reserved. Figure The front wall of a building, seen from above. Notice the narrow embossed portion of the wall in the center. The sides of this embossment will reflect light from the east or west, while the rest of the wall will not.

From Computer Graphics, Third Edition, by John F. Hughes, Andries van Dam, Morgan McGuire, David F. Sklar, James D. Foley, Steven K. Feiner, and Kurt Akeley (ISBN-13: ). Copyright © 2014 by Pearson Education, Inc. All rights reserved. Figure The BRDF of the wall, drawn for light coming from the east, south, and west.

From Computer Graphics, Third Edition, by John F. Hughes, Andries van Dam, Morgan McGuire, David F. Sklar, James D. Foley, Steven K. Feiner, and Kurt Akeley (ISBN-13: ). Copyright © 2014 by Pearson Education, Inc. All rights reserved. Figure Two irregularly shaped objects overlap; when we simplify each one, getting rid of small details, the space between the objects remains as a small detail, unrecognized by our simplification process.

From Computer Graphics, Third Edition, by John F. Hughes, Andries van Dam, Morgan McGuire, David F. Sklar, James D. Foley, Steven K. Feiner, and Kurt Akeley (ISBN-13: ). Copyright © 2014 by Pearson Education, Inc. All rights reserved. Figure A curve, represented in a wavelet basis, consists of large- and small- scale features. The small-scale features—the “character” of the curve—can be edited without affecting the large-scale shape, and vice versa. (Courtesy of Adam Finkelstein and David H. Salesin, ©1994 ACM, Inc. Reprinted by permission.)

From Computer Graphics, Third Edition, by John F. Hughes, Andries van Dam, Morgan McGuire, David F. Sklar, James D. Foley, Steven K. Feiner, and Kurt Akeley (ISBN-13: ). Copyright © 2014 by Pearson Education, Inc. All rights reserved. Figure The edge from u to v has been collapsed to a single new vertex, which is labeled w. The two triangles that meet this edge have disappeared, and the four non-uv edges have collapsed into two edges. The set of triangles shown is called the neighborhood of the edge.

From Computer Graphics, Third Edition, by John F. Hughes, Andries van Dam, Morgan McGuire, David F. Sklar, James D. Foley, Steven K. Feiner, and Kurt Akeley (ISBN-13: ). Copyright © 2014 by Pearson Education, Inc. All rights reserved. Figure An edge-collapse can be made gradually, by interpolating from the original positions of u and v part of the way toward the final position w.

From Computer Graphics, Third Edition, by John F. Hughes, Andries van Dam, Morgan McGuire, David F. Sklar, James D. Foley, Steven K. Feiner, and Kurt Akeley (ISBN-13: ). Copyright © 2014 by Pearson Education, Inc. All rights reserved. Figure The value of “spring” energy: If we try to fit the six data points on a circle (marked with small dots) using a triangle with short edges, the green triangle (top) is a reasonably good solution. If we remove the short-edge constraint, the red triangle (bottom) is a “perfect” fit, even though it violates our expectations.

From Computer Graphics, Third Edition, by John F. Hughes, Andries van Dam, Morgan McGuire, David F. Sklar, James D. Foley, Steven K. Feiner, and Kurt Akeley (ISBN-13: ). Copyright © 2014 by Pearson Education, Inc. All rights reserved. Figure Knowing function values at grid points, we can estimate zero-crossings (black dots) by linear interpolation, and then connect the dots, in each cell, to estimate the level curve at level zero.

From Computer Graphics, Third Edition, by John F. Hughes, Andries van Dam, Morgan McGuire, David F. Sklar, James D. Foley, Steven K. Feiner, and Kurt Akeley (ISBN-13: ). Copyright © 2014 by Pearson Education, Inc. All rights reserved. Figure We can estimate gradients at the zero- crossings as well. Fitting a surface to the point-and- direction data gives a different estimate of the level-set.

From Computer Graphics, Third Edition, by John F. Hughes, Andries van Dam, Morgan McGuire, David F. Sklar, James D. Foley, Steven K. Feiner, and Kurt Akeley (ISBN-13: ). Copyright © 2014 by Pearson Education, Inc. All rights reserved. Figure The normals at the two zero-crossings determine two lines, which intersect at a new point X.

From Computer Graphics, Third Edition, by John F. Hughes, Andries van Dam, Morgan McGuire, David F. Sklar, James D. Foley, Steven K. Feiner, and Kurt Akeley (ISBN-13: ). Copyright © 2014 by Pearson Education, Inc. All rights reserved. Figure (Following [Ju04], Figure 3.) Ju’s model-repair method. (a) A model, embedded in a fine grid. (b) The grid edges that intersect the model, stored in an oct tree. Each cell touches an even number of such edges. (c) Signs at grid points (indicated by light or dark shading) generated from the set of intersection edges. (d) The model reconstructed by contouring the sign data.

From Computer Graphics, Third Edition, by John F. Hughes, Andries van Dam, Morgan McGuire, David F. Sklar, James D. Foley, Steven K. Feiner, and Kurt Akeley (ISBN-13: ). Copyright © 2014 by Pearson Education, Inc. All rights reserved. Figure The U-shaped polygon soup generates several edges, but there’s no way to consistently assign signs to the grid cells so that each intersection edge exhibits a sign change. Cells with good labelings—most of the ones meeting the polyline—are in green. The problem arises at cells (in orange at the ends of the polyline) with an odd number of intersection edges.

From Computer Graphics, Third Edition, by John F. Hughes, Andries van Dam, Morgan McGuire, David F. Sklar, James D. Foley, Steven K. Feiner, and Kurt Akeley (ISBN-13: ). Copyright © 2014 by Pearson Education, Inc. All rights reserved. Figure The vertex v i is surrounded by a ring of vertices, one of which is v j ; the angles on either side of v j are called α and β. The cotangents of these angles are used in defining the weight of v j in the cotangent Laplacian vector at v i.

From Computer Graphics, Third Edition, by John F. Hughes, Andries van Dam, Morgan McGuire, David F. Sklar, James D. Foley, Steven K. Feiner, and Kurt Akeley (ISBN-13: ). Copyright © 2014 by Pearson Education, Inc. All rights reserved. Figure We start with a source and a target mesh, shown at left, a triangle-by-triangle correspondence between them (in this case, the correspondence is the fairly obvious one), and a deformation of the source mesh, shown at the top right. The deformation transfer algorithm provides a transformation of the target mesh that’s analogous to the deformation of the source mesh. (Courtesy of Robert Sumner and Jovan Popović.)

From Computer Graphics, Third Edition, by John F. Hughes, Andries van Dam, Morgan McGuire, David F. Sklar, James D. Foley, Steven K. Feiner, and Kurt Akeley (ISBN-13: ). Copyright © 2014 by Pearson Education, Inc. All rights reserved. Figure The sort order of the blue and red polygons is immaterial because of backface culling; the blue polygon obscures the green from some viewpoints, but the green never obscures the blue.

From Computer Graphics, Third Edition, by John F. Hughes, Andries van Dam, Morgan McGuire, David F. Sklar, James D. Foley, Steven K. Feiner, and Kurt Akeley (ISBN-13: ). Copyright © 2014 by Pearson Education, Inc. All rights reserved. Figure Drawing the rooftop regions of the building in increasing numerical order, and using backface culling, will prevent overdraw no matter what the viewpoint.

From Computer Graphics, Third Edition, by John F. Hughes, Andries van Dam, Morgan McGuire, David F. Sklar, James D. Foley, Steven K. Feiner, and Kurt Akeley (ISBN-13: ). Copyright © 2014 by Pearson Education, Inc. All rights reserved. Figure An eight-triangle building block.