Applications of Voronoi Diagrams to GIS Rodrigo I. Silveira Universitat Politècnica de Catalunya Geometria Computacional FIB - UPC.

Slides:



Advertisements
Similar presentations
Order-k Voronoi Diagram in the Plane
Advertisements

Multi-Guarded Safe Zone: An Effective Technique to Monitor Moving Circular Range Queries Presented By: Muhammad Aamir Cheema 1 Joint work with Ljiljana.
Alpha Shapes. Used for Shape Modelling Creates shapes out of point sets Gives a hierarchy of shapes. Has been used for detecting pockets in proteins.
1. Find the cost of each of the following using the Nearest Neighbor Algorithm. a)Start at Vertex M.
1/22 Worst and Best-Case Coverage in Sensor Networks Seapahn Meguerdichian, Farinaz Koushanfar, Miodrag Potkonjak, and Mani Srivastava IEEE TRANSACTIONS.
Nearest Neighbor Search
Sorting Really Big Files Sorting Part 3. Using K Temporary Files Given  N records in file F  M records will fit into internal memory  Use K temp files,
Efficient Evaluation of k-Range Nearest Neighbor Queries in Road Networks Jie BaoChi-Yin ChowMohamed F. Mokbel Department of Computer Science and Engineering.
 Distance Problems: › Post Office Problem › Nearest Neighbors and Closest Pair › Largest Empty and Smallest Enclosing Circle  Sub graphs of Delaunay.
Bidding Protocols for Deploying Mobile Sensors Reporter: Po-Chung Shih Computer Science and Information Engineering Department Fu-Jen Catholic University.
Searching on Multi-Dimensional Data
1 Voronoi Diagrams. 2 Voronoi Diagram Input: A set of points locations (sites) in the plane.Input: A set of points locations (sites) in the plane. Output:
The Voronoi diagram of convex objects in the plane Menelaos Karavelas & Mariette Yvinec Dagsthul Workshop, march 2003.
Coverage Algorithms Mani Srivastava & Miodrag Potkonjak, UCLA [Project: Sensorware (RSC)] & Mark Jones, Virginia Tech [Project: Dynamic Sensor Nets (ISI-East)]
1st Meeting Industrial Geometry Computational Geometry ---- Some Basic Structures 1st IG-Meeting.
University of Wisconsin-Milwaukee Geographic Information Science Geography 625 Intermediate Geographic Information Science Instructor: Changshan Wu Department.
Voronoi Diagram Presenter: GI1 11號 蔡逸凡
Computational Geometry -- Voronoi Diagram
17. Computational Geometry Chapter 7 Voronoi Diagrams.
Computational Geometry and Spatial Data Mining
Department of Computer Science, University of Maryland, College Park, USA TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.:
Worst and Best-Case Coverage in Sensor Networks Seapahn Meguerdichian, Farinaz Koushanfar, Miodrag Potkonjak, Mani Srivastava IEEE TRANSACTIONS ON MOBILE.
Week 17GEOG2750 – Earth Observation and GIS of the Physical Environment1 Lecture 14 Interpolating environmental datasets Outline – creating surfaces from.
1 Nearest Neighbor Learning Greg Grudic (Notes borrowed from Thomas G. Dietterich and Tom Mitchell) Intro AI.
An Intelligent & Incremental Approach to kNN using R-trees DJ Oneil & Esten Rye (G01)
1 Precise Voronoi Cell Extraction of Free-form Rational Planar Closed Curves Iddo Hanniel, Ramanathan Muthuganapathy, Gershon Elber Department of Computer.
1 Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network Prof. Yu-Chee Tseng Department of Computer Science National Chiao-Tung University.
Lecture 4. Interpolating environmental datasets
1 University of Denver Department of Mathematics Department of Computer Science.
Clustering An overview of clustering algorithms Dènis de Keijzer GIA 2004.
UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2007 O’Rourke Chapter 8 Motion Planning.
Geometric Probing with Light Beacons on Multiple Mobile Robots Sarah Bergbreiter CS287 Project Presentation May 1, 2002.
UNC Chapel Hill M. C. Lin Point Location Chapter 6 of the Textbook –Review –Algorithm Analysis –Dealing with Degeneracies.
Lab 3 How’d it go?.
VLDB '2006 Haibo Hu (Hong Kong Baptist University, Hong Kong) Dik Lun Lee (Hong Kong University of Science and Technology, Hong Kong) Victor.
Shape Analysis and Retrieval Structural Shape Descriptors Notes courtesy of Funk et al., SIGGRAPH 2004.
KAIS T A Bidding Protocol for Deploying Mobile Sensors 발표자 : 권 영 진 Guiling Wang, Guohong Cao, Tom LaPorta The Pennsylvania State University IEEE, ICNP.
Ad Hoc and Sensor Networks – Roger Wattenhofer –3/1Ad Hoc and Sensor Networks – Roger Wattenhofer – Topology Control Chapter 3 TexPoint fonts used in EMF.
Order-k Voronoi diagram in the plane Dominique Schmitt Université de Haute-Alsace.
2/19/15CMPS 3130/6130 Computational Geometry1 CMPS 3130/6130 Computational Geometry Spring 2015 Voronoi Diagrams Carola Wenk Based on: Computational Geometry:
Data Mining Practical Machine Learning Tools and Techniques Chapter 4: Algorithms: The Basic Methods Section 4.7: Instance-Based Learning Rodney Nielsen.
Nearest Neighbor Queries Chris Buzzerd, Dave Boerner, and Kevin Stewart.
Voronoi Diagram (Supplemental)
On Computing Top-t Influential Spatial Sites Authors: T. Xia, D. Zhang, E. Kanoulas, Y.Du Northeastern University, USA Appeared in: VLDB 2005 Presenter:
9/2/2005VLDB 2005, Trondheim, Norway1 On Computing Top-t Most Influential Spatial Sites Tian Xia, Donghui Zhang, Evangelos Kanoulas, Yang Du Northeastern.
Generating Realistic Terrains with Higher-Order Delaunay Triangulations Thierry de Kok Marc van Kreveld Maarten Löffler Center for Geometry, Imaging and.
Efficient Computing k-Coverage Paths in Multihop Wireless Sensor Networks XuFei Mao, ShaoJie Tang, and Xiang-Yang Li Dept. of Computer Science, Illinois.
Covering Points of Interest with Mobile Sensors Milan Erdelj, Tahiry Razafindralambo and David Simplot-Ryl INRIA Lille - Nord Europe IEEE Transactions on.
UNC Chapel Hill M. C. Lin Computing Voronoi Diagram For each site p i, compute the common inter- section of the half-planes h(p i, p j ) for i  j, using.
Technical Details of Network Assessment Methodology: Concentration Estimation Uncertainty Area of Station Sampling Zone Population in Station Sampling.
Motion Planning Howie CHoset. Assign HW Algorithms –Start-Goal Methods –Map-Based Approaches –Cellular Decompositions.
Coverage Problems in Wireless Ad-hoc Sensor Networks Seapahn Meguerdichian 1 Farinaz Koushanfar 2 Miodrag Potkonjak 1 Mani Srivastava 2 University of California,
Maximal Independent Set and Connected Dominating Set Xiaofeng Gao Research Group on Mobile Computing and Wireless Networking Univ. of Texas at Dallas.
Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network You-Chiun Wang, Chun-Chi Hu, and Yu-Chee Tseng IEEE Transactions on Mobile Computing.
Zaiben Chen et al. Presented by Lian Liu. You’re traveling from s to t. Which gas station would you choose?
Autonomous Robots Robot Path Planning (2) © Manfred Huber 2008.
Coverage In Wireless Ad-Hoc Sensor Networks Shimon Tal Sion Cohen Instructor: Dr. Michael Segal.
Coverage and Deployment 1. Coverage Problems Coverage: is a measure of the Quality of Service (QoS) of a sensor network How well can the network observe.
CMPS 3130/6130 Computational Geometry Spring 2017
Applications of Voronoi Diagrams to GIS
Tutorial 3 – Computational Geometry
VORONOI DIAGRAMS FOR PARALLEL HALFLINES IN 3D
Haim Kaplan and Uri Zwick
Voronoi diagrams in planar graphs & computing the diameter in
K Nearest Neighbor Classification
Chapter 7 Voronoi Diagrams
Computing Shortest Path amid Pseudodisks
Minimizing the Aggregate Movements for Interval Coverage
The Visibility– Voronoi Complex and Its Applications
Clustering.
Presentation transcript:

Applications of Voronoi Diagrams to GIS Rodrigo I. Silveira Universitat Politècnica de Catalunya Geometria Computacional FIB - UPC

Applications of Voronoi diagrams What can you do with a VD? All sort of things! Many related to GIS 2 Source:

Applications of Voronoi diagrams What can you do with a VD? Already mentioned a few applications Find nearest… hospital, restaurant, gas station,... 3

Applications of Voronoi diagrams More applications mentioned Spatial Interpolation –Natural neighbor method 4

Applications of Voronoi diagrams Facility location Determine a location to maximize distance to its “competition” Find largest empty circle Must be centered at a vertex of the VD 5 Application Example 1

Applications of Voronoi diagrams Coverage in sensor networks Sensor network –Sensors distributed in an area to monitor some condition 6 Source: Application Example 2

Applications of Voronoi diagrams Coverage in sensor networks Given: locations of sensors Problem: Do they cover the whole area? 7 Assume sensors have a fixed coverage range Solution: Look for largest empty disk, check its radius

Applications of Voronoi diagrams Building metro stations Where to place stations for metro line? –People commuting to CBD terminal People can also –Walk 4.4 km/h + 35% correction –Take bus Some avg speed 8 Source: Novaes et al (2009). DOI: /j.cor Application Example 3

Applications of Voronoi diagrams Building metro stations Weighted Voronoi Diagram –Distance function is not Euclidean anymore –dist w (p,site)=(1/w) dist(p,s) 9

Applications of Voronoi diagrams Forestal applications VOREST: Simulating how trees grow 10 More info: Application Example 4

Applications of Voronoi diagrams Simulating how trees grow The growth of a tree depends on how much “free space” it has around it 11

Applications of Voronoi diagrams Voronoi cell: space to grow Metric defined by expert user –Non-Euclidean Area of the Voronoi cell is the main input to determine the growth of the tree Voronoi diagram estimated based on image of lower envelopes of metric cones –Avoids exact computation 12

Applications of Voronoi diagrams Lower envelopes of cones Alternative definition of VD: –2D projection of lower envelope of distance cones centered at sites 13

Applications of Voronoi diagrams Robot motion planning Move robot amidst obstacles Can you move a disk (robot) from one location to another avoiding all obstacles? 14 Application Example 5 Most figures in this section are due to Marc van Kreveld

Applications of Voronoi diagrams Robot motion planning Observation: we can move the disk if and only if we can do so on the edges of the Voronoi diagram –VD edges are (locally) as far as possible from sites 15

Applications of Voronoi diagrams Robot motion planning General strategy –Compute VD of obstacles –Remove edges that get too close to sites i.e. on which robot would not fit –Locate starting and end points –Move robot center along VD edges This technique is called retraction 16

Applications of Voronoi diagrams Robot motion planning Point obstacles are not that interesting –But most situations (i.e. floorplans) can be represented with line segments Retraction just works in the same way –Using Voronoi diagram of line segments 17

Applications of Voronoi diagrams VD of line segments Distance between point p and segment s –Distance between p and closest point on s 18

Applications of Voronoi diagrams VD of line segments Example 19

Applications of Voronoi diagrams VD of line segments Example 20

Applications of Voronoi diagrams VD of line segments Some properties –Bisectors of the VD are made of line segments, and parabolic arcs –2 line segments can have a bisector with up to 7 pieces 21

Applications of Voronoi diagrams VD of line segments Basic properties are the same 22

Applications of Voronoi diagrams VD of line segments Can also be computed in O(n log n) time Retraction works in the same way 23

Applications of Voronoi diagrams Questions? 24 Victorian College of the Arts (Melbourne, Australia)