CS380: Computer Graphics Modeling Transformations. Sung-Eui Yoon ( 윤성의 ) Course URL:

Size: px
Start display at page:

Download "CS380: Computer Graphics Modeling Transformations. Sung-Eui Yoon ( 윤성의 ) Course URL:"

Transcription

1 CS38: Computer Grphics Modeling Trnsformtions Sung-Eui Yoon ( 윤성의 ) Course URL:

2 Clss Ojectives (Ch. 3.5) Know the clssic dt processing steps, rendering pipeline, for rendering primitives Understnd 3D trnsltions nd rottions 2

3 Outline Where re we going? Snek peek t the rendering pipeline Vector lger Modeling trnsformtion Viewing trnsformtion Projections 3

4 The Clssic Rendering Pipeline Oject primitives defined y vertices fed in t the top Pixels come out in the disply t the ottom Commonly hve multiple primitives in vrious stges of rendering 4

5 Modeling Trnsforms 5 Strt with 3D models defined in modeling spces with their own t t t modeling frmes: m 1,m 2,..., m n Modeling trnsformtions orient models within common coordinte frme t clled world spce, w All ojects, light sources, nd the cmer live in world spce Trivil rejection ttempts to eliminte ojects tht cnnot possily e seen An optimiztion

6 Illumintion Illuminte potentilly visile ojects Finl rendered color is determined y oject s orienttion, its mteril properties, nd the light sources in the scene 6

7 Viewing Trnsformtions Mps points from world spce to eye spce: t e = w V Viewing position is trnsformed to the origin Viewing direction is oriented long some xis t 7

8 Clipping nd Projection We specify volume clled viewing frustum Mp the view frustum to the unit cue Clip ojects ginst the view volume, therey eliminting geometry not visile in the imge Project ojects into two-dimensions Trnsform from eye spce to normlized device coordintes 8

9 Rsteriztion nd Disply Trnsform normlized device coordintes to screen spce Rsteriztion converts ojects pixels - Almost every step in the rendering pipeline involves chnge of coordinte systems! - Trnsformtions re centrl to understnding 3D computer grphics 9

10 But, this is rchitecturl overview of recent GPU (Fermi) Unified rchitecture Highly prllel Support CUDA (generl lnguge) Wide memory ndwidth 1

11 11 But, this is rchitecturl overview of recent GPU

12 12 Recent CPU Chips (Intel s Core i7 processors)

13 Vector Alger We lredy sw vector ddition nd multiplictions y sclr Will study three kinds of vector multiplictions Dot product ( ) Cross product ( ) Tensor product ( ) - returns sclr - returns vector - returns mtrix 13

14 14 Dot Product ( ) Returns sclr s Geometric interprettions s: Length of projected onto nd or vice vers Distnce of from the origin in the direction of [ ] [ ] s 1 s, z y x z y x T z y x z y x T = = = = cosθ = θ cosθ

15 15 Cross Product ( ) Return vector tht is perpendiculr to oth nd, oriented ccording to the right-hnd rule The mtrix is clled the skew-symmetric mtrix of c c c z y x x y x z y z = = = [ ] x y y x z x x z y z z y c = c

16 Cross Product ( ) A mnemonic device for rememering the cross-product 16

17 Modeling Trnsformtions Vst mjority of trnsformtions re modeling trnsforms Generlly fll into one of two clsses Trnsforms tht move prts within the model t t m c m Mc = c t 1 1 m1 Trnsforms tht relte locl model s frme to the scene s world frme t t m 1c m 1Mc = w t c 17 Usully, Eucliden trnsforms, 3D rigidody trnsforms, re needed

18 18 Trnsltions Trnslte points y dding offsets to their coordintes The effect of this trnsltion: = = = 1 t 1 t 1 t 1 T where w c m Tc m c m c m Tc m c z y x t t t t t t

19 3D Rottions More complicted thn 2D rottions Rotte ojects long rottion xis Severl pproches Compose three cnonicl rottions out the xes Quternions 19

20 Geometry of Rottion Nturl sis for rottion of vector out specified xis: 2

21 21 Geometry of Rottion

22 Tensor Product ( ) 22 Cretes mtrix tht when pplied to vector c return scled y the project of onto c

23 Tensor Product ( ) Useful when = The mtrix is clled the symmetric mtrix of We shll denote this A 23 = ( ) c = ( c)

24 24 Snity Check Consider rottion y out the x-xis You cn check it in ny computer grphics ook, ut you don t need to memorize it θ θ θ θ sin 1 1 ) cos (1 1 cos ), 1 ( = Rotte = 1 cos sin sin cos 1 θ θ θ θ

25 25 Rottion using Affine Trnsformtion â x x [ ] 1 ˆ t s o x [ ] 1 ˆ t s o R x x θ s t Assume tht these sis vectors re normlized

26 Quternion Developed y W. Hmilton in 1843 Bsed on complex numers Two populr nottions for quternion, q w + xi + yj + zk, where i 2 = j 2 = k 2 = ijk = -1 [w, v], where w is sclr nd v is vector Conversion from the xis, v, nd ngle, t q = [cos (t/2), sin (t/2) v] Cn represent rottion Exmple: rotte y degree long x xis: q x = [cos (/2), sin(/2) (1,, )] 26

27 Bsic Quternion Opertions Addition q + q = [w + w, v + v ] Multipliction qq = [ww -v v, v x v + wv +w v] Conjugte q* = [w, -v] Norm N(q) = w 2 + x 2 + y 2 + z 2 Inverse q -1 = q* / N(q) 27

28 Bsic Quternion Opertions q is unit quternion if N(q)= 1 Then q -1 = q* Identity [1, (,, )] for multipliction [, (,, )] for ddition 28

29 Rottions using Quternions Suppose tht you wnt to rotte vector/point v with q Then, the rotted v v = q r q -1, where r = [, v]) Compositing rottions R = R2 R1 (rottion R1 followed y rottion R2) 29

30 Quternion to Rottion Mtrix Q = w + xi + yj + zk R m = 1-2y 2-2z 2 2xy-2wz 2xz+2wy 2xy+2wz 1-2x 2-2z 2 2yz-2wx 2xz-2wy 2yz+2wx 1-2x 2-2y 2 We cn lso convert rottion mtrix to quternion 3

31 Advntge of Quternions More efficient wy to generte ritrry rottions Less storge thn 4 x 4 mtrix Esier for smooth rottion Numericlly more stle thn 4x4 mtrix (e.g., no drifting issue) More redle 31

32 Clss Ojectives were: Know the clssic dt processing steps, rendering pipeline, for rendering primitives Understnd 3D trnsltions nd rottions 32

33 33 PA2: Simple Animtion & Trnsformtion

34 OpenGL: Disply Lists Disply lists A group of OpenGL commnds stored for lter executions Cn e optimized in the grphics hrdwre Thus, cn show higher performnce Ver. 4.3: Vertex Arry Oject is much etter Immedite mode Cuses commnds to e executed immeditely 34

35 An Exmple 35 void drwcow() { if (frme == ) { cow = new WveFrontOBJ( "cow.oj" ); cowid = glgenlists(1); glnewlist(cowid, GL_COMPILE); cow->drw(); glendlist(); }.. glclllist(cowid);.. }

36 API for Disply Lists Gluint glgenlists (rnge) - generte continuous set of empty disply lists void glnewlist (list, mode) & glendlist () : specify the eginning nd end of disply list void glclllists (list) : execute the specified disply list 36

37 OpenGL: Getting Informtion from OpenGL void min( int rgc, chr* rgv[] ) { int rv,gv,v; glgetintegerv(gl_red_bits,&rv); glgetintegerv(gl_green_bits,&gv); glgetintegerv(gl_blue_bits,&v); printf( "Pixel colors = %d : %d : %d\n", rv, gv, v );. } void disply () {.. glgetdoulev(gl_modelview_matrix, cow2wld.mtrix());.. } 37

38 Homework Wtch SIGGRAPH Videos Go over the next lecture slides 38

39 Next Time Viewing trnsformtions 39

Geometric transformations

Geometric transformations Geometric trnsformtions Computer Grphics Some slides re bsed on Shy Shlom slides from TAU mn n n m m T A,,,,,, 2 1 2 22 12 1 21 11 Rows become columns nd columns become rows nm n n m m A,,,,,, 1 1 2 22

More information

Topic 3: 2D Transformations 9/10/2016. Today s Topics. Transformations. Lets start out simple. Points as Homogeneous 2D Point Coords

Topic 3: 2D Transformations 9/10/2016. Today s Topics. Transformations. Lets start out simple. Points as Homogeneous 2D Point Coords Tody s Topics 3. Trnsformtions in 2D 4. Coordinte-free geometry 5. (curves & surfces) Topic 3: 2D Trnsformtions 6. Trnsformtions in 3D Simple Trnsformtions Homogeneous coordintes Homogeneous 2D trnsformtions

More information

Stained Glass Design. Teaching Goals:

Stained Glass Design. Teaching Goals: Stined Glss Design Time required 45-90 minutes Teching Gols: 1. Students pply grphic methods to design vrious shpes on the plne.. Students pply geometric trnsformtions of grphs of functions in order to

More information

MA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork

MA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork MA1008 Clculus nd Liner Algebr for Engineers Course Notes for Section B Stephen Wills Deprtment of Mthemtics University College Cork s.wills@ucc.ie http://euclid.ucc.ie/pges/stff/wills/teching/m1008/ma1008.html

More information

Rigid Body Transformations

Rigid Body Transformations igid od Kinemtics igid od Trnsformtions Vij Kumr igid od Kinemtics emrk out Nottion Vectors,,, u, v, p, q, Potentil for Confusion! Mtrices,, C, g, h, igid od Kinemtics The vector nd its skew smmetric mtri

More information

Viewing and Projection

Viewing and Projection 15-462 Computer Grphics I Lecture 5 Viewing nd Projection Sher Trnsformtion Cmer Positioning Simple Prllel Projections Simple Perspective Projections [Angel, Ch. 5.2-5.4] Jnury 30, 2003 [Red s Drem, Pixr,

More information

6.3 Volumes. Just as area is always positive, so is volume and our attitudes towards finding it.

6.3 Volumes. Just as area is always positive, so is volume and our attitudes towards finding it. 6.3 Volumes Just s re is lwys positive, so is volume nd our ttitudes towrds finding it. Let s review how to find the volume of regulr geometric prism, tht is, 3-dimensionl oject with two regulr fces seprted

More information

1 Drawing 3D Objects in Adobe Illustrator

1 Drawing 3D Objects in Adobe Illustrator Drwing 3D Objects in Adobe Illustrtor 1 1 Drwing 3D Objects in Adobe Illustrtor This Tutoril will show you how to drw simple objects with three-dimensionl ppernce. At first we will drw rrows indicting

More information

Orientation & Quaternions. CSE169: Computer Animation Instructor: Steve Rotenberg UCSD, Winter 2017

Orientation & Quaternions. CSE169: Computer Animation Instructor: Steve Rotenberg UCSD, Winter 2017 Orienttion & Quternions CSE69: Computer Animtion Instructor: Steve Rotenberg UCSD, Winter 7 Orienttion Orienttion We will define orienttion to men n object s instntneous rottionl configurtion Think of

More information

Lecture 5: Spatial Analysis Algorithms

Lecture 5: Spatial Analysis Algorithms Lecture 5: Sptil Algorithms GEOG 49: Advnced GIS Sptil Anlsis Algorithms Bsis of much of GIS nlsis tod Mnipultion of mp coordintes Bsed on Eucliden coordinte geometr http://stronom.swin.edu.u/~pbourke/geometr/

More information

ZZ - Advanced Math Review 2017

ZZ - Advanced Math Review 2017 ZZ - Advnced Mth Review Mtrix Multipliction Given! nd! find the sum of the elements of the product BA First, rewrite the mtrices in the correct order to multiply The product is BA hs order x since B is

More information

10.5 Graphing Quadratic Functions

10.5 Graphing Quadratic Functions 0.5 Grphing Qudrtic Functions Now tht we cn solve qudrtic equtions, we wnt to lern how to grph the function ssocited with the qudrtic eqution. We cll this the qudrtic function. Grphs of Qudrtic Functions

More information

CS 430 Spring Mike Lam, Professor. Parsing

CS 430 Spring Mike Lam, Professor. Parsing CS 430 Spring 2015 Mike Lm, Professor Prsing Syntx Anlysis We cn now formlly descrie lnguge's syntx Using regulr expressions nd BNF grmmrs How does tht help us? Syntx Anlysis We cn now formlly descrie

More information

Modeling and Simulation of Short Range 3D Triangulation-Based Laser Scanning System

Modeling and Simulation of Short Range 3D Triangulation-Based Laser Scanning System Modeling nd Simultion of Short Rnge 3D Tringultion-Bsed Lser Scnning System Theodor Borngiu Anmri Dogr Alexndru Dumitrche April 14, 2008 Abstrct In this pper, simultion environment for short rnge 3D lser

More information

B. Definition: The volume of a solid of known integrable cross-section area A(x) from x = a

B. Definition: The volume of a solid of known integrable cross-section area A(x) from x = a Mth 176 Clculus Sec. 6.: Volume I. Volume By Slicing A. Introduction We will e trying to find the volume of solid shped using the sum of cross section res times width. We will e driving towrd developing

More information

such that the S i cover S, or equivalently S

such that the S i cover S, or equivalently S MATH 55 Triple Integrls Fll 16 1. Definition Given solid in spce, prtition of consists of finite set of solis = { 1,, n } such tht the i cover, or equivlently n i. Furthermore, for ech i, intersects i

More information

ASTs, Regex, Parsing, and Pretty Printing

ASTs, Regex, Parsing, and Pretty Printing ASTs, Regex, Prsing, nd Pretty Printing CS 2112 Fll 2016 1 Algeric Expressions To strt, consider integer rithmetic. Suppose we hve the following 1. The lphet we will use is the digits {0, 1, 2, 3, 4, 5,

More information

2 Computing all Intersections of a Set of Segments Line Segment Intersection

2 Computing all Intersections of a Set of Segments Line Segment Intersection 15-451/651: Design & Anlysis of Algorithms Novemer 14, 2016 Lecture #21 Sweep-Line nd Segment Intersection lst chnged: Novemer 8, 2017 1 Preliminries The sweep-line prdigm is very powerful lgorithmic design

More information

Ray surface intersections

Ray surface intersections Ry surfce intersections Some primitives Finite primitives: polygons spheres, cylinders, cones prts of generl qudrics Infinite primitives: plnes infinite cylinders nd cones generl qudrics A finite primitive

More information

cisc1110 fall 2010 lecture VI.2 call by value function parameters another call by value example:

cisc1110 fall 2010 lecture VI.2 call by value function parameters another call by value example: cisc1110 fll 2010 lecture VI.2 cll y vlue function prmeters more on functions more on cll y vlue nd cll y reference pssing strings to functions returning strings from functions vrile scope glol vriles

More information

Lecture 7: Building 3D Models (Part 1) Prof Emmanuel Agu. Computer Science Dept. Worcester Polytechnic Institute (WPI)

Lecture 7: Building 3D Models (Part 1) Prof Emmanuel Agu. Computer Science Dept. Worcester Polytechnic Institute (WPI) Computer Grphics (CS 4731) Lecture 7: Building 3D Models (Prt 1) Prof Emmnuel Agu Computer Science Dept. Worcester Polytechnic Institute (WPI) Stndrd d Unit itvectors Define y i j 1,0,0 0,1,0 k i k 0,0,1

More information

INTRODUCTION TO SIMPLICIAL COMPLEXES

INTRODUCTION TO SIMPLICIAL COMPLEXES INTRODUCTION TO SIMPLICIAL COMPLEXES CASEY KELLEHER AND ALESSANDRA PANTANO 0.1. Introduction. In this ctivity set we re going to introduce notion from Algebric Topology clled simplicil homology. The min

More information

CPSC (T1) 2nd Midterm Exam

CPSC (T1) 2nd Midterm Exam Signture: Fire Alrm Code: CPSC 44 2-2 (T) 2nd Midterm Exm Deprtment of Computer Science University of British Columbi K. Booth & R. Schrein Exm Instructions (Red Crefully). Sign the first pge of the exm

More information

Definition of Regular Expression

Definition of Regular Expression Definition of Regulr Expression After the definition of the string nd lnguges, we re redy to descrie regulr expressions, the nottion we shll use to define the clss of lnguges known s regulr sets. Recll

More information

AML710 CAD LECTURE 16 SURFACES. 1. Analytical Surfaces 2. Synthetic Surfaces

AML710 CAD LECTURE 16 SURFACES. 1. Analytical Surfaces 2. Synthetic Surfaces AML7 CAD LECTURE 6 SURFACES. Anlticl Surfces. Snthetic Surfces Surfce Representtion From CAD/CAM point of view surfces re s importnt s curves nd solids. We need to hve n ide of curves for surfce cretion.

More information

In the last lecture, we discussed how valid tokens may be specified by regular expressions.

In the last lecture, we discussed how valid tokens may be specified by regular expressions. LECTURE 5 Scnning SYNTAX ANALYSIS We know from our previous lectures tht the process of verifying the syntx of the progrm is performed in two stges: Scnning: Identifying nd verifying tokens in progrm.

More information

Integration. September 28, 2017

Integration. September 28, 2017 Integrtion September 8, 7 Introduction We hve lerned in previous chpter on how to do the differentition. It is conventionl in mthemtics tht we re supposed to lern bout the integrtion s well. As you my

More information

2D Projective transformation

2D Projective transformation 2D Projective trnsformtion The mpping of points from n N-D spce to n M-D subspce (M < N) w' w' w m m m 2 m m m 2 m m m 2 2 22 w' w' w m m m 2 m m m 2 m m 2 2 Boqun Chen 22 2D Projective trnsformtion w'

More information

CS201 Discussion 10 DRAWTREE + TRIES

CS201 Discussion 10 DRAWTREE + TRIES CS201 Discussion 10 DRAWTREE + TRIES DrwTree First instinct: recursion As very generic structure, we could tckle this problem s follows: drw(): Find the root drw(root) drw(root): Write the line for the

More information

Dr. D.M. Akbar Hussain

Dr. D.M. Akbar Hussain Dr. D.M. Akr Hussin Lexicl Anlysis. Bsic Ide: Red the source code nd generte tokens, it is similr wht humns will do to red in; just tking on the input nd reking it down in pieces. Ech token is sequence

More information

CS-184: Computer Graphics. Today. Lecture #10: Clipping and Hidden Surfaces ClippingAndHidden.key - October 27, 2014.

CS-184: Computer Graphics. Today. Lecture #10: Clipping and Hidden Surfaces ClippingAndHidden.key - October 27, 2014. 1 CS184: Computer Grphics Lecture #10: Clipping nd Hidden Surfces!! Prof. Jmes O Brien University of Cliforni, Berkeley! V2013F101.0 Tody 2 Clipping Clipping to view volume Clipping ritrry polygons Hidden

More information

1 Quad-Edge Construction Operators

1 Quad-Edge Construction Operators CS48: Computer Grphics Hndout # Geometric Modeling Originl Hndout #5 Stnford University Tuesdy, 8 December 99 Originl Lecture #5: 9 November 99 Topics: Mnipultions with Qud-Edge Dt Structures Scribe: Mike

More information

Classic Rendering Pipeline

Classic Rendering Pipeline CS580: Classic Rendering Pipeline Sung-Eui Yoon ( 윤성의 ) Course URL: http://sglab.kaist.ac.kr/~sungeui/gcg/ Course Objectives Understand classic rendering pipeline Just high-level concepts, not all the

More information

Before We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1):

Before We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1): Overview (): Before We Begin Administrtive detils Review some questions to consider Winter 2006 Imge Enhncement in the Sptil Domin: Bsics of Sptil Filtering, Smoothing Sptil Filters, Order Sttistics Filters

More information

CS 432 Fall Mike Lam, Professor a (bc)* Regular Expressions and Finite Automata

CS 432 Fall Mike Lam, Professor a (bc)* Regular Expressions and Finite Automata CS 432 Fll 2017 Mike Lm, Professor (c)* Regulr Expressions nd Finite Automt Compiltion Current focus "Bck end" Source code Tokens Syntx tree Mchine code chr dt[20]; int min() { flot x = 42.0; return 7;

More information

Topics in Analytic Geometry

Topics in Analytic Geometry Nme Chpter 10 Topics in Anltic Geometr Section 10.1 Lines Objective: In this lesson ou lerned how to find the inclintion of line, the ngle between two lines, nd the distnce between point nd line. Importnt

More information

Section 10.4 Hyperbolas

Section 10.4 Hyperbolas 66 Section 10.4 Hyperbols Objective : Definition of hyperbol & hyperbols centered t (0, 0). The third type of conic we will study is the hyperbol. It is defined in the sme mnner tht we defined the prbol

More information

EECS150 - Digital Design Lecture 23 - High-level Design and Optimization 3, Parallelism and Pipelining

EECS150 - Digital Design Lecture 23 - High-level Design and Optimization 3, Parallelism and Pipelining EECS150 - Digitl Design Lecture 23 - High-level Design nd Optimiztion 3, Prllelism nd Pipelining Nov 12, 2002 John Wwrzynek Fll 2002 EECS150 - Lec23-HL3 Pge 1 Prllelism Prllelism is the ct of doing more

More information

CS-184: Computer Graphics. Today. Clipping. Hidden Surface Removal. Tuesday, October 7, Clipping to view volume Clipping arbitrary polygons

CS-184: Computer Graphics. Today. Clipping. Hidden Surface Removal. Tuesday, October 7, Clipping to view volume Clipping arbitrary polygons CS184: Computer Grphics Lecture #10: Clipping nd Hidden Surfces Prof. Jmes O Brien University of Cliforni, Berkeley V2008S101.0 1 Tody Clipping Clipping to view volume Clipping ritrry polygons Hidden Surfce

More information

Computer Arithmetic Logical, Integer Addition & Subtraction Chapter

Computer Arithmetic Logical, Integer Addition & Subtraction Chapter Computer Arithmetic Logicl, Integer Addition & Sutrction Chpter 3.-3.3 3.3 EEC7 FQ 25 MIPS Integer Representtion -it signed integers,, e.g., for numeric opertions 2 s s complement: one representtion for

More information

The Fundamental Theorem of Calculus

The Fundamental Theorem of Calculus MATH 6 The Fundmentl Theorem of Clculus The Fundmentl Theorem of Clculus (FTC) gives method of finding the signed re etween the grph of f nd the x-xis on the intervl [, ]. The theorem is: FTC: If f is

More information

Discussion 1 Recap. COP4600 Discussion 2 OS concepts, System call, and Assignment 1. Questions. Questions. Outline. Outline 10/24/2010

Discussion 1 Recap. COP4600 Discussion 2 OS concepts, System call, and Assignment 1. Questions. Questions. Outline. Outline 10/24/2010 COP4600 Discussion 2 OS concepts, System cll, nd Assignment 1 TA: Hufeng Jin hj0@cise.ufl.edu Discussion 1 Recp Introduction to C C Bsic Types (chr, int, long, flot, doule, ) C Preprocessors (#include,

More information

Tilt-Sensing with Kionix MEMS Accelerometers

Tilt-Sensing with Kionix MEMS Accelerometers Tilt-Sensing with Kionix MEMS Accelerometers Introduction Tilt/Inclintion sensing is common ppliction for low-g ccelerometers. This ppliction note describes how to use Kionix MEMS low-g ccelerometers to

More information

Integration. October 25, 2016

Integration. October 25, 2016 Integrtion October 5, 6 Introduction We hve lerned in previous chpter on how to do the differentition. It is conventionl in mthemtics tht we re supposed to lern bout the integrtion s well. As you my hve

More information

HW Stereotactic Targeting

HW Stereotactic Targeting HW Stereotctic Trgeting We re bout to perform stereotctic rdiosurgery with the Gmm Knife under CT guidnce. We instrument the ptient with bse ring nd for CT scnning we ttch fiducil cge (FC). Above: bse

More information

Surfaces. Differential Geometry Lia Vas

Surfaces. Differential Geometry Lia Vas Differentil Geometry Li Vs Surfces When studying curves, we studied how the curve twisted nd turned in spce. We now turn to surfces, two-dimensionl objects in three-dimensionl spce nd exmine how the concept

More information

Languages. L((a (b)(c))*) = { ε,a,bc,aa,abc,bca,... } εw = wε = w. εabba = abbaε = abba. (a (b)(c)) *

Languages. L((a (b)(c))*) = { ε,a,bc,aa,abc,bca,... } εw = wε = w. εabba = abbaε = abba. (a (b)(c)) * Pln for Tody nd Beginning Next week Interpreter nd Compiler Structure, or Softwre Architecture Overview of Progrmming Assignments The MeggyJv compiler we will e uilding. Regulr Expressions Finite Stte

More information

CS-C3100 Computer Graphics, Fall 2016 Ray Casting II Intersection Extravaganza

CS-C3100 Computer Graphics, Fall 2016 Ray Casting II Intersection Extravaganza CS-C3100 Computer Grphics, Fll 2016 Ry Csting II Intersection Extrvgnz Henrik Wnn Jensen Jkko Lehtinen with lots of mteril from Frédo Durnd CS-C3100 Fll 2016 Lehtinen 1 Pinholes in Nture Flickr user Picture

More information

Complete Coverage Path Planning of Mobile Robot Based on Dynamic Programming Algorithm Peng Zhou, Zhong-min Wang, Zhen-nan Li, Yang Li

Complete Coverage Path Planning of Mobile Robot Based on Dynamic Programming Algorithm Peng Zhou, Zhong-min Wang, Zhen-nan Li, Yang Li 2nd Interntionl Conference on Electronic & Mechnicl Engineering nd Informtion Technology (EMEIT-212) Complete Coverge Pth Plnning of Mobile Robot Bsed on Dynmic Progrmming Algorithm Peng Zhou, Zhong-min

More information

Agilent Mass Hunter Software

Agilent Mass Hunter Software Agilent Mss Hunter Softwre Quick Strt Guide Use this guide to get strted with the Mss Hunter softwre. Wht is Mss Hunter Softwre? Mss Hunter is n integrl prt of Agilent TOF softwre (version A.02.00). Mss

More information

If you are at the university, either physically or via the VPN, you can download the chapters of this book as PDFs.

If you are at the university, either physically or via the VPN, you can download the chapters of this book as PDFs. Lecture 5 Wlks, Trils, Pths nd Connectedness Reding: Some of the mteril in this lecture comes from Section 1.2 of Dieter Jungnickel (2008), Grphs, Networks nd Algorithms, 3rd edition, which is ville online

More information

Systems I. Logic Design I. Topics Digital logic Logic gates Simple combinational logic circuits

Systems I. Logic Design I. Topics Digital logic Logic gates Simple combinational logic circuits Systems I Logic Design I Topics Digitl logic Logic gtes Simple comintionl logic circuits Simple C sttement.. C = + ; Wht pieces of hrdwre do you think you might need? Storge - for vlues,, C Computtion

More information

GENERATING ORTHOIMAGES FOR CLOSE-RANGE OBJECTS BY AUTOMATICALLY DETECTING BREAKLINES

GENERATING ORTHOIMAGES FOR CLOSE-RANGE OBJECTS BY AUTOMATICALLY DETECTING BREAKLINES GENEATING OTHOIMAGES FO CLOSE-ANGE OBJECTS BY AUTOMATICALLY DETECTING BEAKLINES Efstrtios Stylinidis 1, Lzros Sechidis 1, Petros Ptis 1, Spiros Sptls 2 Aristotle University of Thessloniki 1 Deprtment of

More information

Slides for Data Mining by I. H. Witten and E. Frank

Slides for Data Mining by I. H. Witten and E. Frank Slides for Dt Mining y I. H. Witten nd E. Frnk Simplicity first Simple lgorithms often work very well! There re mny kinds of simple structure, eg: One ttriute does ll the work All ttriutes contriute eqully

More information

Constrained Optimization. February 29

Constrained Optimization. February 29 Constrined Optimiztion Februry 9 Generl Problem min f( ) ( NLP) s.. t g ( ) i E i g ( ) i I i Modeling nd Constrints Adding constrints let s us model fr more richer set of problems. For our purpose we

More information

COMP 423 lecture 11 Jan. 28, 2008

COMP 423 lecture 11 Jan. 28, 2008 COMP 423 lecture 11 Jn. 28, 2008 Up to now, we hve looked t how some symols in n lphet occur more frequently thn others nd how we cn sve its y using code such tht the codewords for more frequently occuring

More information

Suffix trees, suffix arrays, BWT

Suffix trees, suffix arrays, BWT ALGORITHMES POUR LA BIO-INFORMATIQUE ET LA VISUALISATION COURS 3 Rluc Uricru Suffix trees, suffix rrys, BWT Bsed on: Suffix trees nd suffix rrys presenttion y Him Kpln Suffix trees course y Pco Gomez Liner-Time

More information

PNC NC code PROGRAMMER'S MANUAL

PNC NC code PROGRAMMER'S MANUAL PNC-3200 NC code PROGRAMMER'S MANUAL Thnk you very much for purchsing the PNC-3200. To ensure correct nd sfe usge with full understnding of this product's performnce, plese be sure to red through this

More information

License Manager Installation and Setup

License Manager Installation and Setup The Network License (concurrent-user) version of e-dpp hs hrdwre key plugged to the computer running the License Mnger softwre. In the e-dpp terminology, this computer is clled the License Mnger Server.

More information

Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming

Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming Lecture 10 Evolutionry Computtion: Evolution strtegies nd genetic progrmming Evolution strtegies Genetic progrmming Summry Negnevitsky, Person Eduction, 2011 1 Evolution Strtegies Another pproch to simulting

More information

Simplifying Algebra. Simplifying Algebra. Curriculum Ready.

Simplifying Algebra. Simplifying Algebra. Curriculum Ready. Simplifying Alger Curriculum Redy www.mthletics.com This ooklet is ll out turning complex prolems into something simple. You will e le to do something like this! ( 9- # + 4 ' ) ' ( 9- + 7-) ' ' Give this

More information

Data sharing in OpenMP

Data sharing in OpenMP Dt shring in OpenMP Polo Burgio polo.burgio@unimore.it Outline Expressing prllelism Understnding prllel threds Memory Dt mngement Dt cluses Synchroniztion Brriers, locks, criticl sections Work prtitioning

More information

50 AMC LECTURES Lecture 2 Analytic Geometry Distance and Lines. can be calculated by the following formula:

50 AMC LECTURES Lecture 2 Analytic Geometry Distance and Lines. can be calculated by the following formula: 5 AMC LECTURES Lecture Anlytic Geometry Distnce nd Lines BASIC KNOWLEDGE. Distnce formul The distnce (d) between two points P ( x, y) nd P ( x, y) cn be clculted by the following formul: d ( x y () x )

More information

Elena Baralis, Silvia Chiusano Politecnico di Torino. Pag. 1. Query optimization. DBMS Architecture. Query optimizer. Query optimizer.

Elena Baralis, Silvia Chiusano Politecnico di Torino. Pag. 1. Query optimization. DBMS Architecture. Query optimizer. Query optimizer. DBMS Architecture SQL INSTRUCTION OPTIMIZER Dtbse Mngement Systems MANAGEMENT OF ACCESS METHODS BUFFER MANAGER CONCURRENCY CONTROL RELIABILITY MANAGEMENT Index Files Dt Files System Ctlog DATABASE 2 Query

More information

15. 3D-Reconstruction from Vanishing Points

15. 3D-Reconstruction from Vanishing Points 15. 3D-Reconstruction from Vnishing Points Christin B.U. Perwss 1 nd Jon Lseny 2 1 Cvendish Lortory, Cmridge 2 C. U. Engineering Deprtment, Cmridge 15.1 Introduction 3D-reconstruction is currently n ctive

More information

Unit 5 Vocabulary. A function is a special relationship where each input has a single output.

Unit 5 Vocabulary. A function is a special relationship where each input has a single output. MODULE 3 Terms Definition Picture/Exmple/Nottion 1 Function Nottion Function nottion is n efficient nd effective wy to write functions of ll types. This nottion llows you to identify the input vlue with

More information

SOME EXAMPLES OF SUBDIVISION OF SMALL CATEGORIES

SOME EXAMPLES OF SUBDIVISION OF SMALL CATEGORIES SOME EXAMPLES OF SUBDIVISION OF SMALL CATEGORIES MARCELLO DELGADO Abstrct. The purpose of this pper is to build up the bsic conceptul frmework nd underlying motivtions tht will llow us to understnd ctegoricl

More information

CSCI 3130: Formal Languages and Automata Theory Lecture 12 The Chinese University of Hong Kong, Fall 2011

CSCI 3130: Formal Languages and Automata Theory Lecture 12 The Chinese University of Hong Kong, Fall 2011 CSCI 3130: Forml Lnguges nd utomt Theory Lecture 12 The Chinese University of Hong Kong, Fll 2011 ndrej Bogdnov In progrmming lnguges, uilding prse trees is significnt tsk ecuse prse trees tell us the

More information

6.2 Volumes of Revolution: The Disk Method

6.2 Volumes of Revolution: The Disk Method mth ppliction: volumes by disks: volume prt ii 6 6 Volumes of Revolution: The Disk Method One of the simplest pplictions of integrtion (Theorem 6) nd the ccumultion process is to determine so-clled volumes

More information

ΕΠΛ323 - Θεωρία και Πρακτική Μεταγλωττιστών

ΕΠΛ323 - Θεωρία και Πρακτική Μεταγλωττιστών ΕΠΛ323 - Θωρία και Πρακτική Μταγλωττιστών Lecture 3 Lexicl Anlysis Elis Athnsopoulos elisthn@cs.ucy.c.cy Recognition of Tokens if expressions nd reltionl opertors if è if then è then else è else relop

More information

ANALYTICAL GEOMETRY. The curves obtained by slicing the cone with a plane not passing through the vertex are called conics.

ANALYTICAL GEOMETRY. The curves obtained by slicing the cone with a plane not passing through the vertex are called conics. ANALYTICAL GEOMETRY Definition of Conic: The curves obtined by slicing the cone with plne not pssing through the vertex re clled conics. A Conic is the locus directrix of point which moves in plne, so

More information

George Boole. IT 3123 Hardware and Software Concepts. Switching Algebra. Boolean Functions. Boolean Functions. Truth Tables

George Boole. IT 3123 Hardware and Software Concepts. Switching Algebra. Boolean Functions. Boolean Functions. Truth Tables George Boole IT 3123 Hrdwre nd Softwre Concepts My 28 Digitl Logic The Little Mn Computer 1815 1864 British mthemticin nd philosopher Mny contriutions to mthemtics. Boolen lger: n lger over finite sets

More information

Control-Flow Analysis and Loop Detection

Control-Flow Analysis and Loop Detection ! Control-Flow Anlysis nd Loop Detection!Lst time! PRE!Tody! Control-flow nlysis! Loops! Identifying loops using domintors! Reducibility! Using loop identifiction to identify induction vribles CS553 Lecture

More information

Lecture 4 Single View Metrology

Lecture 4 Single View Metrology Lecture 4 Single View Metrology Professor Silvio Svrese Computtionl Vision nd Geometry Lb Silvio Svrese Lecture 4-4-Jn-5 Lecture 4 Single View Metrology Review clibrtion nd 2D trnsformtions Vnishing points

More information

5 Regular 4-Sided Composition

5 Regular 4-Sided Composition Xilinx-Lv User Guide 5 Regulr 4-Sided Composition This tutoril shows how regulr circuits with 4-sided elements cn be described in Lv. The type of regulr circuits tht re discussed in this tutoril re those

More information

1.1 Lines AP Calculus

1.1 Lines AP Calculus . Lines AP Clculus. LINES Notecrds from Section.: Rules for Rounding Round or Truncte ll finl nswers to 3 deciml plces. Do NOT round before ou rech our finl nswer. Much of Clculus focuses on the concept

More information

MTH 146 Conics Supplement

MTH 146 Conics Supplement 105- Review of Conics MTH 146 Conics Supplement In this section we review conics If ou ne more detils thn re present in the notes, r through section 105 of the ook Definition: A prol is the set of points

More information

Fig.25: the Role of LEX

Fig.25: the Role of LEX The Lnguge for Specifying Lexicl Anlyzer We shll now study how to uild lexicl nlyzer from specifiction of tokens in the form of list of regulr expressions The discussion centers round the design of n existing

More information

CS 340, Fall 2014 Dec 11 th /13 th Final Exam Note: in all questions, the special symbol ɛ (epsilon) is used to indicate the empty string.

CS 340, Fall 2014 Dec 11 th /13 th Final Exam Note: in all questions, the special symbol ɛ (epsilon) is used to indicate the empty string. CS 340, Fll 2014 Dec 11 th /13 th Finl Exm Nme: Note: in ll questions, the specil symol ɛ (epsilon) is used to indicte the empty string. Question 1. [5 points] Consider the following regulr expression;

More information

ON THE DEHN COMPLEX OF VIRTUAL LINKS

ON THE DEHN COMPLEX OF VIRTUAL LINKS ON THE DEHN COMPLEX OF VIRTUAL LINKS RACHEL BYRD, JENS HARLANDER Astrct. A virtul link comes with vriety of link complements. This rticle is concerned with the Dehn spce, pseudo mnifold with oundry, nd

More information

A dual of the rectangle-segmentation problem for binary matrices

A dual of the rectangle-segmentation problem for binary matrices A dul of the rectngle-segmenttion prolem for inry mtrices Thoms Klinowski Astrct We consider the prolem to decompose inry mtrix into smll numer of inry mtrices whose -entries form rectngle. We show tht

More information

Compression Outline :Algorithms in the Real World. Lempel-Ziv Algorithms. LZ77: Sliding Window Lempel-Ziv

Compression Outline :Algorithms in the Real World. Lempel-Ziv Algorithms. LZ77: Sliding Window Lempel-Ziv Compression Outline 15-853:Algorithms in the Rel World Dt Compression III Introduction: Lossy vs. Lossless, Benchmrks, Informtion Theory: Entropy, etc. Proility Coding: Huffmn + Arithmetic Coding Applictions

More information

Math 142, Exam 1 Information.

Math 142, Exam 1 Information. Mth 14, Exm 1 Informtion. 9/14/10, LC 41, 9:30-10:45. Exm 1 will be bsed on: Sections 7.1-7.5. The corresponding ssigned homework problems (see http://www.mth.sc.edu/ boyln/sccourses/14f10/14.html) At

More information

CSCI 104. Rafael Ferreira da Silva. Slides adapted from: Mark Redekopp and David Kempe

CSCI 104. Rafael Ferreira da Silva. Slides adapted from: Mark Redekopp and David Kempe CSCI 0 fel Ferreir d Silv rfsilv@isi.edu Slides dpted from: Mrk edekopp nd Dvid Kempe LOG STUCTUED MEGE TEES Series Summtion eview Let n = + + + + k $ = #%& #. Wht is n? n = k+ - Wht is log () + log ()

More information

Epson Projector Content Manager Operation Guide

Epson Projector Content Manager Operation Guide Epson Projector Content Mnger Opertion Guide Contents 2 Introduction to the Epson Projector Content Mnger Softwre 3 Epson Projector Content Mnger Fetures... 4 Setting Up the Softwre for the First Time

More information

a(e, x) = x. Diagrammatically, this is encoded as the following commutative diagrams / X

a(e, x) = x. Diagrammatically, this is encoded as the following commutative diagrams / X 4. Mon, Sept. 30 Lst time, we defined the quotient topology coming from continuous surjection q : X! Y. Recll tht q is quotient mp (nd Y hs the quotient topology) if V Y is open precisely when q (V ) X

More information

Illumination and Shading

Illumination and Shading Illumintion nd hding In order to produce relistic imges, we must simulte the ppernce of surfces under vrious lighting conditions. Illumintion models: given the illumintion incident t point on surfce, wht

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology

More information

Some Thoughts on Grad School. Undergraduate Compilers Review and Intro to MJC. Structure of a Typical Compiler. Lexing and Parsing

Some Thoughts on Grad School. Undergraduate Compilers Review and Intro to MJC. Structure of a Typical Compiler. Lexing and Parsing Undergrdute Compilers Review nd Intro to MJC Announcements Miling list is in full swing Tody Some thoughts on grd school Finish prsing Semntic nlysis Visitor pttern for bstrct syntx trees Some Thoughts

More information

Symbol Table management

Symbol Table management TDDD Compilers nd interpreters TDDB44 Compiler Construction Symol Tles Symol Tles in the Compiler Symol Tle mngement source progrm Leicl nlysis Syntctic nlysis Semntic nlysis nd Intermedite code gen Code

More information

Context-Free Grammars

Context-Free Grammars Context-Free Grmmrs Descriing Lnguges We've seen two models for the regulr lnguges: Finite utomt ccept precisely the strings in the lnguge. Regulr expressions descrie precisely the strings in the lnguge.

More information

style type="text/css".wpb_animate_when_almost_visible { opacity: 1; }/style

style type=text/css.wpb_animate_when_almost_visible { opacity: 1; }/style style type="text/css".wpb_nimte_when_lmost_vible { opcity: 1; }/style You cn chrome homepge for internet explorer quickly chrome homepge for internet explorer get chrome homepge for internet explorer every

More information

Today. CS 188: Artificial Intelligence Fall Recap: Search. Example: Pancake Problem. Example: Pancake Problem. General Tree Search.

Today. CS 188: Artificial Intelligence Fall Recap: Search. Example: Pancake Problem. Example: Pancake Problem. General Tree Search. CS 88: Artificil Intelligence Fll 00 Lecture : A* Serch 9//00 A* Serch rph Serch Tody Heuristic Design Dn Klein UC Berkeley Multiple slides from Sturt Russell or Andrew Moore Recp: Serch Exmple: Pncke

More information

Presentation Martin Randers

Presentation Martin Randers Presenttion Mrtin Rnders Outline Introduction Algorithms Implementtion nd experiments Memory consumption Summry Introduction Introduction Evolution of species cn e modelled in trees Trees consist of nodes

More information

How to Design REST API? Written Date : March 23, 2015

How to Design REST API? Written Date : March 23, 2015 Visul Prdigm How Design REST API? Turil How Design REST API? Written Dte : Mrch 23, 2015 REpresenttionl Stte Trnsfer, n rchitecturl style tht cn be used in building networked pplictions, is becoming incresingly

More information

Today s Lecture. Basics of Logic Design: Boolean Algebra, Logic Gates. Recursive Example. Review: The C / C++ code. Recursive Example (Continued)

Today s Lecture. Basics of Logic Design: Boolean Algebra, Logic Gates. Recursive Example. Review: The C / C++ code. Recursive Example (Continued) Tod s Lecture Bsics of Logic Design: Boolen Alger, Logic Gtes Alvin R. Leeck CPS 4 Lecture 8 Homework #2 Due Ferur 3 Outline Review (sseml recursion) Building the uilding locks Logic Design Truth tles,

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology

More information

Announcements. CS 188: Artificial Intelligence Fall Recap: Search. Today. General Tree Search. Uniform Cost. Lecture 3: A* Search 9/4/2007

Announcements. CS 188: Artificial Intelligence Fall Recap: Search. Today. General Tree Search. Uniform Cost. Lecture 3: A* Search 9/4/2007 CS 88: Artificil Intelligence Fll 2007 Lecture : A* Serch 9/4/2007 Dn Klein UC Berkeley Mny slides over the course dpted from either Sturt Russell or Andrew Moore Announcements Sections: New section 06:

More information

Mobile IP route optimization method for a carrier-scale IP network

Mobile IP route optimization method for a carrier-scale IP network Moile IP route optimiztion method for crrier-scle IP network Tkeshi Ihr, Hiroyuki Ohnishi, nd Ysushi Tkgi NTT Network Service Systems Lortories 3-9-11 Midori-cho, Musshino-shi, Tokyo 180-8585, Jpn Phone:

More information

Class-XI Mathematics Conic Sections Chapter-11 Chapter Notes Key Concepts

Class-XI Mathematics Conic Sections Chapter-11 Chapter Notes Key Concepts Clss-XI Mthemtics Conic Sections Chpter-11 Chpter Notes Key Concepts 1. Let be fixed verticl line nd m be nother line intersecting it t fixed point V nd inclined to it t nd ngle On rotting the line m round

More information