Planar convex hulls (I)

Similar documents
On Hamiltonian Tetrahedralizations Of Convex Polyhedra

Computer Graphics. Viewing & Projections

Priority Search Trees - Part I

Sheet Title: Building Renderings M. AS SHOWN Status: A.R.H.P.B. SUBMITTAL August 9, :07 pm

T H E S C I E N C E B E H I N D T H E A R T

Theorem 1. An undirected graph is a tree if and only if there is a unique simple path between any two of its vertices.

Face Detection and Recognition. Linear Algebra and Face Recognition. Face Recognition. Face Recognition. Dimension reduction

Applications of trees

NORTHLAKE APARTMENTS

VOID CABLE REQUIREMENTS

A ' / 1 6 " 5 ' / 4 " A4.2 48' - 0" 3 12' - 7" 13' - 11" 10' - 0" 9' - 0" 2' - 6" 1. 2: 12 INDICATES SHOW MELT TYP ABV ABV

Lecture 20: Minimum Spanning Trees (CLRS 23)

Differentiation of allergenic fungal spores by image analysis, with application to aerobiological counts

L.3922 M.C. L.3922 M.C. L.2996 M.C. L.3909 M.C. L.5632 M.C. L M.C. L.5632 M.C. L M.C. DRIVE STAR NORTH STAR NORTH NORTH DRIVE

4.1 Interval Scheduling. Chapter 4. Greedy Algorithms. Interval Scheduling: Greedy Algorithms. Interval Scheduling. Interval scheduling.

5/1/2018. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees

CMPS 2200 Fall Graphs. Carola Wenk. Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk

SAN JOSE CITY COLLEGE PHYSICAL EDUCATION BUILDING AND RENOVATED LAB BUILDING SYMBOL LIST & GENERAL NOTES - MECHANICAL

Weighted Graphs. Weighted graphs may be either directed or undirected.

COMP 250. Lecture 29. graph traversal. Nov. 15/16, 2017

An Optimal and Progressive Algorithm for Skyline Queries

CENTER POINT MEDICAL CENTER

Wedge clamp, double-acting for dies with tapered clamping edge

Distributed Set Reachability

The University of Sydney MATH 2009

Improving Union. Implementation. Union-by-size Code. Union-by-Size Find Analysis. Path Compression! Improving Find find(e)

Spanning Trees. BFS, DFS spanning tree Minimum spanning tree. March 28, 2018 Cinda Heeren / Geoffrey Tien 1

(Minimum) Spanning Trees

G-001 CHATHAM HARBOR AUNT LYDIA'S COVE CHATHAM ATLANTIC OCEAN INDEX OF NAVIGATION AIDS GENERAL NOTES: GENERAL PLAN A6 SCALE: 1" = 500' CANADA

Strongly connected components. Finding strongly-connected components

Graphs Depth First Search

Divided. diamonds. Mimic the look of facets in a bracelet that s deceptively deep RIGHT-ANGLE WEAVE. designed by Peggy Brinkman Matteliano

Graphs Breadth First Search

, k fftw ' et i 7. " W I T H M A. L I O E T O W A R 3 D JSrOKTE X l S T E O H A R I T Y F O R A L L. FIRE AT^ 10N1A, foerohlng * M».

Depth First Search. Yufei Tao. Department of Computer Science and Engineering Chinese University of Hong Kong

A Study of Fuzzy Linear Regression

Having a glimpse of some of the possibilities for solutions of linear systems, we move to methods of finding these solutions. The basic idea we shall

STATE AND LOCAL GOVERNMENT INFORMATION (EEO4)

CS 103 BFS Alorithm. Mark Redekopp

In which direction do compass needles always align? Why?

CHELOURANYAN CALENDAR FOR YEAR 3335 YEAR OF SAI RHAVË

G-001 SACO SACO BAY BIDDEFORD INDEX OF NAVIGATION AIDS GENERAL NOTES: GENERAL PLAN A6 SCALE: 1" = 1000' CANADA MAINE STATE PLANE GEOGRAPHIC NO.

STRATA PLAN OF LOT ONE, DISTRICT LOT 24505, SIMILKAMEEN DIVISION, YALE DISTRICT, PLAN EPP4206. OSOYOOS LAKE BLOCK REM. PARK D.L.

P a g e 5 1 of R e p o r t P B 4 / 0 9

CMSC 451: Lecture 4 Bridges and 2-Edge Connectivity Thursday, Sep 7, 2017

A L A BA M A L A W R E V IE W

k m The reason that his is very useful can be seen by examining the Taylor series expansion of some potential V(x) about a minimum point:

P a g e 3 6 of R e p o r t P B 4 / 0 9

5.5m ETL. Caldicot Level ETL. 5.8m. Sluice. Sluice ETL. 5.8m. Court House 6.7m. Caldicot Level. Pond. Fir Tree Farm. Manor House.

learning objectives learn what graphs are in mathematical terms learn how to represent graphs in computers learn about typical graph algorithms

CAVALIER SPA & SALON UPFIT

minimize c'x subject to subject to subject to

CHARACTERIZATION FROM EXPONENTIATED GAMMA DISTRIBUTION BASED ON RECORD VALUES

Housing Market Monitor

U100. cgen_by BYPASS. cgen_cp CLK_FPGA_P (OUT0A) OUT0 CLK_FPGA_N (OUT0B) OUT0 (OUT1A) OUT1 (OUT1B) OUT1 (OUT2A) OUT2 U10 DS90LT012AH (OUT2B) OUT2

Appendix C: Architectural Drawings

Easy Steps to build a part number... Tri-Start Series III CF P

STATE AND LOCAL GOVERNMENT INFORMATION (EEO4)

LWC 434 East First Street 4440 Garwood Place

Graph Search Algorithms

T h e C S E T I P r o j e c t

NEW FLOODWAY (CLOMR) TE TE PIN: GREENS OF ROCK HILL, LLC DB: 12209, PG: ' S67 46'18"E APPROX. FLOODWAY NEW BASE FLOOD (CLOMR)

February 12 th December 2018

Carley Foundry Customer Specification Index -12/1/16

ME 501A Seminar in Engineering Analysis Page 1

Correlation in tree The (ferromagnetic) Ising model

Posterior analysis of the compound truncated Weibull under different loss functions for censored data.

Closed Monochromatic Bishops Tours

WATER MOTOR GONG A/S RETARD CHAMBER WITH FLOW SWITCH CHECK VALVE WITH BALL DRIP F.D. SIAMESE CONNECTION-VERIFY LOCATION WITH CIVIL 2" MAIN DRAIN

SAMPLE CSc 340 EXAM QUESTIONS WITH SOLUTIONS: part 2

DETAIL MEASURE EVALUATE

For Sale: 4.6 Acres of Land on the Brewster / Orleans Town Line $750,000 Approved 8-Lot Subdivision

CONSTRUCTION DOCUMENTS

Graph Search (6A) Young Won Lim 5/18/18

Key: Town of Eastham - Fiscal Year :52 am

176 5 t h Fl oo r. 337 P o ly me r Ma te ri al s

MINI-CYLINDER ISO 6432 SERIES TP Ø mm AND ACCESSORIES

STAND OUT IN THE SHUFFLE

3WN6 Circuit-Breakers

ISLE OF WIGHT WALK, JOG OR RUN IT

Platform Controls. 1-1 Joystick Controllers. Boom Up/Down Controller Adjustments

ktmuwii INDEPENDENT IN Al.t THINCIS. NEUTRAL IN NOTHING* Sold at Cast. AI.GE" IS DKVI). Lowell's Bright Boy Stricken With Small Pox at Manila.

Control system of unmanned aerial vehicle used for endurance autonomous monitoring

MAT3707. Tutorial letter 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/201/1/2017

t r ès s r â 2s ré t s r té s s s s r é é ér t s 2 ï s t 1 s à r

Grade 7/8 Math Circles March 4/5, Graph Theory I- Solutions

- Prefixes 'mono', 'uni', 'bi' and 'du' - Why are there no asprins in the jungle? Because the parrots ate them all.

Research Article Balancing Energy Consumption in Clustered Wireless Sensor Networks

Data-Depend Hash Algorithm

CREATED USING THE RSC COMMUNICATION TEMPLATE (VER. 2.1) - SEE FOR DETAILS

/99 $10.00 (c) 1999 IEEE

Madad Khan, Saima Anis and Faisal Department of Mathematics, COMSATS Institute of Information Technology, Abbottabad, Pakistan

Inner Product Spaces INNER PRODUCTS

I M P O R T A N T S A F E T Y I N S T R U C T I O N S W h e n u s i n g t h i s e l e c t r o n i c d e v i c e, b a s i c p r e c a u t i o n s s h o

d e c b a d c b a d e c b a a c a d c c e b

Power Systems Control Prof. Wonhee Kim. Modeling in the Frequency and Time Domains

THE in-loop deblocking filter in the MPEG-4 AVC/H.264. Parallel Deblocking Filtering in MPEG-4 AVC/H.264 on Massively-Parallel Architectures

COHERENCE SCANNING INTERFEROMETRY

Connecting Deer Creek and River des Peres Greenway

[application note] AC QUIT Y U P L C / E L S / U V: ONE M E T HO DO LOGY FO R F FA, FAM E AND TAG ANA LYSIS O F BIO D I E S E L

Transcription:

Covx Hu Covxty Gv st P o ots 2D, tr ovx u s t sst ovx oyo tt ots ots o P A oyo P s ovx or y, P, t st s try P. Pr ovx us (I) Coutto Gotry [s 3250] Lur To Bowo Co ovx o-ovx 1 2 3 Covx Hu Covx Hu Covx Hu Gv st P o ots 2D, tr ovx u s t sst ovx oyo tt ots ots o P T ro: Gv st P o ots 2D, sr ort to out tr ovx u O o t rst ros stu CG My soutos s, t, tutv, xos tus Lots o tos roots t rtto ros s roto srto ros outut: st o ots o t CH ( oury orr) 4 5 6

Atos Pt : (sortst) oso-r t ro strt to Atos Pt : (sortst) oso-r t ro strt to S yss, t, roto roxt ots y tr CH Atos ost ost strt strt It sow tt t t oows CH(ost) sortst t s to t s t sortr o t ur t owr t 7 8 9 Prtto ros Atos os tr xst srt two ots? Prtto ros Atos os tr xst srt two ots? Atos F t two ots P tt r rtst wy YES NO 10 11 12

Atos Out Covxty: r vw F t two ots P tt r rtst wy Prorts o CH St = st o ots o t or 1+2, wt 1,2 [0,1], 1+2=1 Aorts or out t CH (P) Brut-or 3 Gt wr (or: Jrvz r) Quu Gr s Arw s ooto 1 + (1-1) 1 2 11+22+(1-1-2)3 Irt Dv--our C w o ttr? Lowr ou A ovx oto o ots 1, 2, s ot o t or 11+22+, wt [0,1], 1+2+ +=1 Ex: tr ossts o ovx otos o ts 3 vrts Wt ts otto, t ovx u CH(P) = ovx otos o ots P 13 14 15 Extr ots A ot s xtr tr xsts trou, su tt t otr ots o P r o t s s o (or o ) Extr ots A ot s xtr tr xsts trou, su tt t otr ots o P r o t s s o ( ot o ) xtr Covx Hu Prorts 16 17 18

Extr ots A ot s xtr tr xsts trou, su tt t otr ots o P r o t s s o ( ot o ) Extr ots A ot s xtr tr xsts trou, su tt t otr ots o P r o t s s o ( ot o ) Extr ots A ot s xtr tr xsts trou, su tt t otr ots o P r o t s s o ( ot o ) xtr xtr xtr rt ss rt ss: osr o CH or ot 19 20 21 Extr ots C: I ot s o t CH oy () t s xtr. Extr ots C: I ot s o t CH oy () t s xtr. CH Vrts Svr tys o ovx u outut r ov ots o t ovx u rtrry orr ots o t ovx u oury orr oy o-or ots rtrry orr oy o-or ots oury orr < xu or ots It y s tt out oury orr s rr w s tt ty t xtr ots s O( ) so sort s ot ot 22 23 24

Itror ots A ot s ot o t CH oy s ot t tror o tr or y tr otr ots o P (or tror o st or y two ots). Extr s A (, ) s xtr t otr ots o P r o o s o t (or o) Extr s A (, ) s xtr t otr ots o P r o o s o t (or o) xtr ot xtr 25 26 27 Extr s A (, ) s xtr t otr ots o P r o o s o t (or o) C: A r o ots (, ) or o t CH (, ) s xtr. Extr s A (, ) s xtr t otr ots o P r o o s o t (or o) C: A r o ots (, ) or o t CH (, ) s xtr. Extr s A (, ) s xtr t otr ots o P r o o s o t (or o) C: A r o ots (, ) or o t CH (, ) s xtr. xtr xtr xtr 28 29 30

Extr s A (, ) s xtr t otr ots o P r o o s o t (or o) C: A r o ots (, ) or o t CH (, ) s xtr. Extr s A (, ) s xtr t otr ots o P r o o s o t (or o) C: A r o ots (, ) or o t CH (, ) s xtr. Extr s A (, ) s xtr t otr ots o P r o o s o t (or o) C: A r o ots (, ) or o t CH (, ) s xtr. xtr xtr xtr 31 32 33 Brut or Gt wr (1970) CH y xtr s Aort (ut P) or stt rs (, ) (,) s xtr r Osrvtos CH ossts o xtr s srs vrtx wt xt I: us to t xt o Ayss? How to xtr to strt ro? Gv xtr, ow to t xt o? 34 35 36

Gt wr (1970) Gt wr (1970) Gt wr (1970) r C ot wt u x-oort s xtr ot wt xu x-oort s xtr ot wt u y-oort s xtr ot wt xu y-oort s xtr Proo C you t o so ots tt r urt to CH? 37 38 39 Gt wr (1970) Gt wr (1970) Gt wr (1970) Strt ro ot wt sst x-oort or t o, rt ost Strt ro ot wt sst x-oort or t o, rt ost // rst. HOW? Strt ro ot wt sst x-oort or t o, rt ost // rst. HOW? 40 41 42

Gt wr (1970) Gt wr (1970) Gt wr (1970) Strt ro ot wt sst x-oort or t o, rt ost // rst. HOW? Strt ro ot wt sst x-oort or t o, rt ost // rst or ot (!= ) out w- o wrt Strt ro ot wt sst x-oort or t o, rt ost // rst or ot (!= ) out w- o wrt t = ot wt sst outut (, ) s rst t = ot wt sst outut (, ) s rst //wt xt? rt ro u so 43 44 45 Gt wr (1970) Gt wr (1970) Gt wr (1970) 0 = ot wt sst x-oort ( or t o, rt ost) 0 = ot wt sst x-oort ( or t o, rt ost) 0 = ot wt sst x-oort ( or t o, rt ost) = 0 = 0 = 0 rt or ot (!= ) rt or ot (!= ) rt or ot (!= ) out w- o wrt out w- o wrt out w- o wrt t = ot wt sst outut (, ) s CH t = ot wt sst outut (, ) s CH t = ot wt sst outut (, ) s CH = = = ut = 0 //ut t sovrs rst ot ut = 0 //ut t sovrs rst ot 0 ut = 0 //ut t sovrs rst ot 0 46 47 48

Gt wr (1970) Gt wr (1970) Gt wr (1970) 0 = ot wt sst x-oort ( or t o, rt ost) = 0 //t t ot rt or ot (!= ) out w- o wrt 0 = ot wt sst x-oort ( or t o, rt ost) = 0 rt or ot (!= ) out w- o wrt Dos t ort wor o rt ss? Gt wr rus O() t, wr s t sz o t CH(P) t = ot wt sst outut (, ) s CH t = ot wt sst outut (, ) s CH How s/r or st o ots? = ut = 0 //ut t sovrs rst ot 0 = ut = 0 0 Sow xs tt trr st/worst ss Dsuss w t-wr s oo o Ayss Ayss or vrtx o t CH, t ts O() ovr O(), wr s t sz o t CH(P) 49 50 51 Sury ur u Gt wr Rus O() t, wr s t sz o t CH(P) ts s t s s or = O(), t wr ts O( 2 ) rt ost ot Fstr orts r ow Gt wr xts sy to 3D or y yrs ws t rry ort or 3D Quu t ost ot owr u 52 53 54

Quu (t 1970s) Quu (t 1970s) Quu (t 1970s) Sr to Qusort ( so wy) I: strt wt 2 xtr ots 55 56 57 Quu (t 1970s) Quu (t 1970s) Quu (t 1970s) CH ossts o ur u (CH o P1) owr u (CH o P2) CH ossts o ur u (CH o P1) owr u (CH o P2) CH ossts o ur u (CH o P1) owr u (CH o P2) P1 P1 P1 P2 P2 P2 58 59 60

Quu (t 1970s) Quu (t 1970s) Quu (t 1970s) W t CH o P1 CH o P2 srty Frst t s ous o P1 For ots P1: out st(, ) P1 P1 P2 61 62 63 Quu (t 1970s) Quu (t 1970s) Quu (t 1970s) F t ot wt rst st (.. urtst wy ro ) C: ust xtr ot ( tus o t CH o P1) C: ust xtr ot ( tus o t CH) Proo:? Proo:? t s or or ots or ow 64 65 66

Quu (t 1970s) Quu (t 1970s) Quu (t 1970s) Dsr ots s tr Dsr ots s tr Rurs o t ots t o rt o 67 68 69 Quu (t 1970s) Quu (t 1970s) Quu (t 1970s) Cout CH o P2 sry Quu (P), rtto P to P1, P2 rtur Quu(,, P1) + Quu(,,P2) Quu(,,P) //vrt: P s st o ots o t t o P ty => rtur tyst or ot P: out ts st to t = ot wt x st t P1 = ots to t t o t P2 = ots to t t o rtur Quu(,,P1) + + Quu(,,P2) 70 71 72

Quu (t 1970s) Gr s (t 1960s) I t 60s to t B Ls rur t u o 10,000 ots, or w urt ort ws too sow Gr vo s s ort w rus O( ) o sort us r ss Ayss: Gr s Wrt rurr rto or ts ru t Wt s t st s ru t? Sow x Wt s t worst s ru t? Sow x Mor xrss: Aru tt Quu s vr oxty s O() o ots tt r uory strut. 73 74 75 Gr s (t 1960s) Gr s (t 1960s) I: strt ro ot tror to t u ots o t oury r r orr rou 76 77 78

Gr s (t 1960s) Gr s (t 1960s) Gr s (t 1960s) I: strt ro ot tror to t u I: strt ro ot tror to t u I: strt ro ot tror to t u orr ots y tr w wrt orr ots y tr w wrt orr ots y tr w wrt = t (.y -.y)/(.x -.x) 79 80 81 Gr s (t 1960s) Gr s (t 1960s) Gr s (t 1960s) I: trvrs t ots ts orr,,,,,,, I: trvrs t ots ts orr,,,,,,, I: trvrs t ots ts orr,,,,,,, ty w ut, S ty w ut, S S = (, ) Ivrt: w t S s t CH o t ots trvrs so r S = (, ) Ivrt: w t S s t CH o t ots trvrs so r 82 83 84

Gr s (t 1960s) Gr s (t 1960s) Gr s (t 1960s) Now w r ot : wt o w o wt t? Now w r ot : wt o w o wt t? Now w r ot : wt o w o wt t? Is (,, ) ovx? Is (,, ) ovx? YES! S = (, ) Ivrt: w t S s t CH o t ots trvrs so r S = (, ) Ivrt: w t S s t CH o t ots trvrs so r S = (, ) Ivrt: w t S s t CH o t ots trvrs so r 85 86 87 Gr s (t 1960s) Gr s s t o? Gr s (t 1960s) Now w r ot : (+S) stys ovx: to S Now w r ot : (+S) stys ovx : to S Now w r ot : Is (,, ) ovx? YES! Is (,, ) ovx? YES! S = (,, ) Ivrt: w t S s t CH o t ots trvrs so r S = (,, ) Ivrt: w t S s t CH o t ots trvrs so r S = (,, ) Ivrt: w t S s t CH o t ots trvrs so r 88 89 90

Gr s (t 1960s) Gr s (t 1960s) Gr s (t 1960s) Now w r ot : s t o? NO Now w r ot : s t o? NO Now w r ot : s t o? NO // t, us (,,,) ot ovx S = (,, ) Ivrt: w t S s t CH o t ots trvrs so r Ivrt: w t S s t CH o t ots trvrs so r S = (,,, ) S = (,, ) Ivrt: w t S s t CH o t ots trvrs so r 91 92 93 Gr s (t 1960s) Gr s (t 1960s) Gr s (t 1960s) Now w r ot : s t o? NO Now w r ot : s t o? NO Now w r ot : s t o? NO o ; s t o? o ; s t o? o ; s t o? YES ==> srt S S = (, ) Ivrt: w t S s t CH o t ots trvrs so r S = (, ) Ivrt: w t S s t CH o t ots trvrs so r S = (,, ) Ivrt: w t S s t CH o t ots trvrs so r 94 95 96

Gr s (t 1960s) Gr s (t 1960s) Gr s (t 1960s) I r I r.. Cs os W r xt ot : W r xt ot : t = (S), = xt() t = (S), = xt() s t o : to S s rt o : o ; rt ut s t o, t to S us o us S = (,,.) S = (,,,.) S = (,,.) S = (,,.) 97 98 99 Gr s (t 1960s) Gr s (t 1960s) Gr s: ANALYSIS F tror ot 0 Sort otr ots w rou 0, t 1, 2, 3, -1 ts orr Itz st S = (2, 1) or =3 to -1 o s t o (so(s),rst(s)): s us o S o o S w s rt o (so(s), rst(s)) us o S Coos st o trst ots o trou t ort Drt ss: os t ort rt ss? I ot, ow o you x t? How to tror ot? Ayss: How o os t t? F tror ot 0 Sort otr ots w rou 0.. Itz st S = (2, 1) or =3 to -1 o s t o (so(s),rst(s)): us o S s o o S w s rt o (so(s), rst(s)) us o S 100 101 102

Gr s: ANALYSIS Gr s: ANALYSIS Gr s: ANALYSIS F tror ot 0 O() (w t o t tr) F tror ot 0 O() (w t o t tr) F tror ot 0 O() (w t o t tr) Sort otr ots w rou 0.. Sort otr ots w rou 0.. O( ) Sort otr ots w rou 0.. O( ) Itz st S = (2, 1) Itz st S = (2, 1) Itz st S = (2, 1) or =3 to -1 o or =3 to -1 o or =3 to -1 o s t o (so(s),rst(s)): s t o (so(s),rst(s)): s t o (so(s),rst(s)): us o S us o S us o S s s s How o os ts t? o o o o S o S o S w s rt o (so(s), rst(s)) w s rt o (so(s), rst(s)) w s rt o (so(s), rst(s)) us o S us o S us o S 103 104 105 Gr s: ANALYSIS Gr s: Dts Gr s: Dts F tror ot 0 O() (w t o t tr) How to tror ot? How to tror ot? Sort otr ots w rou 0.. O( ) A sto s to 0 s t owst ot Itz st S = (2, 1) or =3 to -1 o s t o (so(s),rst(s)): us o S s How o os ts t? o o S w s rt o (so(s), rst(s)) us o S O() vry ot s us o o t ost o 106 107 108

Gr s: Dts Gr s: Dts S u Gr s How to tror ot? A sto s to 0 s t owst ot tz st S = (1, 0) //ot r o CH S w wys ot t st 2 ots H or-ts Wt s w you ru o ts ut? How you x t? 1 0 109 110 111 S u Gr s S u Gr s S u Gr s 112 113 114

S u Gr s 115