Quiz 2 [answer in the back] 2. Two line segments: S1: (1,2) to (5,6) S2: (3,5) to (7,3) Compute the intersection 3. Explain the complexity for line segment.

Slides:

Advertisements

Similar presentations

. . CONSTRUCTION OF A RIGHT TRIANGLE IF THE ONE ANGLE OF A TRIANGLE IS 90,IT IS CALLED RIGHT TRIANGLE.

Advertisements

Computational Geometry

Voronoi Diagram – Fortune ’ s Algorithm Reporter: GI1 11 號蔡逸凡 Date: 2004/10/28 Reference: Computational Geometry ch7 ISBN:

Line Segment Intersection. Balanced binary search tree Internal nodes: Rightmost leaf in its left subtree Status Structure T.

Map Overlay Algorithm. Birch forest Wolves Map 1: Vegetation Map 2: Animals.

I. The Problem of Molding Does a given object have a mold from which it can be removed? object not removable mold 1 object removable Assumptions The object.

Overlay of Two Subdivisions

Chapter 1: Tools of Geometry

CS138A Line Segment Intersection Peter Schröder.

Digitising. Planning : Analyzing Form Analyze geometric features of a form Decompose a form into different parts Rule surface? Sweep surface? Look for.

CP = E[ s 2, s 5, s 1, s 3, s 2 ’, s 3 ’, s 4, s 1 ’, s 4 ’, s 5 ’ ] S[] I[] s1s1 s1’s1’ s2s2 s2’s2’ s4s4 s4’s4’ s3s3 s3’s3’ s5s5 s5’s5’ Plane Sweep Algorithm.

EXAMPLE 2 Use properties of isosceles trapezoids Arch

EXAMPLE 1 Identify polygons SOLUTION Tell whether the figure is a polygon and whether it is convex or concave. Some segments intersect more than two segments,

Orthogonal Line Segment Intersection Given N horizontal and N vertical line segments, find all intersections. All x and y coordinates are distinct.

UNC Chapel Hill M. C. Lin Line Segment Intersection Chapter 2 of the Textbook Driving Applications –Map overlap problems –3D Polyhedral Morphing.

Graph each inequality. 1. x ≤ 1 ANSWER 8 2. –2 ≤ x ≤ 3 ANSWER.

Name points, lines, and planes Chapter 1.1 Undefined Terms Point Line Plane Space Defined Terms Segment Ray What are collinear and coplanar points? What.

CLASS OPENER: Is the given sequence arithmetic, if so what is the common difference? 1.1,4,9,16… 2.-21, -18, -15, -12… 3.97, 86, 75, 64… 4.0, 1, 3, 6,

1.4 and 1.5 Quiz on Friday!. When two lines intersect, they intersect in a ___________ Point.

Let C be the simplicial complex on the right (the boundary of a tetrahedron). Find the following: C 0 = C 1 = C 2 = C 3 = Z 0 = Explain your answer for.

Angle Relations. How are angle 1 & 3 related? A) interior B) exterior C) vertical D) adjacent E) corresponding.

3.6 Prove Theorems About Perpendicular Lines

Proving Congruence – SSS, SAS Side-Side-Side Congruence Postulate (SSS) If the sides of one triangle are congruent to the sides of a second triangle, then.

Quiz 5 May , 5.2 Discrete Probability. Quiz 4: May-04 ’ pm In the following experiment we roll a fair die 5 times. a) What is the.

4.2 Triangle Congruence by SSS and SAS You can prove that two triangles are congruent without having to show that all corresponding parts are congruent.

Identify Points, Lines, and Planes

3.1 Warm Up Warm Up Lesson Quiz Lesson Quiz Lesson Presentation Lesson Presentation Identify Pairs of Lines and Angles.

Good Luck !! Type your Instructions for your quiz.

Review Quiz: 1. Maria is 4 ft 2 in. tall. To find the height of a flagpole, she measured her shadow and the pole’s shadow. What is the height h of the.

Segment Lengths in Circles 10.5 Chapter 10 Circles Section 10.5 Segment Lengths in Circles Find the lengths of segments of chords. Find the lengths of.

By Irma Crespo Informal Proof. What do you see? ISZBCrespo.

WARM UP 01/09/17 Go over the words and write the Definition of each:

Warm Up Name all points on the Coordinate Plane and Note their Corresponding Quadrant or Axis..

WARM UP 1.5 On desk!.

1.4 Sketching Intersections

Exercise 4.4 Q.6 (a) Angle between CDEF and EFGH.

CHAPTER 1 SECTION 4.

EXAMPLE 1 Identify polygons

Make Your Own Quiz.

1.1 Points, Lines and Planes

Tips Need to Consider When Organizing a College Event

'. \s\s I. '.. '... · \ \ \,, I.

Understanding Points, 1-1 Lines, and Planes Warm Up

Computational Geometry Capter:1-2.1

סדר דין פלילי – חקיקה ומהות ההליך הפלילי

ماجستير إدارة المعارض من بريطانيا

Objectives Identify, name, and draw points, lines, segments, rays, and planes. Apply basic facts about points, lines, and planes.

Objectives Use geometric mean to find segment lengths in right triangles. Apply similarity relationships in right triangles to solve problems.

EXAMPLE 1 Identify polygons

SAVE SAVE SAVE Geometry/Trig Name: _____________________________

' '· \ ·' ,,,,

EXAMPLE 1 Draw Conclusions In the diagram, AB BC. What

Point, Line, Plane Unit 1.

2. What is the intersection of AD and DB?

Geometry Points, Lines and Planes

Revision Exercise 6 Q.5 Angle between XEF and DEF.

3.1 Parallel lines and transversals

Lesson 3.1 : Identify Pairs of Lines and Angles

1. What is the distance between the points (2, 3) and (5, 7)?

Bell Work Problem 1) Predict the next three numbers.

Geometry Quiz Review!.

You must show all steps of your working out.

Overlay of Two Subdivisions

Unusual New Year’s Customs

EXAMPLE 1 Identify polygons

Factorise and solve the following:

Presentation transcript:

Quiz 2 [answer in the back] 2. Two line segments: S1: (1,2) to (5,6) S2: (3,5) to (7,3) Compute the intersection 3. Explain the complexity for line segment intersection is O((n+I)logn) 1. Sketch the sweep line and complete the corresponding event queue and T. Perform all required steps and highlight the step that report an intersection (an intersection between ??)

s1s1 s2s2 s3s3 a b c d e f Event Queue [ ] Event point: [ ] U = { } C = { } L = { } T = [ ]

s1s1 s2s2 s3s3 a b c d e f Event Queue [ ] Event point: [ ] U = { } C = { } L = { } T = [ ]

s1s1 s2s2 s3s3 a b c d e f Event Queue [ ] Event point: [ ] U = { } C = { } L = { } T = [ ]

s1s1 s2s2 s3s3 a b c d e f Event Queue [ ] Event point: [ ] U = { } C = { } L = { } T = [ ]

s1s1 s2s2 s3s3 a b c d e f Event Queue [ ] Event point: [ ] U = { } C = { } L = { } T = [ ]

s1s1 s2s2 s3s3 a b c d e f Event Queue [ ] Event point: [ ] U = { } C = { } L = { } T = [ ]

s1s1 s2s2 s3s3 a b c d e f Event Queue [ ] Event point: [ ] U = { } C = { } L = { } T = [ ]

s1s1 s2s2 s3s3 a b c d e f Event Queue [ bcdef ] Event point: [ a ] U = { s1 } C = { } L = { } T = [ s1 ]

s1s1 s2s2 s3s3 a b c e d f Event Queue [ ] Event point: [ ] U = { } C = { } L = { } T = [ ] g s4s4

s1s1 s2s2 s3s3 a b c d e f Event Queue [ cdef ] Event point: [ b ] U = { s2 } C = { } L = { } T = [ s1 s2 ] S ’ =s2, sl = s1, find intersect S ” =s2, sr =nil, no-op

s1s1 s2s2 s3s3 a b c d e f Event Queue [ xdef ] Event point: [ c ] U = { s3 } C = { } L = { } T = [ s1 s2 s3 ] S ’ =s3, sl = s2, find intersect->x S ” =s3, sr =nil, no-op x

s1s1 s2s2 s3s3 a b c d e f Event Queue [ def ] Event point: [ x ] U = { } C = { s2,s3 } L = { } Report intersection: T = [ s1 s3 s2 ] S ’ =s3, sl = s1, find intersect->y S ” =s2, sr =nil, no-op Y=d x

s1s1 s2s2 s3s3 a b c d e f Event Queue [ ef ] Event point: [ d ] U = { } C = { s3 } L = { s1 } Report intersection T = [ s3 s2 ] S ’ =s3, sl = nil, S ” =s3, sr =s2, intersect above scanline x

s1s1 s2s2 s3s3 a b c d e f Event Queue [ f ] Event point: [ e ] U = { } C = {} L = { s2 } T = [ s3 ] Sl=s3, sr = nil, no-op x

s1s1 s2s2 s3s3 a b c d e f Event Queue [] Event point: [ f ] U = { } C = {} L = { s3 } T = [ ] x