geek points if you understand this double points if you
play

Geek points if you understand this. Double points if you can do it - PowerPoint PPT Presentation

Oct 09, 2023 •358 likes •691 views

Geek points if you understand this. Double points if you can do it in your head. What can we do to improve drawBorder() ? Drawing two vertical lines uses one "recipe"! Each uses a different y value. So: Create a parameterized method

  1. Geek points if you understand this. Double points if you can do it in your head.

  2. What can we do to improve drawBorder() ? Drawing two vertical lines uses one "recipe"! Each uses a different y value. So: Create a parameterized method to draw a vertical line. Do the same for horizontal lines. Make the size of the border a parameter. Make the size of the border grow with the size of the image. Others?

  3. STEP BY STEP public void lighter( double amount ) { Pixel[] pixels = this.getPixels(); double factor = 1 + amount; for ( int i = 0; i < pixels.length; i++ ) { Pixel p = pixels[i]; p.setRed ( (int) (p.getRed () * factor) ); p.setGreen( (int) (p.getGreen() * factor) ); p.setBlue ( (int) (p.getBlue () * factor) ); } }

  4. STEP BY STEP Pixel[] pixels = this.getPixels(); double factor = 1 + amount; pixels Pixel[0] Pixel red=127 green=163 blue=197 Pixel[1] Pixel red=127 green=163 blue=197 Pixel[2] Pixel red=128 green=164 blue=198 ... factor 1.5

  5. STEP BY STEP for ( int i = 0; i < pixels.length; i++ ) { Pixel p = pixels[i]; p.setRed ( (int) (p.getRed () * factor) ); p.setGreen( (int) (p.getGreen() * factor) ); p.setBlue ( (int) (p.getBlue () * factor) ); } pixels Pixel[0] Pixel red=127 green=163 blue=197 Pixel[1] Pixel red=127 green=163 blue=197 Pixel[2] Pixel red=128 green=164 blue=198 ... factor 1.5

  6. STEP BY STEP for ( int i = 0 ; i < pixels.length; i++ ) { Pixel p = pixels[i]; p.setRed ( (int) (p.getRed () * factor) ); p.setGreen( (int) (p.getGreen() * factor) ); p.setBlue ( (int) (p.getBlue () * factor) ); } pixels Pixel[0] Pixel red=127 green=163 blue=197 Pixel[1] Pixel red=127 green=163 blue=197 Pixel[2] Pixel red=128 green=164 blue=198 ... factor 1.5 i 0

  7. STEP BY STEP for ( int i = 0; i < pixels.length ; i++ ) { Pixel p = pixels[i]; p.setRed ( (int) (p.getRed () * factor) ); p.setGreen( (int) (p.getGreen() * factor) ); p.setBlue ( (int) (p.getBlue () * factor) ); } pixels Pixel[0] Pixel red=127 green=163 blue=197 Pixel[1] Pixel red=127 green=163 blue=197 Pixel[2] Pixel red=128 green=164 blue=198 ... factor 1.5 i 0

  8. STEP BY STEP for ( int i = 0; i < pixels.length; i++ ) { Pixel p = pixels[i]; p.setRed ( (int) (p.getRed () * factor) ); p.setGreen( (int) (p.getGreen() * factor) ); p.setBlue ( (int) (p.getBlue () * factor) ); } p -> Pixel[0] Pixel red=127 green=163 blue=197 Pixel[1] Pixel red=127 green=163 blue=197 Pixel[2] Pixel red=128 green=164 blue=198 ... factor 1.5 i 0

  9. STEP BY STEP for ( int i = 0; i < pixels.length; i++ ) { Pixel p = pixels[i]; p.setRed ( (int) (p.getRed () * factor) ); p.setGreen( (int) (p.getGreen() * factor) ); p.setBlue ( (int) (p.getBlue () * factor) ); } p -> Pixel[0] Pixel red= 190 green=163 blue=197 Pixel[1] Pixel red=127 green=163 blue=197 Pixel[2] Pixel red=128 green=164 blue=198 ... factor 1.5 i 0

  10. STEP BY STEP for ( int i = 0; i < pixels.length; i++ ) { Pixel p = pixels[i]; p.setRed ( (int) (p.getRed () * factor) ); p.setGreen( (int) (p.getGreen() * factor) ); p.setBlue ( (int) (p.getBlue () * factor) ); } p -> Pixel[0] Pixel red=190 green= 244 blue=197 Pixel[1] Pixel red=127 green=163 blue=197 Pixel[2] Pixel red=128 green=164 blue=198 ... factor 1.5 i 0

  11. STEP BY STEP for ( int i = 0; i < pixels.length; i++ ) { Pixel p = pixels[i]; p.setRed ( (int) (p.getRed () * factor) ); p.setGreen( (int) (p.getGreen() * factor) ); p.setBlue ( (int) (p.getBlue () * factor) ); } p -> Pixel[0] Pixel red=190 green=244 blue= 295 Pixel[1] Pixel red=127 green=163 blue=197 Pixel[2] Pixel red=128 green=164 blue=198 ... factor 1.5 i 0

  12. STEP BY STEP for ( int i = 0; i < pixels.length; i++ ) { Pixel p = pixels[i]; p.setRed ( (int) (p.getRed () * factor) ); p.setGreen( (int) (p.getGreen() * factor) ); p.setBlue ( (int) (p.getBlue () * factor) ); } p -> Pixel[0] Pixel red=190 green=244 blue=295 Pixel[1] Pixel red=127 green=163 blue=197 Pixel[2] Pixel red=128 green=164 blue=198 ... factor 1.5 i 0

  13. STEP BY STEP for ( int i = 0; i < pixels.length; i++ ) { Pixel p = pixels[i]; p.setRed ( (int) (p.getRed () * factor) ); p.setGreen( (int) (p.getGreen() * factor) ); p.setBlue ( (int) (p.getBlue () * factor) ); } p -> Pixel[0] Pixel red=190 green=244 blue=295 Pixel[1] Pixel red=127 green=163 blue=197 Pixel[2] Pixel red=128 green=164 blue=198 ... factor 1.5 i 1

  14. STEP BY STEP for ( int i = 0; i < pixels.length ; i++ ) { Pixel p = pixels[i]; p.setRed ( (int) (p.getRed () * factor) ); p.setGreen( (int) (p.getGreen() * factor) ); p.setBlue ( (int) (p.getBlue () * factor) ); } p -> Pixel[0] Pixel red=190 green=244 blue=295 Pixel[1] Pixel red=127 green=163 blue=197 Pixel[2] Pixel red=128 green=164 blue=198 ... factor 1.5 i 1

  15. STEP BY STEP for ( int i = 0; i < pixels.length; i++ ) { Pixel p = pixels[i]; p.setRed ( (int) (p.getRed () * factor) ); p.setGreen( (int) (p.getGreen() * factor) ); p.setBlue ( (int) (p.getBlue () * factor) ); } Pixel[0] Pixel red=190 green=244 blue=295 p -> Pixel[1] Pixel red=127 green=163 blue=197 Pixel[2] Pixel red=128 green=164 blue=198 ... factor 1.5 i 1

  16. STEP BY STEP for ( int i = 0; i < pixels.length; i++ ) { Pixel p = pixels[i]; p.setRed ( (int) (p.getRed () * factor) ); p.setGreen( (int) (p.getGreen() * factor) ); p.setBlue ( (int) (p.getBlue () * factor) ); } Pixel[0] Pixel red=190 green=244 blue=295 p -> Pixel[1] Pixel red= 190 green=163 blue=197 Pixel[2] Pixel red=128 green=164 blue=198 ... factor 1.5 i 1

  17. STEP BY STEP for ( int i = 0; i < pixels.length; i++ ) { Pixel p = pixels[i]; p.setRed ( (int) (p.getRed () * factor) ); p.setGreen( (int) (p.getGreen() * factor) ); p.setBlue ( (int) (p.getBlue () * factor) ); } Pixel[0] Pixel red=190 green=244 blue=295 p -> Pixel[1] Pixel red=190 green= 244 blue=197 Pixel[2] Pixel red=128 green=164 blue=198 ... factor 1.5 i 1

  18. STEP BY STEP for ( int i = 0; i < pixels.length; i++ ) { Pixel p = pixels[i]; p.setRed ( (int) (p.getRed () * factor) ); p.setGreen( (int) (p.getGreen() * factor) ); p.setBlue ( (int) (p.getBlue () * factor) ); } Pixel[0] Pixel red=190 green=244 blue=295 p -> Pixel[1] Pixel red=190 green=244 blue= 295 Pixel[2] Pixel red=128 green=164 blue=198 ... factor 1.5 i 1

  19. STEP BY STEP for ( int i = 0; i < pixels.length; i++ ) { Pixel p = pixels[i]; p.setRed ( (int) (p.getRed () * factor) ); p.setGreen( (int) (p.getGreen() * factor) ); p.setBlue ( (int) (p.getBlue () * factor) ); } Pixel[0] Pixel red=190 green=244 blue=295 p -> Pixel[1] Pixel red=190 green=244 blue=295 Pixel[2] Pixel red=128 green=164 blue=198 ... factor 1.5 i 2

  20. STEP BY STEP for ( int i = 0; i < pixels.length ; i++ ) { Pixel p = pixels[i]; p.setRed ( (int) (p.getRed () * factor) ); p.setGreen( (int) (p.getGreen() * factor) ); p.setBlue ( (int) (p.getBlue () * factor) ); } Pixel[0] Pixel red=190 green=244 blue=295 p -> Pixel[1] Pixel red=190 green=244 blue=295 Pixel[2] Pixel red=128 green=164 blue=198 ... factor 1.5 i 2

  21. STEP BY STEP for ( int i = 0; i < pixels.length; i++ ) { Pixel p = pixels[i]; p.setRed ( (int) (p.getRed () * factor) ); p.setGreen( (int) (p.getGreen() * factor) ); p.setBlue ( (int) (p.getBlue () * factor) ); } Pixel[0] Pixel red=190 green=244 blue=295 Pixel[0] Pixel red=190 green=244 blue=295 p -> Pixel[0] Pixel red=128 green=164 blue=198 ... factor 1.5 i 2 ... AND SO ON

  22. STEP BY STEP for ( int i = 0; i < pixels.length; i++ ) { Pixel p = pixels[i]; p.setRed ( (int) (p.getRed () * factor) ); p.setGreen( (int) (p.getGreen() * factor) ); p.setBlue ( (int) (p.getBlue () * factor) ); } ... Pixel[179197] Pixel red=69 green=75 blue=30 p -> Pixel[179198] Pixel red=69 green=75 blue= 30 Pixel[179199] Pixel red=40 green=50 blue=18 factor 1.5 i 179198

  23. STEP BY STEP for ( int i = 0; i < pixels.length; i++ ) { Pixel p = pixels[i]; p.setRed ( (int) (p.getRed () * factor) ); p.setGreen( (int) (p.getGreen() * factor) ); p.setBlue ( (int) (p.getBlue () * factor) ); } ... Pixel[179197] Pixel red=69 green=75 blue=30 p -> Pixel[179198] Pixel red=69 green=75 blue=30 Pixel[179199] Pixel red=40 green=50 blue=18 factor 1.5 i 179199

  24. STEP BY STEP for ( int i = 0; i < pixels.length; i++ ) { Pixel p = pixels[i]; p.setRed ( (int) (p.getRed () * factor) ); p.setGreen( (int) (p.getGreen() * factor) ); p.setBlue ( (int) (p.getBlue () * factor) ); } ... Pixel[179197] Pixel red=69 green=75 blue=30 Pixel[179198] Pixel red=69 green=75 blue=30 p -> Pixel[179199] Pixel red=40 green=50 blue=18 factor 1.5 i 179199

  25. STEP BY STEP for ( int i = 0; i < pixels.length; i++ ) { Pixel p = pixels[i]; p.setRed ( (int) (p.getRed () * factor) ); p.setGreen( (int) (p.getGreen() * factor) ); p.setBlue ( (int) (p.getBlue () * factor) ); } ... Pixel[179197] Pixel red=69 green=75 blue=30 Pixel[179198] Pixel red=69 green=75 blue=30 p -> Pixel[179199] Pixel red= 60 green=50 blue=18 factor 1.5 i 179199

Recommend

2D Computer Graphics Diego Nehab Summer 2020 IMPA 1 Inflection points and double points The

2D Computer Graphics Diego Nehab Summer 2020 IMPA 1 Inflection points and double points The

2D Computer Graphics Diego Nehab Summer 2020 IMPA 1 Inflection points and double points The coordinates P G of P in G are T P F F P F G P G F T P G P G T P F (In RP 2 the adjugate T is as good as the inverse) A line in L has coordinates L F a

986 views • 77 slides
Closest Pair of Points Cormen et.al 33.4 Closest Pair of Points Closest pair. Given n points in

Closest Pair of Points Cormen et.al 33.4 Closest Pair of Points Closest pair. Given n points in

Closest Pair of Points Cormen et.al 33.4 Closest Pair of Points Closest pair. Given n points in the plane, find a pair with smallest Euclidean distance between them. Fundamental geometric problem. Graphics, computer vision, geographic

585 views • 19 slides
CMPS 112, Spring 2019 Midterm (Solutions) Section Points Score Reductions 10 points Lists

CMPS 112, Spring 2019 Midterm (Solutions) Section Points Score Reductions 10 points Lists

CMPS 112, Spring 2019 Midterm (Solutions) Section Points Score Reductions 10 points Lists 15 points Snoc lists 20 points Matrices 50 points Total 95 points Instructions You have 95 minutes to complete this exam. This exam is

273 views • 11 slides
Speaking points Ministerial Conference, Belgrade 2 9 -3 0 Novem ber 2 0 1 1 We all understand

Speaking points Ministerial Conference, Belgrade 2 9 -3 0 Novem ber 2 0 1 1 We all understand

Speaking points Ministerial Conference, Belgrade 2 9 -3 0 Novem ber 2 0 1 1 We all understand and recognise that drug trafficking is a well organised criminal activity that causes significant damage to our societies and we heard yesterday

515 views • 6 slides
FIS POINTS HARD TO EXPLAIN AT THE BEST OF TIMES W HERE DO WE START ? W ITH THE FIS L IST @ FIS -

FIS POINTS HARD TO EXPLAIN AT THE BEST OF TIMES W HERE DO WE START ? W ITH THE FIS L IST @ FIS -

FIS POINTS HARD TO EXPLAIN AT THE BEST OF TIMES W HERE DO WE START ? W ITH THE FIS L IST @ FIS - SKI . COM Whos Who? Aksel Lund Svindal #1 in Downhill = 0 points Dustin Cook # 19 in Super G = 5.34 points Caeden Carruthers # 1829 in Slalom

126 views • 9 slides
http://falconn-lib.org Dataset: n points in R d , r &gt; 0 Dataset: n points in R d , r

http://falconn-lib.org Dataset: n points in R d , r &gt; 0 Dataset: n points in R d , r

Ilya Razenshteyn (MIT) joint with Alexandr Andoni (Columbia), Piotr Indyk (MIT), Thijs Laarhoven (TU Eindhoven) and Ludwig Schmidt (MIT) http://falconn-lib.org Dataset: n points in R d , r &gt; 0 Dataset: n points in R d , r &gt; 0

2.24k views • 184 slides
Top of Page: Two inches from the top of the page Title (centered) Double space

Top of Page: Two inches from the top of the page Title (centered) Double space

Four Easy Points Criterion D: Formal Presentation (4 points) This criterion assesses the extent to which the presentation follows the standard format expected for academic writing and the extent to which this aids effective communication.

463 views • 19 slides
CMSC427 Rendering polylines Points, polylines and polygons Points Polyline Polygon Polyline can

CMSC427 Rendering polylines Points, polylines and polygons Points Polyline Polygon Polyline can

CMSC427 Rendering polylines Points, polylines and polygons Points Polyline Polygon Polyline can be rendered as each Points, polylines and polygons hMps://processing.org/reference/beginShape_.html Points Polyline Polygon beginShape(POINTS);

455 views • 11 slides
CREATING ACCESS POINTS Learning Objectives Understand next generation cataloging concepts

CREATING ACCESS POINTS Learning Objectives Understand next generation cataloging concepts

8/29/2013 RDA Training for Kentucky Public Libraries CREATING ACCESS POINTS Learning Objectives Understand next generation cataloging concepts WITH RDA Importance to users (customers) Next generation library systems Identify

311 views • 28 slides
Computing Week 9 LBSC 671 Creating Information Infrastructures Muddiest Points BIBFRAME

Computing Week 9 LBSC 671 Creating Information Infrastructures Muddiest Points BIBFRAME

Computing Week 9 LBSC 671 Creating Information Infrastructures Muddiest Points BIBFRAME The analog hole Goals for Today Understand what makes stupid computers seem smart Understand how the Internet works Commercial

1.43k views • 58 slides
September 27, 2013 New MAP-based Performance Policy Category Points Points Weighted Points

September 27, 2013 New MAP-based Performance Policy Category Points Points Weighted Points

September 27, 2013 New MAP-based Performance Policy Category Points Points Weighted Points Weighted Possible Earned Possible Points Earned MAP Growth 20 18 2.25 2.06 MAP 10 7 0.75 0.50 Attainment ELL 5 4 0.25 0.20 Other

467 views • 18 slides
+ 15 +9 +8 Mill quality as well as quantity of pleasure Satisfaction of preferences as

+ 15 +9 +8 Mill quality as well as quantity of pleasure Satisfaction of preferences as

Criticisms of consequentialism and Kant Quiz 1 (Out of 4 points; 5 points possible) Ethical Theory (continued) In one clear sentence, state one of the criticisms of consequentialism discussed in the course pack. (up to 2 bonus points): In one

212 views • 7 slides
Completion Outcomes Degree/Transfer 32 Momentum Points Persistence 33 Momentum Points

Completion Outcomes Degree/Transfer 32 Momentum Points Persistence 33 Momentum Points

Completion Outcomes Degree/Transfer 32 Momentum Points Persistence 33 Momentum Points 30 Units 34 Momentum Points Remedial 35 Completion Outcomes CTE 36 California Community Colleges Chancellor's Office 2014 Score Card

318 views • 6 slides
Diabetes Basics Key Points That All Personnel Need To Know

Diabetes Basics Key Points That All Personnel Need To Know

Diabetes Basics Key Points That All Personnel Need To Know Learning Objectives Participants will be able to understand: What is diabetes? Why care at school is required? Basic

714 views • 29 slides
Constructing RDA Access Points Adam L. Schiff Principal Cataloger University of Washington

Constructing RDA Access Points Adam L. Schiff Principal Cataloger University of Washington

10/16/2012 Constructing RDA Access Points Adam L. Schiff Principal Cataloger University of Washington Libraries aschiff@uw.edu Goals To understand the key changes in constructing access points in RDA compared to AACR2, with emphasis on

1.33k views • 106 slides
Math 233 - October 6, 2009 Understand the nature of critical points for quadratic functions.

Math 233 - October 6, 2009 Understand the nature of critical points for quadratic functions.

Math 233 - October 6, 2009 Understand the nature of critical points for quadratic functions. Understand the second derivative test for functions of two variables. 1. Let f ( x , y ) = 3 x 3 + y 2 9 x + 4 y . (a) Find all critical

359 views • 14 slides
Environmental Focal Points California Air Resources Board Environmental Focal Points

Environmental Focal Points California Air Resources Board Environmental Focal Points

Environmental Focal Points California Air Resources Board Environmental Focal Points Department of Pesticide Regulation Environmental Focal Points CalRecycle Environmental Focal Points Department of Toxic Substances Control

366 views • 18 slides
CS4495/6495 Introduction to Computer Vision 4B-L2 Matching feature points (a little) Feature

CS4495/6495 Introduction to Computer Vision 4B-L2 Matching feature points (a little) Feature

CS4495/6495 Introduction to Computer Vision 4B-L2 Matching feature points (a little) Feature Points We know how to detect points Feature Points We know how to describe them Feature Points Next question: How to match them? ? How

329 views • 18 slides
La fonction ` a deux points et ` a trois points des quadrangulations et cartes Eric Fusy

La fonction ` a deux points et ` a trois points des quadrangulations et cartes Eric Fusy

La fonction ` a deux points et ` a trois points des quadrangulations et cartes Eric Fusy (CNRS/LIX) Travaux avec J er emie Bouttier et Emmanuel Guitter S eminaire Calin, LIPN, Mai 2014 Maps Def. Planar map = connected graph

920 views • 76 slides
Brunel Law School June 2012 The penalty points system in GB Purposes of points

Brunel Law School June 2012 The penalty points system in GB Purposes of points

Claire Corbett Criminal Justice Research Centre Brunel Law School June 2012 The penalty points system in GB Purposes of points /disqualification: to deter and/or punish. Introduced in 1972. Between 3-11 for a single offence; 12+ in

184 views • 16 slides
Interest points CSE 576 Ali Farhadi Many slides from

Interest points CSE 576 Ali Farhadi Many slides from

Interest points CSE 576 Ali Farhadi Many slides from Steve Seitz, Larry Zitnick How can we find corresponding points? Not always easy NASA Mars Rover images Answer below (look for

602 views • 34 slides
The projective line minus three fractional 3 kinds of integral points points Darmons M

The projective line minus three fractional 3 kinds of integral points points Darmons M

The projective line minus three fractional points Bjorn Poonen The projective line minus three fractional 3 kinds of integral points points Darmons M -curves Campanas orbifolds Almost integral points Counting points of Bjorn Poonen

377 views • 23 slides
Weierstrass semigroups at several points, total inflection points on curves and coding theory C

Weierstrass semigroups at several points, total inflection points on curves and coding theory C

Weierstrass semigroups at several points, total inflection points on curves and coding theory C cero Carvalho Faculdade de Matem atica Universidade Federal de Uberl andia Algebraic curves over finite fields RICAM - November 1115,

1.56k views • 119 slides
1 Limitations of Polygonal Meshes Planar facets (&amp; silhouettes) Fixed resolution

1 Limitations of Polygonal Meshes Planar facets (&amp; silhouettes) Fixed resolution

Introduction to Curves Modelling Points Defined by 2D or 3D coordinates Lines Defined by a set of 2 points Polygons Defined by a sequence of lines Defined by a list of ordered points 3D Models Triangular mesh 1

396 views • 18 slides

More recommend