K-D Trees and Quad Trees. James Fogarty Autumn 2007 Lecture 12

Similar documents
CSCI 104 Sorting Algorithms. Mark Redekopp David Kempe

L131 STATEMENT Of VOTES, PRESIOENTIAL P8I«ARY ELECTION TyESOAY* MARCH 17# 1992 PA6 PRESIDENT OF THE UNITED STATES OF AMERICA DEHOCRATIC PART L A

Overview Transmission Dates What s New Contracts and Salaries CPI and PSC Codes Items to Remember Reports

A Variation-Tolerant Multi-Level Memory Architecture Encoded in Two-state Memristors

Manner assimilation in Uyghur

TREATMENT OF SMC COURSEWORK FOR STUDENTS WITHOUT AN ASSOCIATE OF ARTS

Grammars & Parsing, Part 1:

On the Polynomial Degree of Minterm-Cyclic Functions

Simulation in Radiology Education

Pediatric Wheelchair Seating

Development of an IT Curriculum. Dr. Jochen Koubek Humboldt-Universität zu Berlin Technische Universität Berlin 2008

T2Ts, revised. Foundations

CS Machine Learning

Final Report for grants from the Norwegian Ministry of Foreign Affairs (MFA) Responsible Unit for the Grant Scheme Humonitorion Section.

PENCAPAIAN KPI UNIVERSITI PUTRA MALAYSIA BAGI KESELURUHAN 2013 (Q4)

Noun incorporation in Sora: A case for incorporation as morphological merger TLS: 19 February Introduction.

ARC Architectural Series TURNCRAFT ARCHITECTURALLY CORRECT DETAILS WIDEST RANGE OF STYLES AND SIZES ANY WOOD SPECIES ALL ORDERS OF CLASSICAL COLUMNS

Mark Scheme (Results) Summer International GCSE Bengali (4BE0/01)

DETAILS FOR MUSICIANSHIP TIMETABLE AND MUSICIANSHIP GRADE CLASS ON-LINE ENROLMENT PROCEDURES

Fort Lauderdale Conference

How to Revitalize Your Financial Aid Compliance

QIs 3.4, 4.4. Student Support. discussions. staff team. Reports in place. participating in. self evaluation procedures. All students.

EQE Candidate Support Project (CSP) Frequently Asked Questions - National Offices

Using Foldables in the Classroom

Inhibitory control in L2 phonological processing

AP Calculus AB. Nevada Academic Standards that are assessable at the local level only.

2015 High School Results: Summary Data (Part I)

STUDENT PERCEPTION SURVEYS ACTIONABLE STUDENT FEEDBACK PROMOTING EXCELLENCE IN TEACHING AND LEARNING

Puzzle Time Worksheet Answers 2 1

Short vs. Extended Answer Questions in Computer Science Exams

ScienceDirect. A Lean Six Sigma (LSS) project management improvement model. Alexandra Tenera a,b *, Luis Carneiro Pintoª. 27 th IPMA World Congress

Monticello Community School District K 12th Grade. Spanish Standards and Benchmarks

Visual CP Representation of Knowledge

LINCOLN CHRISTIAN UNIVERSITY 2018 Spring Graduate & Seminary Class Schedule

Florida Reading for College Success

Sun Mon Tue Wed Thu Fri Sat

Youth Apprenticeship in the Carolinas

Peer Comparison of Graduate Data

CROSS-LANGUAGE INFORMATION RETRIEVAL USING PARAFAC2

Logic Programming for an Introductory Computer Science Course for High School Students

The University of Puerto Rico College of Humanities English Department Rio Piedras Campus. Syllabus Fall

Ottawa University Professional Education Program Arizona Locations and Online 2015 Schedule

Classifying combinations: Do students distinguish between different types of combination problems?

MABEL ABRAHAM. 710 Uris Hall Broadway mabelabraham.com New York, New York Updated January 2017 EMPLOYMENT

TEXAS A&M UNIVERSITY-TEXARKANA COLLEGE OF EDUCATION AND LIBERAL ARTS COURSE SYLLABUS SPRING 2012

Clackamas CC BI 231, 232, 233 BI 231,232, BI 234 BI 234 BI 234 BI 234 BI 234 BI 234 BIOL 234, 235, 323 or 244

Replace difficult words for Is the language appropriate for the. younger audience. For audience?

Smarter Lunchrooms: A Policy, Systems & Environmental Approach to School Meals May 2017 Katie Bark, Project Director Montana Team Nutrition, MSU

Hans-Ulrich Block, Hans Haugeneder Siemens AG, MOnchen ZT ZTI INF W. Germany. (2) [S' [NP who][s does he try to find [NP e]]s IS' $=~

COMPUTATIONAL COMPLEXITY OF LEFT-ASSOCIATIVE GRAMMAR

A systems engineering laboratory in the context of the Bologna Process

North Carolina Information and Technology Essential Standards

Reflective problem solving skills are essential for learning, but it is not my job to teach them

PRESENTED BY EDLY: FOR THE LOVE OF ABILITY

FY year and 3-year Cohort Default Rates by State and Level and Control of Institution

Transportation Improvement Program

2/15/13. POS Tagging Problem. Part-of-Speech Tagging. Example English Part-of-Speech Tagsets. More Details of the Problem. Typical Problem Cases

Social Studies / Sciences. 9 Freshmen English Algebra 1 Integrated Science World Studies PE 1 Intro to Culinary Arts: Cooking 101

THE RO L E O F IMAGES IN

SIMMONS. making education WORK. You ve never been shy about taking bold steps to prepare for the future and neither has Simmons.

Important Questions For Physics For Maharashtra Board

Together we give our children the roots to grown and the wings to fly. Sun Mon Tue Wed Thu Fri Sat VB Begins IN-SERVICE

Fragment Analysis and Test Case Generation using F- Measure for Adaptive Random Testing and Partitioned Block based Adaptive Random Testing

Using a Simulated Practice to Improve Practice Management Learning

Building an HPSG-based Indonesian Resource Grammar (INDRA)

Employment Advertisement No. 07/2011

Banal Creativity and Unique Creation What is Learning in a Learning Intensive Society? Riel Miller. Future of Learning Glasgow, June 25, 2005

Syntactic types of Russian expressive suffixes

Learning Styles in Higher Education: Learning How to Learn

Renton Academy: A Re-EDucation Public School for Students with Emotional and Behavioral Disabilities

06-07 th September 2012, Constanta Romania th Sept 2012

CLIL across Contexts: A scaffolding framework for CLIL teacher education

Precision Decisions for the Timings Chart

Summary: Impact Statement

Brian Isetts University of Minnesota - Twin Cities, Anthony W. Olson PharmD University of Minnesota, Twin Cities,

CS 1103 Computer Science I Honors. Fall Instructor Muller. Syllabus

Information Session 13 & 19 August 2015

Redirected Inbound Call Sampling An Example of Fit for Purpose Non-probability Sample Design

Lego Science Lesson Plans

Syntax Parsing 1. Grammars and parsing 2. Top-down and bottom-up parsing 3. Chart parsers 4. Bottom-up chart parsing 5. The Earley Algorithm

Outline for Session III

A study of speaker adaptation for DNN-based speech synthesis

BANGLA TO ENGLISH TEXT CONVERSION USING OPENNLP TOOLS

The European Higher Education Area in 2012:

Statistical Peers for Benchmarking 2010 Supplement Grade 11 Including Charter Schools NMSBA Performance 2010

Chinese Language Parsing with Maximum-Entropy-Inspired Parser

Using the myiit Portal...my.iit.edu

CRIJ 2328 Police Systems and Practices. Class Meeting Time:

Los Angeles Unified School District

General Chemistry II, CHEM Blinn College Bryan Campus Course Syllabus Fall 2011

Application and Admission Process

Probabilistic Mission Defense and Assurance

IUPUI University Library Jaena Hollingsworth Kristi L. Palmer

The Search for Strategies to Prevent Persistent Misconceptions

Computer Organization I (Tietokoneen toiminta)

A NOTE ON UNDETECTED TYPING ERRORS

(Sub)Gradient Descent

Journey Essay Marker s Feedback

Speech/Language Pathology Plan of Treatment

Transcription:

K-D Trs n Qu Trs Jms Fort Autumn 2007 Ltur 12

Rn Qurs Tnk o rn qur. Gv m ll ustomrs 45-55. Gv m ll ounts wort $5m to $15m Cn on n tm. Wt w wnt ot: Gv m ll ustomrs 45-55 wt ounts wort twn $5m n $15m. 2

Gomtr Dt Struturs Ornzton o ponts, lns, plns, t n support o str prossn Appltons Mp normton Grps - omputn ojt ntrstons Dt omprsson - nrst nor sr Dson Trs - mn lrnn 3

k- Trs Jon Bntl, 1975, wl n unrrut Tr us to stor sptl t. Nrst nor sr. Rn qurs. Fst look-up k- tr r urnt lo 2 n pt wr n s t numr o ponts n t st. Trtonll, k- trs stor ponts n -mnsonl sp w r quvlnt to vtors n -mnsonl sp. 4

Rn Qurs Rtnulr qur Crulr qur 5

Nrst Nor Sr qur Nrst nor s. 6

k- Tr Construton I tr s just on pont, orm l wt tt pont. Otrws, v t ponts n l ln prpnulr to on o t s. Rursvl onstrut k- trs or t two sts o ponts. Dvson strts v ponts prpnulr to t s wt wst spr. v n roun-ron son (ook os t ts w) 7

k- Tr Construton (1) v prpnulr to t wst spr. 8

k- Tr Construton (2) 9

k- Tr Construton (3) 10

k- Tr Construton (4) 11

k- Tr Construton (5) 12

k- Tr Construton (6) 13

k- Tr Construton (7) 14

k- Tr Construton (8) 15

k- Tr Construton (9) 16

k- Tr Construton (10) 17

k- Tr Construton (11) 18

k- Tr Construton (12) 19

k- Tr Construton (13) 20

k- Tr Construton (14) 21

k- Tr Construton (15) 22

k- Tr Construton (16) 23

k- Tr Construton (17) 24

k- Tr Construton (18) k- tr ll 25

2- Tr Domposton 2 1 3 26

k- Tr Splttn sort ponts n mnson 1 2 3 4 5 6 7 8 9 m spr s t m o - n -. In t slt mnson t ml pont n t lst splts t t. To ul t sort lsts or t otr mnsons sn t sort lst n pont to on o two sort lsts. 27

k- Tr Splttn sort ponts n mnson 1 2 3 4 5 6 7 8 9 ntor or st 0 0 1 0 0 1 0 1 1 sn sort ponts n mnson n to orrt st 28

k- Tr Construton Complt Frst sort t ponts n mnson. O(n lo n) tm n n stor. Ts r stor n A[1..,1..n] Fnn t wst spr n qull v nto two susts n on n O(n) tm. W v t rurrn T(n,) < 2T(n/2,) + O(n) Construtn t k- tr n on n O(n lo n) n n stor 29

No Strutur or k- Trs A no s 5 ls s (splttn s) vlu (splttn vlu) lt (lt sutr) rt (rt sutr) pont (ols pont lt n rt lrn r null) 30

Rtnulr Rn Qur Rursvl sr vr ll tt ntrsts t rtnl. 31

Rtnulr Rn Qur (1) 32

Rtnulr Rn Qur (2) 33

Rtnulr Rn Qur (3) 34

Rtnulr Rn Qur (4) 35

Rtnulr Rn Qur (5) 36

Rtnulr Rn Qur (6) 37

Rtnulr Rn Qur (7) 38

Rtnulr Rn Qur (8) 39

Rtnulr Rn Qur prnt_rn(low,, low, :ntr, root: no pontr) { Cs { root = null: rturn; root.lt = null: low < root.pont. n root.pont. < n low < root.pont. n root.pont. < tn prnt(root); ls (root.s = n low < root.vlu ) or (root.s = n low < root.vlu ) tn prnt_rn(low,, low,, root.lt); (root.s = n low > root.vlu ) or (root.s = n low > root.vlu ) tn prnt_rn(low,, low,, root.rt); }} 40

k- Tr Nrst Nor Sr Sr rursvl to n t pont n t sm ll s t qur. On t rturn sr sutr wr losr pont tn t on ou lr know out mt oun. 41

k- Tr NNS (1) qur pont 42

k- Tr NNS (2) qur pont 43

k- Tr NNS (3) qur pont 44

k- Tr NNS (4) qur pont w 45

k- Tr NNS (5) qur pont w 46

k- Tr NNS (6) qur pont w 47

k- Tr NNS (7) qur pont w 48

k- Tr NNS (10) qur pont w 49

k- Tr NNS (11) qur pont w 50

k- Tr NNS (12) qur pont w 51

k- Tr NNS (13) qur pont w 52

k- Tr NNS (14) qur pont w 53

k- Tr NNS (15) qur pont w 54

Nots on k- NNS Hs n sown to run n O(lo n) vr tm pr sr n rsonl mol. Stor or t k- tr s O(n). Prprossn tm s O(n lo n) ssumn s onstnt. 55

Worst-Cs or Nrst Nor Sr qur pont Hl o t ponts vst or qur Worst s O(n) But: on vr (n n prt) nrst nor qurs r O(lo N) 56

Sp Prttonn Qu Trs 57

Sp Prttonn Qu Trs 58

Sp Prttonn Qu Trs 59

A B Cs 60

Nots on Qu Trs Numr o nos s O(n(1+ lo(δ/n))) wr n s t numr o ponts n Δ s t rto o t wt (or t) o t k sp n t smllst stn twn two ponts Ht o t tr s O(lo n + lo Δ) 61

k-d Trs K-D vs Qu Dnst ln trs Ht o t tr s O(lo n) wt t nsrton Goo o or mnson Supports nsrt, n, nrst nor, rn qurs Qu Trs Sp prttonn tr M not ln Not oo o or mnson Supports nsrt, lt, n, nrst nor, rn qurs 62

Gomtr Dt Struturs Gomtr t struturs r ommon. T k- tr s on o t smplst. Nrst nor sr Rn qurs Otr t struturs us or 3- rps mols Psl smultons 63