Spatial data structures in 2D
|
|
- Coleen Ramsey
- 5 years ago
- Views:
Transcription
1 Spatial data structures in 2D Josef Pelikán CGG MFF UK Praha Spatial2D 2016 Josef Pelikán, 1 / 34
2 Application areas geographic information systems (GIS) area, line and point entities huge databases (10 4 to 10 9 objects) image analysis, recognition computer graphics, games 2D & 3D algorithm speedup (ray casting, collisions) industry, CAD VLSI design, component positioning, collisions Spatial2D 2016 Josef Pelikán, 2 / 34
3 Elementary tasks I point localization in 2D net looking for an area object which contains the point nearest N points from the given center global variation: looking for the closest point pair curve intersections (polylines) collisions in a set of curves (polylines) point objects closest to the given curve (route) Spatial2D 2016 Josef Pelikán, 3 / 34
4 Elementary tasks II interval queries in 2D space (databases) set operations on map entities areas, line objects, points collision tests (interferences), minimal distances among planar objects (VLSI) object processing in some geometric order increasing distance from a given center Spatial2D 2016 Josef Pelikán, 4 / 34
5 Region quadtree representation of areal regions in 2D splitting exactly in the middle E D C B information is stored in leaf nodes only A Spatial2D 2016 Josef Pelikán, 5 / 34
6 Region quadtree A B C D E Spatial2D 2016 Josef Pelikán, 6 / 34
7 Pyramid representation of areal regions in 2D additional summary info in inner nodes pyramid nodes up to level: E Spatial2D 2016 Josef Pelikán, 7 / 34
8 Pyramid pyramid nodes up to level: D Spatial2D 2016 Josef Pelikán, 8 / 34
9 Pyramid pyramid nodes up to level: C Spatial2D 2016 Josef Pelikán, 9 / 34
10 Pyramid pyramid nodes up to level: B Spatial2D 2016 Josef Pelikán, 10 / 34
11 PR quadtree (Point-Region) representation of point objects Kralupy Kostelec Brandýs Roztoky splitting exactly in the middle Kladno Praha Úvaly object information stored in leaf nodes (all levels, max. one object per node) Řevnice Černošice Mníšek Jílové Říčany Spatial2D 2016 Josef Pelikán, 11 / 34
12 PR quadtree (Orenstein) Kralupy Kladno Roztoky Praha Kostelec Brandýs Úvaly Černošice Řevnice Mníšek Říčany Jílové Spatial2D 2016 Josef Pelikán, 12 / 34
13 Bucket methods node can store information about more than one object 0 object# Max Max is constant value tuned for storage efficiency (record size..) memory & time efficiency less overhead in pointer management AB-tree analogy Spatial2D 2016 Josef Pelikán, 13 / 34
14 Bucket PR quadtree representation of point objects Kralupy Kostelec Brandýs Roztoky splitting exactly in the middle Kladno Praha Úvaly object information stored in leaf nodes (all levels, Max object per node) Řevnice Černošice Mníšek Jílové Říčany Max = 2 Spatial2D 2016 Josef Pelikán, 14 / 34
15 Bucket PR quadtree Kralupy Kladno Roztoky Praha Kostelec Brandýs Úvaly Černošice Řevnice Mníšek Říčany Jílové Max = 2 Spatial2D 2016 Josef Pelikán, 15 / 34
16 K-D tree (Bentley) representation of point objects Kralupy Kostelec Brandýs adaptive splitting - one coordinate at a time (binary tree). regular alternation of the coordinates Kladno Černošice Roztoky Praha Říčany Úvaly object information stored in all nodes Řevnice Mníšek Jílové Spatial2D 2016 Josef Pelikán, 16 / 34
17 K-D tree Praha Roztoky y Jílové Kladno x Brandýs Řevnice x Říčany y y y y x Kralupy x Kostelec x Černošice x Mníšek x Úvaly Spatial2D 2016 Josef Pelikán, 17 / 34
18 Adaptive K-D tree (Friedman) representation of point objects adaptive splitting - one coordinate at a time (binary tree). Exact object coordinates not used object information stored in leafs only Kralupy Kostelec x 3 x x 1 2 Brandýs Kladno y y 2 Roztoky 3 Praha Úvaly y 4 Černošice Řevnice x 5 Mníšek y 1 x 4 Říčany Jílové x 6 y 5 Spatial2D 2016 Josef Pelikán, 18 / 34
19 Adaptive K-D tree y 1 x 1 x 4 x 2 y 3 y 4 x 6 y 2 x 3 x 5 y 5 Kladno Kralupy Roztoky Kostelec Brandýs Praha Černošice Řevnice Mníšek Jílové Říčany Úvaly Spatial2D 2016 Josef Pelikán, 19 / 34
20 Range trees efficient implementation of range queries x min, x max y min, y max ve 2D complexity: O(log 2 N + F) in 1D, O(log 22 N + F) in 2D 1D range tree balanced binary search tree, leaves are connected by a double-linked list 2D range tree balanced binary search tree for the x coordinate every inner node contains 1D range tree (y coord.) for all points in the relevant region Spatial2D 2016 Josef Pelikán, 20 / 34
21 2D range tree balanced binary tree for x-coordinate object information in leaves only inner nodes: 1D range trees for y-coordinate 5 Kralupy 1 Kladno 6 Roztoky 4 Černošice 2 Řevnice 3 Mníšek 9 Kostelec B Brandýs C Úvaly 7 Praha A Říčany 8 Jílové Spatial2D 2016 Josef Pelikán, 21 / 34
22 2D range tree Query: (3.5,A.5) 6, A 95B617CA B 9B7CA C BCA 1 Kladno 2 Řevnice 23 3 Mníšek 4 Černošice 5 Kralupy 56 6 Roztoky 7 Praha 8 Jílové 98 9 Kostelec A Říčany B Brandýs BC C Úvaly Spatial2D 2016 Josef Pelikán, 22 / 34
23 R-tree (Guttman) objects can be areal bounding boxes in inner nodes (the whole subtree must fit into the bounding box) Kladno Kralupy R 7 R R 8 3 Černošice Kostelec Roztoky Praha Říčany Brandýs R 6 R 5 Úvaly object references in leaf nodes Řevnice Mníšek R 4 R 2 Jílové R 9 R 1 R 0 Spatial2D 2016 Josef Pelikán, 23 / 34
24 R-tree R 0 R 1 R 2 R 3 R 4 R 5 R 6 R 7 R 8 R 9 R 10 Kladno Kralupy Roztoky Praha Černošice Řevnice Mníšek Jílové Kostelec Brandýs Říčany Úvaly Spatial2D 2016 Josef Pelikán, 24 / 34
25 Strip tree (Ballard) planar curve (polyline) adaptive splitting induced by the curvature P 1 W L oriented bounding rectangle defined by: starting point (P 1 ), endpoint (P 2 ), widths (W L, W R ) W R P 2 Spatial2D 2016 Josef Pelikán, 25 / 34
26 Intersection of two curves strip trees were built for both curves trivial cases subdivision is necessary Spatial2D 2016 Josef Pelikán, 26 / 34
27 Bounding system hierarchies Sphere tree (Palmer, Grimsdale, 1995) simple tests & transform, approximation not so good AABB tree (Held, Klosowski, Mitchell, 1995) simple test, more complicated transform OBB tree (Gottschalk, Lin, Manocha, 1996) simple transform, more complicated test, good approximation K-dop tree (Klosowski, Held, Mitchell, 1998) complicated transform & test, excellent aproximation Spatial2D 2016 Josef Pelikán, 27 / 34
28 Directional pass data pass using specific directional order visibility (front-to-back or vice versa) in orthographic projection plane sweep pass ( sweeping ) pass from the center point visibility (form-factors,..) in perspective projection knn search ( k-nearest Neighbors ) Spatial2D 2016 Josef Pelikán, 28 / 34
29 Presumption hierarchical space decomposition inclusion conditions on objects only, not needed for bounding boxes (e.g. strip tree ) effective computation of minimal distance of each cell / box... d(b) distance from sweep plane or center point of the pass distance need not be an infimum (but has to be an lower bound) Spatial2D 2016 Josef Pelikán, 29 / 34
30 Algorithm auxiliary data structure H (heap) efficient operations: Min, DeleteMin, Insert put the root node into H d(b) is used for heap sorting if Min(H) is an object, process it and remove it if Min(H) is a hierarchy cell, remove it and put all its children back into the heap repeat steps and until the heap H is empty or until all required output objects are processed (knn) Spatial2D 2016 Josef Pelikán, 30 / 34
31 Example I {R 0 } {R 1,R 2 } {R 1,R 2 } {R 3,R 4,R 2 } {R 3,R 4,R 2 } {R 7,R 4,R 8,R 2 } {R 7,R 4,R 8,R 2 } {Kladno,R 4, Kralupy,R 8,R 2 } Kladno {R 4,Kralupy,R 8,R 2 } {R 9,Kralupy,R 8, Jílové,R 2 } Kladno Kralupy Kostelec R 7 R R 8 3 Černošice Řevnice Mníšek Roztoky Praha Říčany R 4 R 2 Jílové R 5 Brandýs R 6 Úvaly R 9 R 1 R 0 Spatial2D 2016 Josef Pelikán, 31 / 34
32 Example II {R 9,Kralupy,R 8,Jílové,R 2 } {Řevnice,Mníšek, Kralupy,Černošice, R 8,Jílové,R 2 } - Řevnice,Mníšek, Kralupy,Černošice {R 8,Jílové,R 2 } {Roztoky,Praha, Jílové,R 2 } - Roztoky,Praha, Jílové Kralupy R 8 Černošice Řevnice R 9 Mníšek Kostelec Roztoky Praha Říčany Jílové Brandýs R 2 R 6 R 5 Úvaly Spatial2D 2016 Josef Pelikán, 32 / 34
33 Example III {R 2 } {R 5,R 6 } Kostelec R 5 {R 5,R 6 } {Kostelec,R 6,Brandýs} Brandýs Kostelec {R 6,Brandýs} {Brandýs,Říčany,Úvaly} - Brandýs,Říčany,Úvaly Říčany R 6 Úvaly R 2 Spatial2D 2016 Josef Pelikán, 33 / 34
34 The End More information: H. Samet: The Design and Analysis of Spatial Data Structures, Addison-Wesley, 1990 H. Samet: Foundations of Multidimensional and Metric Data Structures, Morgan Kaufmann, 2006 F. Preparata, M. Shamos: Computational Geometry, An Introduction, Springer-Verlag, 1985 Spatial2D 2016 Josef Pelikán, 34 / 34
CS535 Fall Department of Computer Science Purdue University
Spatial Data Structures and Hierarchies CS535 Fall 2010 Daniel G Aliaga Daniel G. Aliaga Department of Computer Science Purdue University Spatial Data Structures Store geometric information Organize geometric
More informationSpatial Data Structures
CSCI 420 Computer Graphics Lecture 17 Spatial Data Structures Jernej Barbic University of Southern California Hierarchical Bounding Volumes Regular Grids Octrees BSP Trees [Angel Ch. 8] 1 Ray Tracing Acceleration
More informationSpatial Data Structures
CSCI 480 Computer Graphics Lecture 7 Spatial Data Structures Hierarchical Bounding Volumes Regular Grids BSP Trees [Ch. 0.] March 8, 0 Jernej Barbic University of Southern California http://www-bcf.usc.edu/~jbarbic/cs480-s/
More informationCollision and Proximity Queries
Collision and Proximity Queries Dinesh Manocha (based on slides from Ming Lin) COMP790-058 Fall 2013 Geometric Proximity Queries l Given two object, how would you check: If they intersect with each other
More informationSpatial Data Structures and Speed-Up Techniques. Tomas Akenine-Möller Department of Computer Engineering Chalmers University of Technology
Spatial Data Structures and Speed-Up Techniques Tomas Akenine-Möller Department of Computer Engineering Chalmers University of Technology Spatial data structures What is it? Data structure that organizes
More informationkd-trees Idea: Each level of the tree compares against 1 dimension. Let s us have only two children at each node (instead of 2 d )
kd-trees Invented in 1970s by Jon Bentley Name originally meant 3d-trees, 4d-trees, etc where k was the # of dimensions Now, people say kd-tree of dimension d Idea: Each level of the tree compares against
More informationCPSC / Sonny Chan - University of Calgary. Collision Detection II
CPSC 599.86 / 601.86 Sonny Chan - University of Calgary Collision Detection II Outline Broad phase collision detection: - Problem definition and motivation - Bounding volume hierarchies - Spatial partitioning
More informationGeometric Data Structures
Geometric Data Structures 1 Data Structure 2 Definition: A data structure is a particular way of organizing and storing data in a computer for efficient search and retrieval, including associated algorithms
More informationOrganizing Spatial Data
Organizing Spatial Data Spatial data records include a sense of location as an attribute. Typically location is represented by coordinate data (in 2D or 3D). 1 If we are to search spatial data using the
More informationGeometric Algorithms. Geometric search: overview. 1D Range Search. 1D Range Search Implementations
Geometric search: overview Geometric Algorithms Types of data:, lines, planes, polygons, circles,... This lecture: sets of N objects. Range searching Quadtrees, 2D trees, kd trees Intersections of geometric
More informationDetermining Differences between Two Sets of Polygons
Determining Differences between Two Sets of Polygons MATEJ GOMBOŠI, BORUT ŽALIK Institute for Computer Science Faculty of Electrical Engineering and Computer Science, University of Maribor Smetanova 7,
More informationSpatial Data Structures
Spatial Data Structures Hierarchical Bounding Volumes Regular Grids Octrees BSP Trees Constructive Solid Geometry (CSG) [Angel 9.10] Outline Ray tracing review what rays matter? Ray tracing speedup faster
More informationSpatial Data Structures
15-462 Computer Graphics I Lecture 17 Spatial Data Structures Hierarchical Bounding Volumes Regular Grids Octrees BSP Trees Constructive Solid Geometry (CSG) April 1, 2003 [Angel 9.10] Frank Pfenning Carnegie
More informationHomework 1: Implicit Surfaces, Collision Detection, & Volumetric Data Structures. Loop Subdivision. Loop Subdivision. Questions/Comments?
Homework 1: Questions/Comments? Implicit Surfaces,, & Volumetric Data Structures Loop Subdivision Shirley, Fundamentals of Computer Graphics Loop Subdivision SIGGRAPH 2000 course notes Subdivision for
More informationScene Management. Video Game Technologies 11498: MSc in Computer Science and Engineering 11156: MSc in Game Design and Development
Video Game Technologies 11498: MSc in Computer Science and Engineering 11156: MSc in Game Design and Development Chap. 5 Scene Management Overview Scene Management vs Rendering This chapter is about rendering
More informationPoint Enclosure and the Interval Tree
C.S. 252 Prof. Roberto Tamassia Computational Geometry Sem. II, 1992 1993 Lecture 8 Date: March 3, 1993 Scribe: Dzung T. Hoang Point Enclosure and the Interval Tree Point Enclosure We consider the 1-D
More informationExternal-Memory Algorithms with Applications in GIS - (L. Arge) Enylton Machado Roberto Beauclair
External-Memory Algorithms with Applications in GIS - (L. Arge) Enylton Machado Roberto Beauclair {machado,tron}@visgraf.impa.br Theoretical Models Random Access Machine Memory: Infinite Array. Access
More informationSpatial Data Structures
15-462 Computer Graphics I Lecture 17 Spatial Data Structures Hierarchical Bounding Volumes Regular Grids Octrees BSP Trees Constructive Solid Geometry (CSG) March 28, 2002 [Angel 8.9] Frank Pfenning Carnegie
More informationJanuary 10-12, NIT Surathkal Introduction to Graph and Geometric Algorithms
Geometric data structures Sudebkumar Prasant Pal Department of Computer Science and Engineering IIT Kharagpur, 721302. email: spp@cse.iitkgp.ernet.in January 10-12, 2012 - NIT Surathkal Introduction to
More information11 - Spatial Data Structures
11 - Spatial Data Structures cknowledgement: Marco Tarini Types of Queries Graphic applications often require spatial queries Find the k points closer to a specific point p (k-nearest Neighbours, knn)
More informationAnnouncements. Written Assignment2 is out, due March 8 Graded Programming Assignment2 next Tuesday
Announcements Written Assignment2 is out, due March 8 Graded Programming Assignment2 next Tuesday 1 Spatial Data Structures Hierarchical Bounding Volumes Grids Octrees BSP Trees 11/7/02 Speeding Up Computations
More informationRay Tracing Acceleration Data Structures
Ray Tracing Acceleration Data Structures Sumair Ahmed October 29, 2009 Ray Tracing is very time-consuming because of the ray-object intersection calculations. With the brute force method, each ray has
More informationFoundations of Multidimensional and Metric Data Structures
Foundations of Multidimensional and Metric Data Structures Hanan Samet University of Maryland, College Park ELSEVIER AMSTERDAM BOSTON HEIDELBERG LONDON NEW YORK OXFORD PARIS SAN DIEGO SAN FRANCISCO SINGAPORE
More informationAlgorithms. Algorithms GEOMETRIC APPLICATIONS OF BSTS. 1d range search line segment intersection kd trees interval search trees rectangle intersection
Algorithms ROBERT SEDGEWICK KEVIN WAYNE GEOMETRIC APPLICATIONS OF BSTS Algorithms F O U R T H E D I T I O N ROBERT SEDGEWICK KEVIN WAYNE 1d range search line segment intersection kd trees interval search
More informationAlgorithms. Algorithms GEOMETRIC APPLICATIONS OF BSTS. 1d range search line segment intersection kd trees interval search trees rectangle intersection
Algorithms ROBERT SEDGEWICK KEVIN WAYNE GEOMETRIC APPLICATIONS OF BSTS Algorithms F O U R T H E D I T I O N ROBERT SEDGEWICK KEVIN WAYNE 1d range search line segment intersection kd trees interval search
More informationAlgorithms. Algorithms GEOMETRIC APPLICATIONS OF BSTS. 1d range search line segment intersection kd trees interval search trees rectangle intersection
Algorithms ROBERT SEDGEWICK KEVIN WAYNE GEOMETRIC APPLICATIONS OF BSTS Algorithms F O U R T H E D I T I O N ROBERT SEDGEWICK KEVIN WAYNE 1d range search line segment intersection kd trees interval search
More informationCollision Detection. These slides are mainly from Ming Lin s course notes at UNC Chapel Hill
Collision Detection These slides are mainly from Ming Lin s course notes at UNC Chapel Hill http://www.cs.unc.edu/~lin/comp259-s06/ Computer Animation ILE5030 Computer Animation and Special Effects 2 Haptic
More informationCollision Detection based on Spatial Partitioning
Simulation in Computer Graphics Collision Detection based on Spatial Partitioning Matthias Teschner Computer Science Department University of Freiburg Outline introduction uniform grid Octree and k-d tree
More information! Good algorithms also extend to higher dimensions. ! Curse of dimensionality. ! Range searching. ! Nearest neighbor.
Geometric search: Overview Geometric Algorithms Types of data. Points, lines, planes, polygons, circles,... This lecture. Sets of N objects. Geometric problems extend to higher dimensions.! Good algorithms
More informationCSG obj. oper3. obj1 obj2 obj3. obj5. obj4
Solid Modeling Solid: Boundary + Interior Volume occupied by geometry Solid representation schemes Constructive Solid Geometry (CSG) Boundary representations (B-reps) Space-partition representations Operations
More informationComputation Geometry Exercise Range Searching II
Computation Geometry Exercise Range Searching II LEHRSTUHL FÜR ALGORITHMIK I INSTITUT FÜR THEORETISCHE INFORMATIK FAKULTÄT FÜR INFORMATIK Guido Brückner 20.07.2018 1 Object types in range queries y0 y
More informationUsing Bounding Volume Hierarchies Efficient Collision Detection for Several Hundreds of Objects
Part 7: Collision Detection Virtuelle Realität Wintersemester 2007/08 Prof. Bernhard Jung Overview Bounding Volumes Separating Axis Theorem Using Bounding Volume Hierarchies Efficient Collision Detection
More informationAlgorithms GEOMETRIC APPLICATIONS OF BSTS. 1d range search line segment intersection kd trees interval search trees rectangle intersection
GEOMETRIC APPLICATIONS OF BSTS Algorithms F O U R T H E D I T I O N 1d range search line segment intersection kd trees interval search trees rectangle intersection R O B E R T S E D G E W I C K K E V I
More informationIntersection Acceleration
Advanced Computer Graphics Intersection Acceleration Matthias Teschner Computer Science Department University of Freiburg Outline introduction bounding volume hierarchies uniform grids kd-trees octrees
More informationChap4: Spatial Storage and Indexing. 4.1 Storage:Disk and Files 4.2 Spatial Indexing 4.3 Trends 4.4 Summary
Chap4: Spatial Storage and Indexing 4.1 Storage:Disk and Files 4.2 Spatial Indexing 4.3 Trends 4.4 Summary Learning Objectives Learning Objectives (LO) LO1: Understand concept of a physical data model
More informationComputing intersections in a set of line segments: the Bentley-Ottmann algorithm
Computing intersections in a set of line segments: the Bentley-Ottmann algorithm Michiel Smid October 14, 2003 1 Introduction In these notes, we introduce a powerful technique for solving geometric problems.
More informationPlanar Point Location
C.S. 252 Prof. Roberto Tamassia Computational Geometry Sem. II, 1992 1993 Lecture 04 Date: February 15, 1993 Scribe: John Bazik Planar Point Location 1 Introduction In range searching, a set of values,
More informationComputational Geometry
Windowing queries Windowing Windowing queries Zoom in; re-center and zoom in; select by outlining Windowing Windowing queries Windowing Windowing queries Given a set of n axis-parallel line segments, preprocess
More informationAlgorithms. Algorithms GEOMETRIC APPLICATIONS OF BSTS. 1d range search kd trees line segment intersection interval search trees rectangle intersection
KdTree Next Assignment due /26 (Tuesday after Spring Break) This Thursday, precept will cover the assignment in detail using a great worksheet (thanks Maia!). Due two days after Spring break ends. Second
More informationRange Searching II: Windowing Queries
Computational Geometry Lecture : Windowing Queries INSTITUT FÜR THEORETISCHE INFORMATIK FAKULTÄT FÜR INFORMATIK Tamara Mchedlidze Chih-Hung Liu 23.11.2015 1 Object types in range queries y0 y x x0 Setting
More informationA Distributed Approach to Fast Map Overlay
A Distributed Approach to Fast Map Overlay Peter Y. Wu Robert Morris University Abstract Map overlay is the core operation in many GIS applications. We briefly survey the different approaches, and describe
More informationLecture 25 of 41. Spatial Sorting: Binary Space Partitioning Quadtrees & Octrees
Spatial Sorting: Binary Space Partitioning Quadtrees & Octrees William H. Hsu Department of Computing and Information Sciences, KSU KSOL course pages: http://bit.ly/hgvxlh / http://bit.ly/evizre Public
More informationBalanced Box-Decomposition trees for Approximate nearest-neighbor. Manos Thanos (MPLA) Ioannis Emiris (Dept Informatics) Computational Geometry
Balanced Box-Decomposition trees for Approximate nearest-neighbor 11 Manos Thanos (MPLA) Ioannis Emiris (Dept Informatics) Computational Geometry Nearest Neighbor A set S of n points is given in some metric
More informationImage warping introduction
Image warping introduction 1997-2015 Josef Pelikán CGG MFF UK Praha pepca@cgg.mff.cuni.cz http://cgg.mff.cuni.cz/~pepca/ Warping 2015 Josef Pelikán, http://cgg.mff.cuni.cz/~pepca 1 / 22 Warping.. image
More informationComputational Geometry
Windowing queries Windowing Windowing queries Zoom in; re-center and zoom in; select by outlining Windowing Windowing queries Windowing Windowing queries Given a set of n axis-parallel line segments, preprocess
More informationCollision Detection with Bounding Volume Hierarchies
Simulation in Computer Graphics Collision Detection with Bounding Volume Hierarchies Matthias Teschner Computer Science Department University of Freiburg Outline introduction bounding volumes BV hierarchies
More informationGEOMETRIC SEARCHING PART 1: POINT LOCATION
GEOMETRIC SEARCHING PART 1: POINT LOCATION PETR FELKEL FEL CTU PRAGUE felkel@fel.cvut.cz https://cw.felk.cvut.cz/doku.php/courses/a4m39vg/start Based on [Berg] and [Mount] Version from 3.10.2014 Geometric
More informationSpatial Data Structures and Speed-Up Techniques. Ulf Assarsson Department of Computer Science and Engineering Chalmers University of Technology
Spatial Data Structures and Speed-Up Techniques Ulf Assarsson Department of Computer Science and Engineering Chalmers University of Technology Exercises l Create a function (by writing code on paper) that
More informationCollision Detection II. These slides are mainly from Ming Lin s course notes at UNC Chapel Hill
Collision Detection II These slides are mainly from Ming Lin s course notes at UNC Chapel Hill http://www.cs.unc.edu/~lin/comp259-s06/ Some Possible Approaches Geometric methods Algebraic techniques Hierarchical
More informationRay Tracing III. Wen-Chieh (Steve) Lin National Chiao-Tung University
Ray Tracing III Wen-Chieh (Steve) Lin National Chiao-Tung University Shirley, Fundamentals of Computer Graphics, Chap 10 Doug James CG slides, I-Chen Lin s CG slides Ray-tracing Review For each pixel,
More informationCAB: Fast Update of OBB Trees for Collision Detection between Articulated Bodies
CAB: Fast Update of OBB Trees for Collision Detection between Articulated Bodies Harald Schmidl Nolan Walker Ming C. Lin {schmidl walkern lin}@cs.unc.edu Department of Computer Science Sitterson Hall,
More informationSpatial Data Structures and Acceleration Algorithms
Spatial Data Structures and Acceleration Algorithms Real-time Renderg Performance Goals Spatial Structures Boundg Volume Hierarchies (BVH) Bary Space Partiong(BSP) Trees, Octrees Scene Graphs Cullg Techniques
More informationComputer Graphics. - Ray-Tracing II - Hendrik Lensch. Computer Graphics WS07/08 Ray Tracing II
Computer Graphics - Ray-Tracing II - Hendrik Lensch Overview Last lecture Ray tracing I Basic ray tracing What is possible? Recursive ray tracing algorithm Intersection computations Today Advanced acceleration
More informationCS 563 Advanced Topics in Computer Graphics Culling and Acceleration Techniques Part 1 by Mark Vessella
CS 563 Advanced Topics in Computer Graphics Culling and Acceleration Techniques Part 1 by Mark Vessella Introduction Acceleration Techniques Spatial Data Structures Culling Outline for the Night Bounding
More informationA Survey on Collision Detection Techniques for Virtual Environments
A Survey on Collision Detection Techniques for Virtual Environments Mauro Figueiredo 1,2, Luis Marcelino 1, Terrence Fernando 1 1 Centre for Virtual Environments, University of Salford University Road,
More informationimproving raytracing speed
ray tracing II computer graphics ray tracing II 2006 fabio pellacini 1 improving raytracing speed computer graphics ray tracing II 2006 fabio pellacini 2 raytracing computational complexity ray-scene intersection
More information(Master Course) Mohammad Farshi Department of Computer Science, Yazd University. Yazd Univ. Computational Geometry.
1 / 17 (Master Course) Mohammad Farshi Department of Computer Science, Yazd University 1392-1 2 / 17 : Mark de Berg, Otfried Cheong, Marc van Kreveld, Mark Overmars, Algorithms and Applications, 3rd Edition,
More informationVicinities for Spatial Data Processing: a Statistical Approach to Algorithm Design
Vicinities for Spatial Data Processing: a Statistical Approach to Algorithm Design Peter Y. Wu wu@rmu.edu Department of Computer and Information Systems Sushil Acharya acharya@rmu.edu Department of Engineering
More informationAcceleration Data Structures
CT4510: Computer Graphics Acceleration Data Structures BOCHANG MOON Ray Tracing Procedure for Ray Tracing: For each pixel Generate a primary ray (with depth 0) While (depth < d) { Find the closest intersection
More informationComputer Graphics (CS 543) Lecture 13b Ray Tracing (Part 1) Prof Emmanuel Agu. Computer Science Dept. Worcester Polytechnic Institute (WPI)
Computer Graphics (CS 543) Lecture 13b Ray Tracing (Part 1) Prof Emmanuel Agu Computer Science Dept. Worcester Polytechnic Institute (WPI) Raytracing Global illumination-based rendering method Simulates
More informationGeometric Data Structures Multi-dimensional queries Nearest neighbour problem References. Notes on Computational Geometry and Data Structures
Notes on Computational Geometry and Data Structures 2008 Geometric Data Structures and CGAL Geometric Data Structures and CGAL Data Structure Interval Tree Priority Search Tree Segment Tree Range tree
More informationLesson 05. Mid Phase. Collision Detection
Lesson 05 Mid Phase Collision Detection Lecture 05 Outline Problem definition and motivations Generic Bounding Volume Hierarchy (BVH) BVH construction, fitting, overlapping Metrics and Tandem traversal
More informationSorting in Space. Hanan Samet hjs
Sorting in Space Multidimensional, Spatial, and Metric Data Structures for Applications in Spatial Dataases, Geographic Information Systems (GIS), and Location-Based Services Hanan Samet hjs@cs.umd.edu
More informationComputer Graphics. Bing-Yu Chen National Taiwan University The University of Tokyo
Computer Graphics Bing-Yu Chen National Taiwan University The University of Tokyo Hidden-Surface Removal Back-Face Culling The Depth-Sort Algorithm Binary Space-Partitioning Trees The z-buffer Algorithm
More informationMultidimensional Data and Modelling - DBMS
Multidimensional Data and Modelling - DBMS 1 DBMS-centric approach Summary: l Spatial data is considered as another type of data beside conventional data in a DBMS. l Enabling advantages of DBMS (data
More informationQuadstream. Algorithms for Multi-scale Polygon Generalization. Curran Kelleher December 5, 2012
Quadstream Algorithms for Multi-scale Polygon Generalization Introduction Curran Kelleher December 5, 2012 The goal of this project is to enable the implementation of highly interactive choropleth maps
More informationOrthogonal Range Queries
Orthogonal Range Piotr Indyk Range Searching in 2D Given a set of n points, build a data structure that for any query rectangle R, reports all points in R Kd-trees [Bentley] Not the most efficient solution
More informationComputer Graphics. Bing-Yu Chen National Taiwan University
Computer Graphics Bing-Yu Chen National Taiwan University Visible-Surface Determination Back-Face Culling The Depth-Sort Algorithm Binary Space-Partitioning Trees The z-buffer Algorithm Scan-Line Algorithm
More informationl Heaps very popular abstract data structure, where each object has a key value (the priority), and the operations are:
DDS-Heaps 1 Heaps - basics l Heaps very popular abstract data structure, where each object has a key value (the priority), and the operations are: l insert an object, find the object of minimum key (find
More informationComputational Geometry
Computational Geometry Search in High dimension and kd-trees Ioannis Emiris Dept Informatics & Telecoms, National Kapodistrian U. Athens ATHENA Research & Innovation Center, Greece Spring 2018 I.Emiris
More informationR-Trees. Accessing Spatial Data
R-Trees Accessing Spatial Data In the beginning The B-Tree provided a foundation for R- Trees. But what s a B-Tree? A data structure for storing sorted data with amortized run times for insertion and deletion
More informationRay scene intersections
Ray scene intersections 1996-2018 Josef Pelikán CGG MFF UK Praha pepca@cgg.mff.cuni.cz http://cgg.mff.cuni.cz/~pepca/ Intersection 2018 Josef Pelikán, http://cgg.mff.cuni.cz/~pepca 1 / 26 Ray scene intersection
More informationComputational Geometry
Orthogonal Range Searching omputational Geometry hapter 5 Range Searching Problem: Given a set of n points in R d, preprocess them such that reporting or counting the k points inside a d-dimensional axis-parallel
More informationCS 532: 3D Computer Vision 14 th Set of Notes
1 CS 532: 3D Computer Vision 14 th Set of Notes Instructor: Philippos Mordohai Webpage: www.cs.stevens.edu/~mordohai E-mail: Philippos.Mordohai@stevens.edu Office: Lieb 215 Lecture Outline Triangulating
More informationSILC: Efficient Query Processing on Spatial Networks
Hanan Samet hjs@cs.umd.edu Department of Computer Science University of Maryland College Park, MD 20742, USA Joint work with Jagan Sankaranarayanan and Houman Alborzi Proceedings of the 13th ACM International
More informationGeometric Data Structures
Geometric Data Structures Swami Sarvottamananda Ramakrishna Mission Vivekananda University THAPAR-IGGA, 2010 Outline I 1 Introduction Motivation for Geometric Data Structures Scope of the Lecture 2 Range
More informationCMSC 425: Lecture 10 Geometric Data Structures for Games: Index Structures Tuesday, Feb 26, 2013
CMSC 2: Lecture 10 Geometric Data Structures for Games: Index Structures Tuesday, Feb 2, 201 Reading: Some of today s materials can be found in Foundations of Multidimensional and Metric Data Structures,
More informationCMSC 754 Computational Geometry 1
CMSC 754 Computational Geometry 1 David M. Mount Department of Computer Science University of Maryland Fall 2005 1 Copyright, David M. Mount, 2005, Dept. of Computer Science, University of Maryland, College
More informationAdvanced Algorithm Design and Analysis (Lecture 12) SW5 fall 2005 Simonas Šaltenis E1-215b
Advanced Algorithm Design and Analysis (Lecture 12) SW5 fall 2005 Simonas Šaltenis E1-215b simas@cs.aau.dk Range Searching in 2D Main goals of the lecture: to understand and to be able to analyze the kd-trees
More informationSimulation in Computer Graphics Space Subdivision. Matthias Teschner
Simulation in Computer Graphics Space Subdivision Matthias Teschner Outline Introduction Uniform grid Octree and k-d tree BSP tree University of Freiburg Computer Science Department 2 Model Partitioning
More informationSpatial Data Structures and Acceleration Algorithms
Spatial Data Structures and Acceleration Algorithms Real-time Rendering Performance Goals Spatial Structures Bounding Volume Hierarchies (BVH) Binary Space Partioning(BSP) Trees, Octrees Scene Graphs Culling
More informationCS251-SE1. Midterm 2. Tuesday 11/1 8:00pm 9:00pm. There are 16 multiple-choice questions and 6 essay questions.
CS251-SE1 Midterm 2 Tuesday 11/1 8:00pm 9:00pm There are 16 multiple-choice questions and 6 essay questions. Answer the multiple choice questions on your bubble sheet. Answer the essay questions in the
More informationMathematical Approaches for Collision Detection in Fundamental Game Objects
Mathematical Approaches for Collision Detection in Fundamental Game Objects Weihu Hong 1, Junfeng Qu 2, Mingshen Wu 3 1 Department of Mathematics, Clayton State University, Morrow, GA, 30260 2 Department
More informationCOMP 175: Computer Graphics April 11, 2018
Lecture n+1: Recursive Ray Tracer2: Advanced Techniques and Data Structures COMP 175: Computer Graphics April 11, 2018 1/49 Review } Ray Intersect (Assignment 4): questions / comments? } Review of Recursive
More informationLecture 17: Solid Modeling.... a cubit on the one side, and a cubit on the other side Exodus 26:13
Lecture 17: Solid Modeling... a cubit on the one side, and a cubit on the other side Exodus 26:13 Who is on the LORD's side? Exodus 32:26 1. Solid Representations A solid is a 3-dimensional shape with
More informationLecture 3 February 23, 2012
6.851: Advanced Data Structures Spring 2012 Prof. Erik Demaine Lecture 3 February 23, 2012 1 Overview In the last lecture we saw the concepts of persistence and retroactivity as well as several data structures
More informationSpeeding up your game
Speeding up your game The scene graph Culling techniques Level-of-detail rendering (LODs) Collision detection Resources and pointers (adapted by Marc Levoy from a lecture by Tomas Möller, using material
More informationSolid Modeling. Thomas Funkhouser Princeton University C0S 426, Fall Represent solid interiors of objects
Solid Modeling Thomas Funkhouser Princeton University C0S 426, Fall 2000 Solid Modeling Represent solid interiors of objects Surface may not be described explicitly Visible Human (National Library of Medicine)
More informationGeometric Data Structures
Geometric Data Structures Swami Sarvottamananda Ramakrishna Mission Vivekananda University Coimbatore-IGGA, 2010 Outline I 1 Introduction Scope of the Lecture Motivation for Geometric Data Structures 2
More informationI/O-Algorithms Lars Arge Aarhus University
I/O-Algorithms Aarhus University April 10, 2008 I/O-Model Block I/O D Parameters N = # elements in problem instance B = # elements that fits in disk block M = # elements that fits in main memory M T =
More informationIntroduction to Indexing R-trees. Hong Kong University of Science and Technology
Introduction to Indexing R-trees Dimitris Papadias Hong Kong University of Science and Technology 1 Introduction to Indexing 1. Assume that you work in a government office, and you maintain the records
More informationOrthogonal line segment intersection. Computational Geometry [csci 3250] Laura Toma Bowdoin College
Orthogonal line segment intersection Computational Geometry [csci 3250] Laura Toma Bowdoin College Line segment intersection The problem (what) Applications (why) Algorithms (how) A special case: Orthogonal
More informationSpatial Data Structures for Computer Graphics
Spatial Data Structures for Computer Graphics Page 1 of 65 http://www.cse.iitb.ac.in/ sharat November 2008 Spatial Data Structures for Computer Graphics Page 1 of 65 http://www.cse.iitb.ac.in/ sharat November
More informationl Without collision detection (CD), it is practically impossible to construct e.g., games, movie production tools (e.g., Avatar)
Collision Detection Originally created by Tomas Akenine-Möller Updated by Ulf Assarsson Department of Computer Engineering Chalmers University of Technology Introduction l Without collision detection (CD),
More informationComputational Geometry
Motivation Motivation Polygons and visibility Visibility in polygons Triangulation Proof of the Art gallery theorem Two points in a simple polygon can see each other if their connecting line segment is
More informationReferences. Additional lecture notes for 2/18/02.
References Additional lecture notes for 2/18/02. I-COLLIDE: Interactive and Exact Collision Detection for Large-Scale Environments, by Cohen, Lin, Manocha & Ponamgi, Proc. of ACM Symposium on Interactive
More informationMultidimensional Indexes [14]
CMSC 661, Principles of Database Systems Multidimensional Indexes [14] Dr. Kalpakis http://www.csee.umbc.edu/~kalpakis/courses/661 Motivation Examined indexes when search keys are in 1-D space Many interesting
More informationIFC-based clash detection for the open-source BIMserver
icccbe 2010 Nottingham University Press Proceedings of the International Conference on Computing in Civil and Building Engineering W Tizani (Editor) IFC-based clash detection for the open-source BIMserver
More informationCOMPARISON OF SPATIAL DATA STRUCTURES IN OPENMP PARALLELIZED STEERING
COMPARISON OF SPATIAL DATA STRUCTURES IN OPENMP PARALLELIZED STEERING Alexander Wirz, Claudia Leopold, Björn Knafla University of Kassel, Research Group Programming Languages / Methodologies Wilhelmshöher
More informationWhat we have covered?
What we have covered? Indexing and Hashing Data warehouse and OLAP Data Mining Information Retrieval and Web Mining XML and XQuery Spatial Databases Transaction Management 1 Lecture 6: Spatial Data Management
More information