1. Introduction to Computer Graphics: Object Representation Rama C Hoetzlein, 2010 Univ. of California Santa Barbara Lecture Notes

2. Mathematical definition: Surface A subset of points in R, which span a local two-dimensional space at each point. For any given point in the set, there are two directions in which another point in the set is infinitely close. 3

3. What are some natural examples of surfaces that are... - Open Surfaces with no interior - Closed Surfaces which have an interior - Disjoint Surfaces with distinct parts (C0 discontinuous) - Rough Surfaces with angles (C1 discontinuous) - Smooth Surfaces which are locally smooth (C1 smooth) - Self-similar Surfaces which are similar at different scales - Implicit Surfaces with no sharp boundaries - Analytical Surfaces defined by a closed mathematical func. - Revolved Surfaces created by sweeping a curve about an axis - Loft Surfaces created by sweeping a curve along a path

4. Three most common in Computer Graphics: Implicit surfaces...... f(x,y,z) = R (eg. Metablobs) Curved surfaces....... f(u, v) => R (eg. NURBS) Polygonal surfaces... M = {V, E, F} (eg. Meshes) Object Representation 1 1 3

5. Implicit Surfaces f(x,y,z) = R A function of three variables is defined which maps every point in space to a scalar value. Selecting a range of values defines a volume, while selecting a single value defines a surface. 1

6. Blob functions add together Metaballs: One kind of Implicit Surface f(x,y,z) =

7. James Blinn, “A Generalization of Algebraic Surface Drawing”, 1982

8. Implicit Surface Implicit Surfaces - Rendering Option 1: Raytrace the function Option 2: Convert to polygons (Marching Cubes)

9. Curved Surfaces f(u, v) => R A two-dimensional function is defined with maps two parametric variables to a point in 3D space. There are many ways that f(u,v) could be defined. 3

13. Curved Surfaces - Key points define the shape of an explicit function. - Properties: Infinitely divisible Everywhere smooth Easy to control

15. Utah Teapot Alan Newell, 1975

16. Curved surfaces have revolutionized the automotive and film industry by simplifying complex shapes. (Prior to this, only way was to explicitly specify all vertices.) Geri’s Game, 1997 (Pixar), First sub-division surfaces.

17. M = {V, E, F} Polygonal Surfaces Defined as a discrete set of vertices, edges and faces which connected together create a locus of points defining a surface.

19. Polygonal Surfaces A mesh is a discrete representation of a surface. - Surface is broken into vertices, edges, and faces. - Vertices = Subset of S sampled at discrete locations.

20. Stanford Bunny Greg Turk & Marc Levoy, 1994 3D scanned mesh, 69,451 triangles

21. Paolo Uccello Perspective drawing of a Challice (ca. 1450)

22. - Just describe the vertices. We also need their connectivity. - How do you know what the faces are?

23. Colin Smith, On Vertex-Vertex Systems and Their Use in Geometric and Biological Modeling, 2006.

24. - Make faces explicit. Each face indexes vertices. - Most common in graphics hardware. Const time face geometry.

25. Mesh storage... Example PLY files: - Number of vertices - Number of faces - Each vertex has a list of properties. In this case, x/y/z. Vertex could also have a color, or texture coordinate. - Each face is an index of vertices. (This example: 3-sided faces only)

26. Mesh Operations What do you need to do for? 1. Adding a vertex 2. Deleting a vertex 3. Adding a face 4. Deleting a face

27. Winged Edge Meshes - More storage space - Each edge has: 2 vertices 2 faces - But... we can now find neighboring vertices and faces in constant time.

28. Each representation makes more information explicit... giving constant-time lookups at the cost of storage space.

29. Many Operations Add/Remove Noise Face Extrusion Subdivision Find Silouettes Simplification Change Representation