Facility location Given a set P of n sites in the plane, find the - PowerPoint PPT Presentation

Facility location Given a set P of n sites in the plane, find the point c that minimises the distance r to the furthest point(s) of P

Facility location Given a set P of n sites in the plane, find the point c that minimises the distance r to the furthest point(s) of P r c r r

Smallest enclosing circles Given a set P of n points in the plane, find the smallest circle C ( P ) that contains all points of P

Smallest enclosing circles Given a set P of n points in the plane, find the smallest circle C ( P ) that contains all points of P C ( P ) is either a circle defined by a set S ⊆ P of three points on the boundary, or a circle defined by a set S ⊆ P of two diametrically opposite points

Smallest enclosing circles Given a set P of n points in the plane, find the smallest circle C ( P ) that contains all points of P C ( P ) is either a circle defined by a set S ⊆ P of three points on the boundary, or a circle defined by a set S ⊆ P of two diametrically opposite points Why not more than three points? Why not less than two points? Why not two points that are not diametrically opposite?

Smallest enclosing circles Given a set P of n points in the plane, find the smallest circle C ( P ) that contains all points of P C ( P ) is either a circle defined by a set S ⊆ P of three points on the boundary, or a circle defined by a set S ⊆ P of two diametrically opposite points Why not more than three points? Three points define a unique circle Why not less than two points? Why not two points that are not diametrically opposite?

Smallest enclosing circles Given a set P of n points in the plane, find the smallest circle C ( P ) that contains all points of P C ( P ) is either a circle defined by a set S ⊆ P of three points on the boundary, or a circle defined by a set S ⊆ P of two diametrically opposite points Why not more than three points? Three points define a unique circle Why not less than two points? Could make circle smaller until there are two Why not two points that are not diametrically opposite?

Smallest enclosing circles Given a set P of n points in the plane, find the smallest circle C ( P ) that contains all points of P C ( P ) is either a circle defined by a set S ⊆ P of three points on the boundary, or a circle defined by a set S ⊆ P of two diametrically opposite points Why not more than three points? Three points define a unique circle Why not less than two points? Could make circle smaller until there are two Why not two points that are not diametrically opposite? Smaller again

Smallest enclosing circles Given a set P of n points in the plane, find the smallest circle C ( P ) that contains all points of P C ( P ) is either a circle defined by a set S ⊆ P of three points on the boundary, or a circle defined by a set S ⊆ P of two diametrically opposite points Trivial algorithm: for all Θ( n 3 ) pairs and triples of points that define a circle, test if all other Θ( n ) points lie inside; choose the smallest circle that passes the test → Θ( n 4 ) time

Smallest enclosing circles: an incremental algorithm Algorithm SEC ( P, n ) Input: an array P with points in the plane; a number n ≥ 2 Output: the smallest circle that contains all points of P [1 ..n ] C ← circle defined by P [1] and P [2] for i ← 3 to n do if P [ i ] lies in C then be happy and continue else C ← the smallest enclosing circle of P [1 ..i ] return C 3 7 6 2 4 5 1 8

Smallest enclosing circles: an incremental algorithm Algorithm SEC ( P, n ) Input: an array P with points in the plane; a number n ≥ 2 Output: the smallest circle that contains all points of P [1 ..n ] C ← circle defined by P [1] and P [2] for i ← 3 to n do if P [ i ] lies in C then be happy and continue else C ← the smallest enclosing circle of P [1 ..i ] with P [ i ] on boundary return C 3 7 6 2 4 5 1 8

Smallest enclosing circles: an incremental algorithm Algorithm SEC ( P, n ) Input: an array P with points in the plane; a number n ≥ 2 Output: the smallest circle that contains all points of P [1 ..n ] C ← circle defined by P [1] and P [2] for i ← 3 to n do if P [ i ] lies in C then be happy and continue else C ← the smallest enclosing circle of P [1 ..i ] with P [ i ] on boundary return C Why does this work? (sketch) 3 7 SEC ( P, i ) is defined by some set S ⊆ P [1 ..i ] 6 on the boundary of SEC ( P, i ) ; | S | ≤ 3 . 2 4 P [ i ] / ∈ S → SEC ( P, i ) = SEC ( P, i − 1) 5 1 8

Facility location Given a set P of n sites in the plane, find the - PowerPoint PPT Presentation

Facility location Given a set P of n sites in the plane, find the point c that minimises the distance r to the furthest point(s) of P Facility location Given a set P of n sites in the plane, find the point c that minimises the distance r to the

Facility location I. Chapter 10 Facility location Continuous facility location models Single

min y i f i + x ij d ij min y i f i + x ij d ij i F i F , j D min y

Facility location II. Chapter 10 Location-Allocation Model Plant Location Model Network

C. KBL Sewage Disposal Facility O KBL Sewage Disposal Facility Location: Easting 609822.42

CSC304 Lecture 13 Finishing Facility Location: Randomized Left-Right-Middle Mechanism Begin

CSC2556 Lecture 5 Facility Location Stable Matching CSC2556 - Nisarg Shah 1 Facility

Approximation Algorithms for Single and Multi-Commodity Connected Facility Location Fabrizio

Where to put a facility? Given locations p 1 , . . . , p m in R n of m houses, want to choose a

Efficiency for continuous facility location problems with attraction and repulsion Abderrahim

Facility Location Games Yury Kochetov Sobolev Institute of Mathematics. Novosibirsk. Russia

Location, Location, Location, Location, Location: Location: GPS and Google Earth GPS and

11/21/2013 Location of Facility Primary Beamline MI Abort Line Reconfiguration

1 Background Owner University of Hawaii Type of Facility Location to centralize

Multiple Single-Facility Location 9 Distribution 3 6 Manufacturing 1 10 Customers

Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams and

Approximation Algorithms for the Unsplittable Capacitated Facility Location Problem Babak Behsaz

Perfect 1-Factorisations of Circulant Graphs of Degree 4 Sarada Herke PhD Supervisor: Dr.

An Abstract Approach to Entanglement Ross Duncan 1 Why Abstract? How are things entangled?

On Order Holds LOPL Pilot Statistics Results Overall Summary Tracked all on order holds placed

Imaging Based Analysis of Patients with Atrial Fibrillation Rob MacLeod, University of Utah

Electrical Domain outside power cb1 w5 s1 w1 circuit breaker cb2 s2 w2 w3 off s3 w0

Co Company intro Ma May 2016 Your elect ur electric bill vs y ic bill vs your phone bill ur

Some inspiration Music with the MakeyMakey https://www.youtube.com/watch?v=wkPt9MYqDW0 J.Views

Compiling Probabilistic Logic Programs into Sentential Decision Diagrams Jonas Vlasselaer, Joris