THE DISTANCE FROM A POINT TO A LINE IN 2- SPACE

Similar documents
Projection Transformations. and

PLEASURE TEST SERIES (XI) - 04 By O.P. Gupta (For stuffs on Math, click at theopgupta.com)

Section 7.2: Direction Fields and Euler s Methods

EVALUATION OF TRIGONOMETRIC FUNCTIONS

Our starting point is the following sketch of part of one of these polygons having n vertexes and side-length s-

Numerical Methods Lecture 6 - Curve Fitting Techniques

Introduction to Sigma Notation

The isoperimetric problem on the hypercube

Single-view Metrology and Camera Calibration

Single-view Metrology and Camera Calibration

EECS 442 Computer vision. Multiple view geometry Affine structure from Motion

EECS 442 Computer vision. Multiple view geometry Affine structure from Motion

Alpha Individual Solutions MAΘ National Convention 2013

Normals. In OpenGL the normal vector is part of the state Set by glnormal*()

condition w i B i S maximum u i

Homework 1 Solutions MA 522 Fall 2017

n n B. How many subsets of C are there of cardinality n. We are selecting elements for such a

Geometry. Parallel Lines. Slide 1 / 206. Slide 2 / 206. Slide 3 / 206. Table of Contents

Parallel Lines - Corresponding Angles Lines & Transversals. Parallel Lines - Alternate Interior Angles Parallel Lines & Proofs

Lighting and Shading. Outline. Raytracing Example. Global Illumination. Local Illumination. Radiosity Example

EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS

Assignment 5; Due Friday, February 10

27 Refraction, Dispersion, Internal Reflection

COMPOSITE TRANSFORMATIONS. DOES ORDER MATTER Use the composite transformation to plot A B C and A B C. 1a)

Mathematics and Art Activity - Basic Plane Tessellation with GeoGebra

c) Did doing the transformations in a different order matter? Explain why?

A Very Simple Approach for 3-D to 2-D Mapping

Chapter 18: Ray Optics Questions & Problems

Factor. 8th Grade Math. 2D Geometry: Transformations. 3 Examples/ Counterexamples. Vocab Word. Slide 3 / 227. Slide 4 / 227.

Lecture 7 7 Refraction and Snell s Law Reading Assignment: Read Kipnis Chapter 4 Refraction of Light, Section III, IV

Physics 30 Lesson 12 Diffraction Gratings

Parabolic Path to a Best Best-Fit Line:

Intro to Scientific Computing: Solutions

INSCRIBED CIRCLE OF GENERAL SEMI-REGULAR POLYGON AND SOME OF ITS FEATURES

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana

Existential quantification. Universal quantification. Domain of Quantification. Existential quantification

G.CO.A.5 WORKSHEET #9 geometrycommoncore NAME: 1 DOUBLE REFLECTIONS OVER INTERSECTING LINES Plot each of the stages of the composite transformation.

SD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters.

MAXIMUM MATCHINGS IN COMPLETE MULTIPARTITE GRAPHS

Capturing a Concave Polygon with Two Disc-Shaped Fingers

Visualization of Gauss-Bonnet Theorem

CSE 5311 Notes 16: Matrices

Math Section 2.2 Polynomial Functions

FOMGT 301. Spring 2004

Lenses and Imaging (Part I)

Pattern Recognition Systems Lab 1 Least Mean Squares

GRADIENT DESCENT. Admin 10/24/13. Assignment 5. David Kauchak CS 451 Fall 2013

Math 10C Long Range Plans

The Platonic solids The five regular polyhedra

Light and shading. Source: A. Efros

EX 1 Find the length of each side EX 2 Find the value of a, b, c, d. if the perimeter is 20.

CS 683: Advanced Design and Analysis of Algorithms

Computational Geometry

Fuzzy Transportation Problem Using Triangular Membership Function-A New approach

1.2 Binomial Coefficients and Subsets

Using VTR Emulation on Avid Systems

CONTINUI TY. JEE-Mathematics. Illustration 1 : Solution : Illustration 2 : 1. CONTINUOUS FUNCTIONS :

Lenses and Imaging (Part I) Parabloid mirror: perfect focusing

Accuracy Improvement in Camera Calibration

Übungsblatt 2 Geometrische und Technische Optik WS 2012/2013

A Resource for Free-standing Mathematics Qualifications

Texture Mapping. Jian Huang. This set of slides references the ones used at Ohio State for instruction.

Ones Assignment Method for Solving Traveling Salesman Problem

CSE 417: Algorithms and Computational Complexity

Protected points in ordered trees

Lecture 18. Optimization in n dimensions

Solution printed. Do not start the test until instructed to do so! CS 2604 Data Structures Midterm Spring, Instructions:

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only

Introductions to Pochhammer

OCR Statistics 1. Working with data. Section 3: Measures of spread

FINITE DIFFERENCE TIME DOMAIN METHOD (FDTD)

Introduction to aberrations

CS Polygon Scan Conversion. Slide 1

Consider the following population data for the state of California. Year Population

802.1ad Provider & Provider Edge Bridges

Algorithms for Disk Covering Problems with the Most Points

Force Network Analysis using Complementary Energy

Convex hull ( 凸殻 ) property

Geometry Constructions

Panel Methods : Mini-Lecture. David Willis

South Slave Divisional Education Council. Math 10C

Name Date Hr. ALGEBRA 1-2 SPRING FINAL MULTIPLE CHOICE REVIEW #1

An Efficient Algorithm for Graph Bisection of Triangularizations

GRADIENT DESCENT. An aside: text classification. Text: raw data. Admin 9/27/16. Assignment 3 graded. Assignment 5. David Kauchak CS 158 Fall 2016

9 x and g(x) = 4. x. Find (x) 3.6. I. Combining Functions. A. From Equations. Example: Let f(x) = and its domain. Example: Let f(x) = and g(x) = x x 4

Computational Methods for the Euler Equations

Outline. M/M/m Queue. Analysis of M/M/m Queue. EEC 686/785 Modeling & Performance Evaluation of Computer Systems. Lecture 23

Introduction. Loops. CSc 553. Principles of Compilation. 31 : Dominators and Natural Loops. Department of Computer Science University of Arizona

An Efficient Algorithm for Graph Bisection of Triangularizations

ON THE DEFINITION OF A CLOSE-TO-CONVEX FUNCTION

Appendix D. Controller Implementation

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)

RECONSTRUCTION OF 3D LINEAR PRIMITIVES FROM MULTIPLE VIEWS FOR URBAN AREAS MODELISATION

Recursion. Recursion. Mathematical induction: example. Recursion. The sum of the first n odd numbers is n 2 : Informal proof: Principle:

Recursion. Computer Science S-111 Harvard University David G. Sullivan, Ph.D. Review: Method Frames

CIS 121 Data Structures and Algorithms with Java Spring Stacks and Queues Monday, February 12 / Tuesday, February 13

Panel for Adobe Premiere Pro CC Partner Solution

Spherical Mirrors. Types of spherical mirrors. Lecture convex mirror: the. geometrical center is on the. opposite side of the mirror as

Counting Regions in the Plane and More 1

EE 584 MACHINE VISION

Transcription:

MCV 4UI THE DISTNCE FOM OINT TO LINE IN - SCE LENING GOL: Be able to erive the forula for the istace fro a poit to a lie i. Be able to calculate the istace fro a poit to a lie i a the istace betwee parallel lies i. Let x y be the equatio of a lie i -space. Call it l.. Let ( ) be ay poit i -space. x, y. ( x, y l ). The the shortest istace,, fro to the lie is the perpeicular istace fro to a poit o the lie, call it. 4. Let ( ) be ay poit o the lie. x, y ( x, y ) l ( x, y ) 5. The istace fro to the lie ca be fou by fiig the agitue of the projectio of oto the oral of the lie,. agitue of the projectio of oto. ( ) x, y l ( x, y )

SO proj oto ( x x, y y ) B) B) x x y By Sice ( x ) is o the lie, x y, y C x By The istace fro the poit ( x ) to the lie x y is:, y x y 6. THE DISTNCE BETWEEN LLEL LINES The istace betwee parallel lies is the sae as the istace fro a poit to a lie. To fi the istace betwee parallel lies, select a poit fro oe of the lies a fi the istace fro that poit to the other lie. 7. Fi the istace fro the poit (4, 5) to the lie x + y 5 x y (4) + ( 5) 5 + 5 The istace is uits. 5

MCV 4UI THE DISTNCE FOM OINT TO LNE IN -SCE LENING GOL: Be able to erive the forula for the istace fro a poit to a plae i. Be able to calculate the istace fro a poit to a plae i a the istace betwee parallel plaes i.. Let x y z + D be the equatio of a plae i -space.. Let be ay poit i -space.,. The shortest istace,, fro a poit to the plae is the perpeicular istace fro to a poit o the plae, call it., 4. Let be ay poit o the plae,, 5. The istace fro to the plae ca be fou by fiig the agitue of the projectio of oto the oral of the plae,. (Just like a pt to a lie above.),

SO p roj oto ( x x, y y, z z ) B, C) B, C) x x y By z Cz Sice is o the plae, x y z + D, D x By Cz The istace fro the poit to the plae x y z + D is:, x y z + D 6. THE DISTNCE BETWEEN LLEL LNES The istace betwee parallel lies is the sae as the istace fro a poit to a lie. To fi the istace betwee parallel lies, select a poit fro oe of the lies a fi the istace fro that poit to the other lie. 7. Fi the istace betwee the parallel plaes, x + y 7z 5 a x + 6y z +. Solutio: poit o the plae, x + y 7z 5 is (5,,). Use this as ( x, y, z ) So you ust use the, B, C, D values fro x + 6y z +.. x y z + D ( ) (5) + 6() + ( ) + 6 + 48 The istace is 486 48 486 uits.

MCV THE DISTNCE FOM OINT TO LINE IN -SCE LENING GOL: Be able to calculate the istace fro a poit to a lie i a the istace betwee parallel lies i. The istace fro the poit to the lie ( x, y, z) ( x, y, z ) + k(,, ) is (, ) is:,,, k, where is the kow poit, a, 6. THE DISTNCE BETWEEN LLEL LINES IN -SCE The istace betwee parallel lies i -space is the sae as the istace fro a poit to a lie i -space. To fi the istace betwee parallel lies, select a poit fro oe of the lies a fi the istace fro that poit to the other lie. 7. Fi the istace fro the poit (,,8) to the lie ( x, y, z) (,7, ) + k(,,9 ) (,,8) (,7, ) (, 9,) (, 9,) (,,9 ) (,,9 ) - -9 - -9 9 (,,7 ) (,,9 ) 58 86 The istace is 58 uits. 86