Revisited: Coordinate Frame Transformation
Revisited the last 17 slides of Lecture 4
Lecture 5 Animation
Coordinate Frame Transformation
Transformation Interpretation
p transforme d TR p
CS174A
right to left
interpret operations wrt fixed coordinate
Pitanja:
Ch. 1:
1.
2.
3.
4.
5.
6.
Define a Project:
Define a Program:
Define a Portfolio:
Understand the scope triangle
Define a Scope ili Define a complex project
The Importance of Classifying Projects
Ch. 2:
1.
2.
3.
4.
Understand and apply a working de
SELECT CarID,
Car.Make,
Car.Model,
Car.Color,
Car.Location,
CustomerID,
Customer.name,
Customer.lastName,
RentDateTime
FROM Rent , Car, Customer
WHERE Rent.CarID = Car.LicencePlate and Rent.CustomerID = Customer.DriversLicence
order by Customer.name asc
S
Design of Algorithms
(Dynamic Programming)
Introduction
Algorithms are often designed using common techniques, including:
Greedy Methods
Integer Programming
Divide & Conquer
Neural Networks
Dynamic Programming
Genetic Algorithms
Backtracking
Simul
Algorithms
Introduction
A typical programming task can be divided
into two phases:
Algorithm Development Phase
produce an ordered sequence of steps that
describe solution of problem
this sequence of steps is called an algorithm
Implementation phase
Analysis of Algorithms
(Running Time)
Introduction
The running time of an algorithm varies with the inputs, and
typically grows with the size of the inputs.
To evaluate an algorithm or to compare two algorithms, we focus
on their relative rates of growt
Analysis of Algorithms
(Search Algorithms)
Binary Search
Assume that we are give an array of records that is sorted.
For instance:
an array of records with integer keys sorted from
smallest to largest (e.g., ID numbers), or
an array of records with str
Design of Algorithms
(Decrease and Conquer)
Introduction
Algorithms are often designed using common techniques, including:
Greedy Methods
Integer Programming
Divide & Conquer
Neural Networks
Dynamic Programming
Genetic Algorithms
Backtracking
Simu
Design of Algorithms
(Brute Force Algorithms)
Introduction
Algorithms are often designed using common techniques, including:
Greedy Methods
Integer Programming
Divide & Conquer
Neural Networks
Dynamic Programming
Genetic Algorithms
Backtracking
Si
Design of Algorithms
(Greedy Algorithms)
Introduction
Algorithms are often designed using common techniques, including:
Greedy Methods
Integer Programming
Divide & Conquer
Neural Networks
Dynamic Programming
Genetic Algorithms
Backtracking
Simulat
Design of Algorithms
(Divide and Conquer)
Introduction
Algorithms are often designed using common techniques, including:
Greedy Methods
Integer Programming
Divide & Conquer
Neural Networks
Dynamic Programming
Genetic Algorithms
Backtracking
Simula
Design of Algorithms
(Transform and Conquer)
Introduction
Algorithms are often designed using common techniques, including:
Greedy Methods
Integer Programming
Divide & Conquer
Neural Networks
Dynamic Programming
Genetic Algorithms
Backtracking
Sim
Algorithms
What is a Problem?
A Problem is something we want to solve, or a question we want to
answer
A computational problem is a general question to be answered
General: has inputs (parameters), whose values are left unspecified
The answers are the
Analysis of Algorithms
(Sort Algorithms)
The Sorting Problem
Input:
A sequence of n numbers a1, a2, . . . , an
Output:
A permutation (reordering) a1, a2, . . . , an of the
input sequence such that a1 a2 an
2
Analysis of Sort Algorithms
12/15/16
Defini
Najvazniji learning outcomi iz gradiva:
Ch.1:
1. Understand the scope triangle
Also known as Iron Triangle. It refers to the relationship
Between three resources: Time, Cost, and Scope. These three variables form the sides of a
triangle and are an interde
Pitanja:
Ch. 1:
1. Define a Project:
A project is a sequence of unique, complex, and connected activities that have one goal or purpose
and that must be completed by a specific time, within budget, and according to specification.
2. Define a Program:
A pr
GRUPA A
5.
select LicencePlate,
from Car,Rent
where Location='Sarajevo' and Rent.odometar<350000;
6.
select *
from Customer
where DOB is null
7.
use CITA2015;
select Rent.*, Customer.Name,
Customer.LastName, Rent.RentDateTime, Rent.DurationDays
from Rent
Rasterization of Primitives
Rasterization
Draw geometic primitives
Convert from geometric defintion of lines/obects to
pixels
rasterization = selecting pixels
Image
Triangle
Will be done frequently
must be fast:
use integer arithmetic
use addition
Recap from Last Lecture
Affine Transformations in 3D
2D Linear Transforms
Homogeneous Coordinates
2D Affine Transforms
Summary: Linear Transformations
Any linear transformation is a combination of a
Scale
Shear
Rotation
x ' a b x
y ' c d y
Motivation
Camera and Basic Viewing Projections
We have used transforms to place objects in a scene,
but all that is in 3D. We still need to make a 2D picture
Project 3D to 2D. How do we do this?
Viewing transformations and Projections to image
plane
Computer Generated Animations
Computer Generated Animations
Physical Simulations
Last Lecture
We usually want realistic looking motion
Overall goals
People are extremely experienced at observing body language
They pick up on unnatural human motion instant
Review: Reflection Equations
l
I diffuse k d I light k d ( n l )
n
I specular k s I light v r shiny
n
2 ( N (N L) L = R
Review: Phong Lighting Model
Review: Blinn-Phong Model
Blinn Variation with better physical interpretation
Combine ambient, diffuse, s
Determining Objects Appearance
Type of Light Sources
glLightfv(GL_LIGHT0,GL_POSITION,light[])
Directional Light Sources
scene lit with ambient and directional light
directional/parallel lights
point at infinity: (x,y,z,0)T
Infinetely far source (ex: s
Course Outline
Advanced Modeling topics
Animation
Modeling
Curves
Rendering
1
3
Curves for Modeling
Motivation
We need smooth curves and surfaces in many applications:
model real world objects
computer-aided design (CAD)
high quality fonts
data plot
Texture Mapping
Texture Mapping
Basic idea: use images instead of more polygons to
represent fine scale color variation
Pasting textures on surfaces
Motivation
Parameterization
Introduced to increase realism
Lighting/shading models not enough
+
Hide g
SYLLABUS
CITA 215 DATABASE SYSTEMS WITH
WEB APPLICATIONS
AMERICAN UNIVERSITY IN BOSNIA AND HERZEGOVINA
SUBJECT DETAILS:
A.
B.
NAME
DATABASE SYSTEMS WITH WEB APPLICATIONS
SUBJECT CODE
CITA 215
C. ETCS CREDITS
6
US CREDITS
3
D.
SUBJECT STATUS Compulsory
LEC
Isnullisnotnull
where
howtologicaloperators,where
andandor
pointkeystoconnectdifferenttables
insert
between
isnotnull
IDNEUBACUJ,SAMSEINKREMENTUJE
The SELECT statement is used to select data from a database.
SQL SELECT Syntax
SELECT column_name,column_nam