# Binary Space Partitions

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Title: Binary Space Partitions Name: Adrian Dumitrescu 1, Csaba D. Tóth 2,3 Affil./Addr. 1: Computer Science, Univ. of Wisconsin Milwaukee, Milwaukee, WI, USA Affil./Addr. 2: Mathematics, California State University Northridge, Los Angeles, CA, USA Affil./Addr. 3: Computer Science, Tufts University, Medford, MA, USA Keywords: Computational geometry; Recursive partition; Convex decomposition; BSP tree SumOriWork: No Years and Authors of Summarized Original Work Given Binary Space Partitions Adrian Dumitrescu 1, Csaba D. Tóth 2,3 1 Computer Science, Univ. of Wisconsin Milwaukee, Milwaukee, WI, USA 2 Mathematics, California State University Northridge, Los Angeles, CA, USA 3 Computer Science, Tufts University, Medford, MA, USA Years aud Authors of Summarized Original Work No Years and Authors of Summarized Original Work Given Keywords Computational geometry; Recursive partition; Convex decomposition; BSP tree Problem Definition The binary space partition (for short, BSP) is a scheme for subdividing the ambient space R d into open convex sets (called cells) by hyperplanes in a recursive fashion. Each subdivision step for a cell results in two cells, in which the process may continue, independently of other cells, until a stopping criterion is met. The binary recursion tree, also called BSP-tree, is traditionally used as a data structure in computer graphics for efficient rendering of polyhedral scenes. Each node v of the BSP-tree, except for the leaves, corresponds to a cell C v R d and a partitioning hyperplane H v. The cell of the root r is C r = R d, and the two children of a node v correspond to C v H v and C v H + v, where H v and H + v denote the open halfspaces bounded by H v. Refer to Fig. 1. A binary space partition for a set of n pairwise disjoint (typically polyhedral) objects in R d is a BSP where the space is recursively partitioned until each cell intersects at most one object. When the BSP-tree is used as a data structure, every leaf v stores the fragment of at most one object clipped in the cell C v, and every interior node v stores the fragments of any lower-dimensional objects that lie in C v H v.

2 2 a a H 1 c H 2 c 1 b d H 1 b 1 b 2 H 4 a b 1 H 2 H 3 d c 2 H 3 H 5 H 4 b 2 c 1 c 2 H 5, d Fig. 1. Three 2-dimensional convex objects and a line segment (left), a binary space partition with five partition lines H 1,..., H 5 (center), and the corresponding BSP tree (right). A BSP for a set of objects has two parameters of interest: the size and the height of the corresponding BSP-tree. Ideally, a BSP partitions space so that each object lies entirely in a single cell or in a cutting hyperplane, yielding a so-called perfect BSP [4]. However, in most cases this is impossible, and the hyperplanes H v partition some of the input objects into fragments. Assuming that the input objects are k-dimensional, for some k d, the BSP typically stores only k-dimensional fragments, i.e., object parts clipped in leaf cells C v or in C v H v at interior nodes. The size of the BSP-tree is typically proportional to the number of k-dimensional fragments that the input objects are partitioned into, or the number of nodes in the tree. Given a set S of objects in R d, one would like to find a BSP for S with small size and/or height. The partition complexity of a set of objects S is defined as the minimum size of a BSP for S. GLOSSARY Autopartition: a class of BSPs obtained by imposing the constraint that each cut is along a hyperplane containing a facet of one of the input objects. Axis-aligned BSP: a class of BSPs obtained by imposing the constraint that each cut is orthogonal to a coordinate axis. Round-robin BSP: An axis-aligned BSP in R d where any d consecutive recursive cuts are along hyperplanes orthogonal to the d coordinate axes. Tiling in R d : a set of interior-disjoint polyhedra that partition R d. Axis-aligned tiling: a set of full-dimensional boxes that partition R d. d-dimensional box: the cross product of d real-valued intervals. Key Results The theoretical study of BSPs was initiated by Paterson and Yao [12, 13]. Line segments in the plane. A classical result of Paterson and Yao [12] is a simple and elegant randomized algorithm, which, given n disjoint segments, produces a BSP whose expected size is O(n log n); see also [3, Ch. 12]. It was widely believed for decades that every set of n disjoint line segments in the plane admits a BSP of size O(n), see e.g. [12, p. 502]; this was until Tóth proved a tight super-linear bound for this problem, first by constructing a set of segments for which any BSP must have size Ω(n log n/ log log n), and later by matching this bound algorithmically: Theorem 1. [14, 17] Every set of n disjoint line segments in the plane admits a BSP of size O(n log n/ log log n). This bound is the best possible, and a BSP of this size can be computed using O(n log 2 n) time.

3 (d 1)-dimensional simplices in R d. The randomized partition technique of Paterson and Yao generalizes to higher dimensions yielding the following. Theorem 2. [12] Every set of n (d 1)-dimensional simplices in R d, where d 3 admits a BSP of size O(n d 1 ). While there exist n disjoint triangles in R 3 that require a BSP of size Ω(n 2 ) [7], no super-quadratic lower bound is known in any dimension d. Near-linear upper bounds are known for realistic input models in R 3 such as uncluttered scenes [5] or fat axis-aligned rectangles [16]. Axis-parallel segments, rectangles, and hyperrectangles. Theorem 3. [1, 8, 12] Every set of n pairwise disjoint axis-parallel line segments in the plane admits an auto-partition of size at most 2n 1. Such a BSP can be computed using O(n log n) time and space, and has the additional property that no input segment is cut more than once. The upper bound on the size is the best possible apart from lower order terms. Theorem 4. [8, 13] Let Γ be a collection of n line segments in R d, where d 3, consisting of n i segments parallel to the x i -axis, for i = 1,..., d. Then Γ admits a BSP of size at most 4 1/(d 1) (d 1)(n 1 n 2 n d ) 1/(d 1) + 2n. Theorem 5. [8] For constants 1 k d 1, every set of n axis-parallel k-rectangles in d-space admits an axis-aligned BSP of size O(n d/(d k) ). This bound is the best possible for k < d/2 apart from the constant factor. For k d/2, the best known upper and lower bounds do not match. No super-quadratic lower bound is known in any dimension d. In R 4, Dumitrescu et al. [8] constructed n 2-dimensional disjoint rectangles whose partition complexity is Ω(n 5/3 ). Tilings. Already in the plane, the worst case partition complexity of axis-aligned tilings is smaller than that for disjoint boxes. Berman, DasGupta, and Muthukrishnan [6] showed that every axis-aligned tiling of size n admits an axis-aligned BSP of size at most 2n; apart from lower order terms this bound is the best possible. For higher dimensions, Hershberger, Suri, and Tóth obtained the following result. Theorem 6. [11] Every axis-aligned tiling of size n in R d, where d 2, admits a round-robin BSP of size O(n (d+1)/3 ). On the the hand, there exist tilings of size n in R d for which every BSP has size Ω(n β(d) ), where β(3) = 4/3, and lim d β(d) = (1 + 5)/ In dimensions d = 3, the partition complexity of axis-aligned tilings of size n is O(n 4/3 ), which is tight by a construction of Hershberger and Suri [10]. 3 Applications The initial and most prominent applications are in computer graphics: BSPs support fast hidden-surface removal and ray tracing for moving viewpoints [9, 12]. Rendering is used for visualizing spatial opaque surfaces on the screen. A common and efficient rendering technique is the so-called painter s algorithm. Every object is drawn sequentially according to the back-to-front order, starting with the deepest object and continuing with the objects closer to the viewpoint. When all the objects have been drawn, every pixel represents the color of the object closest to the viewpoint. Further computer

4 graphics applications include constructive solid geometry and shadow generation. Other applications of BSP trees include range counting, point location, collision detection, robotics, graph drawing, and network design; see for instance [15] and the references therein. In the original setting, the input objects of the BSP were assumed to be static. Recent research on BSPs for moving objects can be seen in the context of kinetic data structures (KDS) of Basch, Guibas, and Hershberger [2]. In this model, objects move continuously along a given trajectory (flight plan), typically along a line or a low degree algebraic curve. The splitting hyperplanes are defined by faces of the input objects, and so they move continuously, too. The BSP is updated only at discrete events, though, when the combinatorial structure of the BSP changes. 4 Open Problems What is the maximum partition complexity of n disjoint (d 1)-dimensional simplices in R d for d 3? What is the maximum partition complexity of n disjoint (axis-aligned) boxes in R d for d 3? What is the maximum (axis-aligned) partition complexity of a tiling of n axisaligned boxes in R d for d 4? Are there families of n disjoint objects in R d whose partition complexity is super-quadratic in n? How many combinatorial changes can occur in the kinetic BSP of n points moving with constant velocities in the plane? In all five open problems, the dimension d N of the ambient space R d is constant, and asymptotically tight bounds in terms of n are sought. Cross-References Kinetic Data Structures Recommended Reading 1. F. d Amore and P. G. Franciosa, On the optimal binary plane partition for sets of isothetic rectangles, Inform. Process. Lett. 44 (1992), J. Basch, L.J. Guibas, and J. Hershberger, Data structures for mobile data, J. Algorithms 31(1) (1999), M. de Berg, O. Cheong, M. van Kreveld, and M. Overmars, Computational Geometry, 3rd edition, Springer Verlag, M. de Berg, M. de Groot, and M.H. Overmars, Perfect binary space partitions, Comput. Geom. Theory Appl. 7 (1997), M. de Berg, M.J. Katz, A.F. van der Stappen, and J. Vleugels, Realistic input models for geometric algorithms, Algorithmica 34 (2002), P. Berman, B. DasGupta, and S. Muthukrishnan, On the exact size of the binary space partitioning of sets of isothetic rectangles with applications, SIAM J. Disc. Math. 15(2) (2002), B. Chazelle, Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm, SIAM J. Computing 13 (1984), A. Dumitrescu, J.S.B. Mitchell, and M. Sharir, Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles, Discrete Comput. Geom. 31(2) (2004),

5 9. H. Fuchs, Z. M. Kedem, and B. Naylor, On visible surface generation by a priori tree structures, Comput. Graph. 14(3) (1980), J. Hershberger and S. Suri, Binary space partitions for 3D subdivisions, in Proc. 14th ACM-SIAM Sympos. on Discrete Algorithms, ACM Press, 2003, pp J. Hershberger, S. Suri and Cs. D. Tóth, Binary space partitions of orthogonal subdivisions, SIAM J. Computing 34(6) (2005), M. S. Paterson and F. F. Yao, Efficient binary space partitions for hidden-surface removal and solid modeling, Discrete Comput. Geom. 5 (1990), M. S. Paterson and F. F. Yao, Optimal binary space partitions for orthogonal objects, J. Algorithms 13 (1992), Cs. D. Tóth, A note on binary plane partitions, Discrete Comput. Geom. 30 (2003), Cs. D. Tóth, Binary space partitions: recent developments, in Combinatorial and Computational Geometry (J.E. Goodman, J. Pach, and E. Welzl, eds.), pp , vol. 52 of MSRI Publications, Cambridge Univ. Press, Cambridge, Cs. D. Tóth, Binary space partition for axis-aligned fat rectangles, SIAM J. Comput. 38(1) (2008), Cs. D. Tóth, Binary plane partitions for disjoint line segments, Discrete Comput. Geom. 45(4) (2011),

### Binary Space Partitions: Recent Developments

Combinatorial and Computational Geometry MSRI Publications Volume 52, 2005 Binary Space Partitions: Recent Developments CSABA D. TÓTH Abstract. A binary space partition tree is a data structure for the

### Binary Space Partitions for Axis-Parallel Line Segments: Size-Height Tradeoffs

Binary Space Partitions for Axis-Parallel Line Segments: Size-Height Tradeoffs Sunil Arya Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong

### Binary Space Partitions of Orthogonal Subdivisions

Binary Space Partitions of Orthogonal Subdivisions John Hershberger Subhash Suri Csaba D. Tóth Abstract We consider the problem of constructing binary space partitions (BSPs) for orthogonal subdivisions

### Optimal Binary Space Partitions in the Plane

Optimal Binary Space Partitions in the Plane Mark de Berg and Amirali Khosravi TU Eindhoven, P.O. Box 513, 5600 MB Eindhoven, the Netherlands Abstract. An optimal bsp for a set S of disjoint line segments

### A Note on Maximum Independent Sets in Rectangle Intersection Graphs

A Note on Maximum Independent Sets in Rectangle Intersection Graphs Timothy M. Chan School of Computer Science University of Waterloo Waterloo, Ontario N2L 3G1, Canada tmchan@uwaterloo.ca September 12,

### Solving Geometric Problems with the Rotating Calipers *

Solving Geometric Problems with the Rotating Calipers * Godfried Toussaint School of Computer Science McGill University Montreal, Quebec, Canada ABSTRACT Shamos [1] recently showed that the diameter of

### The Orthogonal Art Gallery Theorem with Constrained Guards

The Orthogonal Art Gallery Theorem with Constrained Guards T. S. Michael 1 Mathematics Department United States Naval Academy Annapolis, MD, U.S.A. Val Pinciu 2 Department of Mathematics Southern Connecticut

### Kinematic chains/skeleton Relative

Review of Tuesday Complex (mechanical) objects consist of components Kinematic chains/skeleton represented as tree Hierarchical modeling facilitates implementation of relative behavior of components Relative

### Shortest Inspection-Path. Queries in Simple Polygons

Shortest Inspection-Path Queries in Simple Polygons Christian Knauer, Günter Rote B 05-05 April 2005 Shortest Inspection-Path Queries in Simple Polygons Christian Knauer, Günter Rote Institut für Informatik,

### Data Warehousing und Data Mining

Data Warehousing und Data Mining Multidimensionale Indexstrukturen Ulf Leser Wissensmanagement in der Bioinformatik Content of this Lecture Multidimensional Indexing Grid-Files Kd-trees Ulf Leser: Data

### Max-Min Representation of Piecewise Linear Functions

Beiträge zur Algebra und Geometrie Contributions to Algebra and Geometry Volume 43 (2002), No. 1, 297-302. Max-Min Representation of Piecewise Linear Functions Sergei Ovchinnikov Mathematics Department,

### Internet Packet Filter Management and Rectangle Geometry

Internet Packet Filter Management and Rectangle Geometry David Eppstein S. Muthukrishnan Abstract We consider rule sets for internet packet routing and filtering, where each rule consists of a range of

### The minimum number of distinct areas of triangles determined by a set of n points in the plane

The minimum number of distinct areas of triangles determined by a set of n points in the plane Rom Pinchasi Israel Institute of Technology, Technion 1 August 6, 007 Abstract We prove a conjecture of Erdős,

### The number of generalized balanced lines

The number of generalized balanced lines David Orden Pedro Ramos Gelasio Salazar Abstract Let S be a set of r red points and b = r + 2δ blue points in general position in the plane, with δ 0. A line l

### Dhiren Bhatia Carnegie Mellon University

Dhiren Bhatia Carnegie Mellon University University Course Evaluations available online Please Fill! December 4 : In-class final exam Held during class time All students expected to give final this date

### A Short Introduction to Computer Graphics

A Short Introduction to Computer Graphics Frédo Durand MIT Laboratory for Computer Science 1 Introduction Chapter I: Basics Although computer graphics is a vast field that encompasses almost any graphical

### INTERSECTION OF LINE-SEGMENTS

INTERSECTION OF LINE-SEGMENTS Vera Sacristán Discrete and Algorithmic Geometry Facultat de Matemàtiques i Estadística Universitat Politècnica de Catalunya Problem Input: n line-segments in the plane,

### Shortcut sets for plane Euclidean networks (Extended abstract) 1

Shortcut sets for plane Euclidean networks (Extended abstract) 1 J. Cáceres a D. Garijo b A. González b A. Márquez b M. L. Puertas a P. Ribeiro c a Departamento de Matemáticas, Universidad de Almería,

### MA 323 Geometric Modelling Course Notes: Day 02 Model Construction Problem

MA 323 Geometric Modelling Course Notes: Day 02 Model Construction Problem David L. Finn November 30th, 2004 In the next few days, we will introduce some of the basic problems in geometric modelling, and

### INTERSECTION OF LINE-SEGMENTS

INTERSECTION OF LINE-SEGMENTS Vera Sacristán Computational Geometry Facultat d Informàtica de Barcelona Universitat Politècnica de Catalunya Problem Input: n line-segments in the plane, s i = (p i, q

### Disjoint Compatible Geometric Matchings

Disjoint Compatible Geometric Matchings Mashhood Ishaque Diane L. Souvaine Csaba D. Tóth Abstract We prove that for every even set of n pairwise disjoint line segments in the plane in general position,

### ON THE COMPLEXITY OF THE GAME OF SET. {kamalika,pbg,dratajcz,hoeteck}@cs.berkeley.edu

ON THE COMPLEXITY OF THE GAME OF SET KAMALIKA CHAUDHURI, BRIGHTEN GODFREY, DAVID RATAJCZAK, AND HOETECK WEE {kamalika,pbg,dratajcz,hoeteck}@cs.berkeley.edu ABSTRACT. Set R is a card game played with a

### Removing Even Crossings

EuroComb 2005 DMTCS proc. AE, 2005, 105 110 Removing Even Crossings Michael J. Pelsmajer 1, Marcus Schaefer 2 and Daniel Štefankovič 2 1 Department of Applied Mathematics, Illinois Institute of Technology,

### arxiv:1209.1595v5 [math.co] 26 Dec 2014

TRIANGLE-FREE INTERSECTION GRAPHS OF LINE SEGMENTS WITH LARGE CHROMATIC NUMBER ARKADIUSZ PAWLIK, JAKUB KOZIK, TOMASZ KRAWCZYK, MICHAŁ LASOŃ, PIOTR MICEK, WILLIAM T. TROTTER, AND BARTOSZ WALCZAK arxiv:1209.1595v5

### SOLVING DATABASE QUERIES USING ORTHOGONAL RANGE SEARCHING

SOLVING DATABASE QUERIES USING ORTHOGONAL RANGE SEARCHING CPS234: Computational Geometry Prof. Pankaj Agarwal Prepared by: Khalid Al Issa (khalid@cs.duke.edu) Fall 2005 BACKGROUND : RANGE SEARCHING, a

### Performance of KDB-Trees with Query-Based Splitting*

Performance of KDB-Trees with Query-Based Splitting* Yves Lépouchard Ratko Orlandic John L. Pfaltz Dept. of Computer Science Dept. of Computer Science Dept. of Computer Science University of Virginia Illinois

### Scan-Line Fill. Scan-Line Algorithm. Sort by scan line Fill each span vertex order generated by vertex list

Scan-Line Fill Can also fill by maintaining a data structure of all intersections of polygons with scan lines Sort by scan line Fill each span vertex order generated by vertex list desired order Scan-Line

### Extreme Intersection Points in Arrangements of Lines

Extreme Intersection Points in Arrangements of Lines Rom Pinchasi August 1, 01 Abstract We provide a strengthening of the classical theorem of Erdős [3] saing that n lines in the plane, no two of which

### Divide-and-Conquer. Three main steps : 1. divide; 2. conquer; 3. merge.

Divide-and-Conquer Three main steps : 1. divide; 2. conquer; 3. merge. 1 Let I denote the (sub)problem instance and S be its solution. The divide-and-conquer strategy can be described as follows. Procedure

### Validity Measure of Cluster Based On the Intra-Cluster and Inter-Cluster Distance

International Journal of Electronics and Computer Science Engineering 2486 Available Online at www.ijecse.org ISSN- 2277-1956 Validity Measure of Cluster Based On the Intra-Cluster and Inter-Cluster Distance

### Analysis of Approximation Algorithms for k-set Cover using Factor-Revealing Linear Programs

Analysis of Approximation Algorithms for k-set Cover using Factor-Revealing Linear Programs Stavros Athanassopoulos, Ioannis Caragiannis, and Christos Kaklamanis Research Academic Computer Technology Institute

### Geometric Algorithms for Optimal Airspace Design and Air Traffic Controller Workload Balancing

Geometric Algorithms for Optimal Airspace Design and Air Traffic Controller Workload Balancing AMITABH BASU Carnegie Mellon University JOSEPH S. B. MITCHELL Stony Brook University and GIRISHKUMAR SABHNANI

### Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay

Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay Lecture - 17 Shannon-Fano-Elias Coding and Introduction to Arithmetic Coding

### Localization of touching points for interpolation of discrete circles

Annales Mathematicae et Informaticae 36 (2009) pp. 103 110 http://ami.ektf.hu Localization of touching points for interpolation of discrete circles Roland Kunkli Department of Computer Graphics and Image

### INTRODUCTION TO RENDERING TECHNIQUES

INTRODUCTION TO RENDERING TECHNIQUES 22 Mar. 212 Yanir Kleiman What is 3D Graphics? Why 3D? Draw one frame at a time Model only once X 24 frames per second Color / texture only once 15, frames for a feature

### Conflict-free Chromatic Art Gallery Coverage

Conflict-free Chromatic Art Gallery Coverage Andreas Bärtschi 1 and Subhash Suri 1 Institute of Theoretical Computer Science, ETH Zürich 809 Zürich, Switzerland (andrbaer@student.ethz.ch) Department of

### Current Standard: Mathematical Concepts and Applications Shape, Space, and Measurement- Primary

Shape, Space, and Measurement- Primary A student shall apply concepts of shape, space, and measurement to solve problems involving two- and three-dimensional shapes by demonstrating an understanding of:

### Research Statement. Andrew Suk

Research Statement Andrew Suk 1 Introduction My research interests are combinatorial methods in discrete geometry. In particular, I am interested in extremal problems on geometric objects. My research

### Multimedia Databases. Wolf-Tilo Balke Philipp Wille Institut für Informationssysteme Technische Universität Braunschweig http://www.ifis.cs.tu-bs.

Multimedia Databases Wolf-Tilo Balke Philipp Wille Institut für Informationssysteme Technische Universität Braunschweig http://www.ifis.cs.tu-bs.de 14 Previous Lecture 13 Indexes for Multimedia Data 13.1

### Lecture 10: Regression Trees

Lecture 10: Regression Trees 36-350: Data Mining October 11, 2006 Reading: Textbook, sections 5.2 and 10.5. The next three lectures are going to be about a particular kind of nonlinear predictive model,

### Colored Range Searching on Internal Memory

Colored Range Searching on Internal Memory Haritha Bellam, Saladi Rahul, and Krishnan Rajan Lab for Spatial Informatics, IIIT-Hyderabad, Hyderabad, India Univerity of Minnesota, Minneapolis, MN, USA Abstract.

### 38 GEOMETRIC INTERSECTION

38 GEOMETRIC INTERSECTION David M. Mount INTRODUCTION Detecting whether two geometric objects intersect and computing the region of intersection are fundamental problems in computational geometry. Geometric

### Improved Billboard Clouds for Extreme Model Simplification

Improved Billboard Clouds for Extreme Model Simplification I.-T. Huang, K. L. Novins and B. C. Wünsche Graphics Group, Department of Computer Science, University of Auckland, Private Bag 92019, Auckland,

### Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs

Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs Yong Zhang 1.2, Francis Y.L. Chin 2, and Hing-Fung Ting 2 1 College of Mathematics and Computer Science, Hebei University,

### Intersection of a Line and a Convex. Hull of Points Cloud

Applied Mathematical Sciences, Vol. 7, 213, no. 13, 5139-5149 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/1.12988/ams.213.37372 Intersection of a Line and a Convex Hull of Points Cloud R. P. Koptelov

### Which Space Partitioning Tree to Use for Search?

Which Space Partitioning Tree to Use for Search? P. Ram Georgia Tech. / Skytree, Inc. Atlanta, GA 30308 p.ram@gatech.edu Abstract A. G. Gray Georgia Tech. Atlanta, GA 30308 agray@cc.gatech.edu We consider

### I J F E D C F J B E H H

Global Visibility Jir Bittner Department of Computer Science, Czech Technical University, Karlovo namest 13, 121 35 Praha 2, Czech Republic e{mail: bittner@sgi.felk.cvut.cz Abstract Solving the hidden

### Treemaps with bounded aspect ratio

technische universiteit eindhoven Department of Mathematics and Computer Science Master s Thesis Treemaps with bounded aspect ratio by Vincent van der Weele Supervisor dr. B. Speckmann Eindhoven, July

### Segmentation of building models from dense 3D point-clouds

Segmentation of building models from dense 3D point-clouds Joachim Bauer, Konrad Karner, Konrad Schindler, Andreas Klaus, Christopher Zach VRVis Research Center for Virtual Reality and Visualization, Institute

### Algorithms. 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

### Process Modelling from Insurance Event Log

Process Modelling from Insurance Event Log P.V. Kumaraguru Research scholar, Dr.M.G.R Educational and Research Institute University Chennai- 600 095 India Dr. S.P. Rajagopalan Professor Emeritus, Dr. M.G.R

### Common Core Unit Summary Grades 6 to 8

Common Core Unit Summary Grades 6 to 8 Grade 8: Unit 1: Congruence and Similarity- 8G1-8G5 rotations reflections and translations,( RRT=congruence) understand congruence of 2 d figures after RRT Dilations

### Closest Pair Problem

Closest Pair Problem Given n points in d-dimensions, find two whose mutual distance is smallest. Fundamental problem in many applications as well as a key step in many algorithms. p q A naive algorithm

### Tangencies between families of disjoint regions in the plane

Tangencies between families of disjoint regions in the plane János Pach Andrew Suk Miroslav Treml March 24, 2010 Abstract Let C be a family of n convex bodies in the plane, which can be decomposed into

### Identification of Energy Distribution for Crash Deformational Processes of Road Vehicles

Acta Polytechnica Hungarica Vol. 4, No., 007 Identification of Energy Distribution for Crash Deformational Processes of Road Vehicles István Harmati, Péter Várlaki Department of Chassis and Lightweight

### Cyber Graphics. Abstract. 1. What is cyber graphics? 2. An incrementally modular abstraction hierarchy of shape invariants

Preprint of the Keynote Paper: Tosiyasu L. Kunii, Cyber Graphics, Proceedings of the First International Symposium on Cyber Worlds (CW2002), November 6-8 2002 Tokyo, Japan, in press, IEEE Computer Society

### Collision Detection Algorithms for Motion Planning

Collision Detection Algorithms for Motion Planning P. Jiménez F. Thomas C. Torras This is the sixth chapter of the book: Robot Motion Planning and Control Jean-Paul Laumond (Editor) Laboratoire d Analye

### On the k-path cover problem for cacti

On the k-path cover problem for cacti Zemin Jin and Xueliang Li Center for Combinatorics and LPMC Nankai University Tianjin 300071, P.R. China zeminjin@eyou.com, x.li@eyou.com Abstract In this paper we

### Offline sorting buffers on Line

Offline sorting buffers on Line Rohit Khandekar 1 and Vinayaka Pandit 2 1 University of Waterloo, ON, Canada. email: rkhandekar@gmail.com 2 IBM India Research Lab, New Delhi. email: pvinayak@in.ibm.com

### Computer Graphics. Geometric Modeling. Page 1. Copyright Gotsman, Elber, Barequet, Karni, Sheffer Computer Science - Technion. An Example.

An Example 2 3 4 Outline Objective: Develop methods and algorithms to mathematically model shape of real world objects Categories: Wire-Frame Representation Object is represented as as a set of points

### MCS 563 Spring 2014 Analytic Symbolic Computation Wednesday 9 April. Hilbert Polynomials

Hilbert Polynomials For a monomial ideal, we derive the dimension counting the monomials in the complement, arriving at the notion of the Hilbert polynomial. The first half of the note is derived from

### ENUMERATION OF INTEGRAL TETRAHEDRA

ENUMERATION OF INTEGRAL TETRAHEDRA SASCHA KURZ Abstract. We determine the numbers of integral tetrahedra with diameter d up to isomorphism for all d 1000 via computer enumeration. Therefore we give an

### Arrangements And Duality

Arrangements And Duality 3.1 Introduction 3 Point configurations are tbe most basic structure we study in computational geometry. But what about configurations of more complicated shapes? For example,

### Partitioning and Divide and Conquer Strategies

and Divide and Conquer Strategies Lecture 4 and Strategies Strategies Data partitioning aka domain decomposition Functional decomposition Lecture 4 and Strategies Quiz 4.1 For nuclear reactor simulation,

### Pre-Algebra 2008. Academic Content Standards Grade Eight Ohio. Number, Number Sense and Operations Standard. Number and Number Systems

Academic Content Standards Grade Eight Ohio Pre-Algebra 2008 STANDARDS Number, Number Sense and Operations Standard Number and Number Systems 1. Use scientific notation to express large numbers and small

### Survey On: Nearest Neighbour Search With Keywords In Spatial Databases

Survey On: Nearest Neighbour Search With Keywords In Spatial Databases SayaliBorse 1, Prof. P. M. Chawan 2, Prof. VishwanathChikaraddi 3, Prof. Manish Jansari 4 P.G. Student, Dept. of Computer Engineering&

### Geometric Algorithms. range search quad and kd trees intersection search VLSI rules check. References: Algorithms in C (2nd edition), Chapters 26-27

Geometric Algorithms range search quad and kd trees intersection search VLSI rules check References: Algorithms in C (2nd edition), Chapters 26-27 http://www.cs.princeton.edu/introalgsds/73range http://www.cs.princeton.edu/introalgsds/74intersection

### Proc. First Users Conference of the National Library of Medicine's Visible Human Project, active contours free forms Triangle meshes may be imp

Proc. First Users Conference of the National Library of Medicine's Visible Human Project, 1996 1 Creation of Finite Element Models of Human Body based upon Tissue Classied Voxel Representations M. Muller,

### MATHEMATICAL ENGINEERING TECHNICAL REPORTS. The Best-fit Heuristic for the Rectangular Strip Packing Problem: An Efficient Implementation

MATHEMATICAL ENGINEERING TECHNICAL REPORTS The Best-fit Heuristic for the Rectangular Strip Packing Problem: An Efficient Implementation Shinji IMAHORI, Mutsunori YAGIURA METR 2007 53 September 2007 DEPARTMENT

### Spatio-Temporal Mapping -A Technique for Overview Visualization of Time-Series Datasets-

Progress in NUCLEAR SCIENCE and TECHNOLOGY, Vol. 2, pp.603-608 (2011) ARTICLE Spatio-Temporal Mapping -A Technique for Overview Visualization of Time-Series Datasets- Hiroko Nakamura MIYAMURA 1,*, Sachiko

### A Fast Voxel Traversal Algorithm for Ray Tracing

A Fast Voxel Traversal Algorithm for Ray Tracing John Amanatides Andrew Woo Dept. of Computer Science University of Toronto Toronto, Ontario, Canada M5S 1A4 ABSTRACT A fast and simple voxel traversal algorithm

### ABSTRACT. For example, circle orders are the containment orders of circles (actually disks) in the plane (see [8,9]).

Degrees of Freedom Versus Dimension for Containment Orders Noga Alon 1 Department of Mathematics Tel Aviv University Ramat Aviv 69978, Israel Edward R. Scheinerman 2 Department of Mathematical Sciences

### Spatial Partitioning and Indexing Responsible persons: Claudia Dolci, Dante Salvini, Michael Schrattner, Robert Weibel

Geographic Information Technology Training Alliance (GITTA) presents: Spatial Partitioning and Indexing Responsible persons: Claudia Dolci, Dante Salvini, Michael Schrattner, Robert Weibel Content 1.

### arxiv:1203.1525v1 [math.co] 7 Mar 2012

Constructing subset partition graphs with strong adjacency and end-point count properties Nicolai Hähnle haehnle@math.tu-berlin.de arxiv:1203.1525v1 [math.co] 7 Mar 2012 March 8, 2012 Abstract Kim defined

### University of Illinois at Chicago Office: SEO 521 Department of Mathematics, Statistics, (312) 413-2605 and Computer Science

Andrew Suk Contact Information Research Interests Employment University of Illinois at Chicago Office: SEO 521 Department of Mathematics, Statistics, (312) 413-2605 and Computer Science suk@math.uic.edu

### Four-dimensional Mathematical Data Visualization via Embodied Four-dimensional Space Display System

Original Paper Forma, 26, 11 18, 2011 Four-dimensional Mathematical Data Visualization via Embodied Four-dimensional Space Display System Yukihito Sakai 1,2 and Shuji Hashimoto 3 1 Faculty of Information

### A Non-Linear Schema Theorem for Genetic Algorithms

A Non-Linear Schema Theorem for Genetic Algorithms William A Greene Computer Science Department University of New Orleans New Orleans, LA 70148 bill@csunoedu 504-280-6755 Abstract We generalize Holland

### Computational Geometry. Lecture 1: Introduction and Convex Hulls

Lecture 1: Introduction and convex hulls 1 Geometry: points, lines,... Plane (two-dimensional), R 2 Space (three-dimensional), R 3 Space (higher-dimensional), R d A point in the plane, 3-dimensional space,

### Fast approximation of the maximum area convex. subset for star-shaped polygons

Fast approximation of the maximum area convex subset for star-shaped polygons D. Coeurjolly 1 and J.-M. Chassery 2 1 Laboratoire LIRIS, CNRS FRE 2672 Université Claude Bernard Lyon 1, 43, Bd du 11 novembre

### root node level: internal node edge leaf node CS@VT Data Structures & Algorithms 2000-2009 McQuain

inary Trees 1 A binary tree is either empty, or it consists of a node called the root together with two binary trees called the left subtree and the right subtree of the root, which are disjoint from each

### Fast Sequential Summation Algorithms Using Augmented Data Structures

Fast Sequential Summation Algorithms Using Augmented Data Structures Vadim Stadnik vadim.stadnik@gmail.com Abstract This paper provides an introduction to the design of augmented data structures that offer

### Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry

Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry Subhash Suri Department of Computer Science University of California Santa Barbara, USA 956 suri@cs.ucsb.edu Elias Vicari and

### Anchored Rectangle and Square Packings

Anchored Rectangle and Square Packings Kevin Balas 1, Adrian Dumitrescu 2, and Csaba D. Tóth 3 1 Department of Mathematics, California State University Northridge, Los Angeles, USA; and Mathematics Department,

### arxiv:1112.0829v1 [math.pr] 5 Dec 2011

How Not to Win a Million Dollars: A Counterexample to a Conjecture of L. Breiman Thomas P. Hayes arxiv:1112.0829v1 [math.pr] 5 Dec 2011 Abstract Consider a gambling game in which we are allowed to repeatedly

### Small Maximal Independent Sets and Faster Exact Graph Coloring

Small Maximal Independent Sets and Faster Exact Graph Coloring David Eppstein Univ. of California, Irvine Dept. of Information and Computer Science The Exact Graph Coloring Problem: Given an undirected

### John F. Cotton College of Architecture & Environmental Design California Polytechnic State University San Luis Obispo, California JOHN F.

SO L I DMO D E L I N GAS A TO O LFO RCO N S T RU C T I N SO G LA REN V E LO PE S by John F. Cotton College of Architecture & Environmental Design California Polytechnic State University San Luis Obispo,

### Data Structures for Moving Objects

Data Structures for Moving Objects Pankaj K. Agarwal Department of Computer Science Duke University Geometric Data Structures S: Set of geometric objects Points, segments, polygons Ask several queries

### A FIBONACCI TILING OF THE PLANE

A FIBONACCI TILING OF THE PLANE Charles W. Huegy Polygonics, 2 Mann St., Irvine, CA 92612-2709 Douglas B. West University of Illinois, Urbana, IL 61801-2975, west@math.uiuc.edu Abstract. We describe a

### New York State Student Learning Objective: Regents Geometry

New York State Student Learning Objective: Regents Geometry All SLOs MUST include the following basic components: Population These are the students assigned to the course section(s) in this SLO all students

### Dynamic 3-sided Planar Range Queries with Expected Doubly Logarithmic Time

Dynamic 3-sided Planar Range Queries with Expected Doubly Logarithmic Time Gerth Stølting Brodal 1, Alexis C. Kaporis 2, Spyros Sioutas 3, Konstantinos Tsakalidis 1, Kostas Tsichlas 4 1 MADALGO, Department

Load Balancing Backtracking, branch & bound and alpha-beta pruning: how to assign work to idle processes without much communication? Additionally for alpha-beta pruning: implementing the young-brothers-wait

### Computer Graphics CS 543 Lecture 12 (Part 1) Curves. Prof Emmanuel Agu. Computer Science Dept. Worcester Polytechnic Institute (WPI)

Computer Graphics CS 54 Lecture 1 (Part 1) Curves Prof Emmanuel Agu Computer Science Dept. Worcester Polytechnic Institute (WPI) So Far Dealt with straight lines and flat surfaces Real world objects include

### ON FIBER DIAMETERS OF CONTINUOUS MAPS

ON FIBER DIAMETERS OF CONTINUOUS MAPS PETER S. LANDWEBER, EMANUEL A. LAZAR, AND NEEL PATEL Abstract. We present a surprisingly short proof that for any continuous map f : R n R m, if n > m, then there

### Algorithms for Fat Objects: Decompositions and Applications. Christopher Miles Gray

Algorithms for Fat Objects: Decompositions and Applications Christopher Miles Gray Algorithms for Fat Objects: Decompositions and Applications PROEFSCHRIFT ter verkrijging van de graad van doctor aan

### Volume matching with application in medical treatment planning

Volume matching with application in medical treatment planning Yam Ki Cheung and Ovidiu Daescu and Steven Kirtzic and Lech Papiez Department of Computer Science The University of Texas at Dallas Richardson,

### VRSPATIAL: DESIGNING SPATIAL MECHANISMS USING VIRTUAL REALITY

Proceedings of DETC 02 ASME 2002 Design Technical Conferences and Computers and Information in Conference Montreal, Canada, September 29-October 2, 2002 DETC2002/ MECH-34377 VRSPATIAL: DESIGNING SPATIAL

### PROVABLY GOOD PARTITIONING AND LOAD BALANCING ALGORITHMS FOR PARALLEL ADAPTIVE N-BODY SIMULATION

SIAM J. SCI. COMPUT. c 1998 Society for Industrial and Applied Mathematics Vol. 19, No. 2, pp. 635 656, March 1998 019 PROVABLY GOOD PARTITIONING AND LOAD BALANCING ALGORITHMS FOR PARALLEL ADAPTIVE N-BODY