Binary Space Partition Trees
Anthony Steed, Yiorgos Chrysanthou 1999-2003
1
Overview
Previous list priority algorithms fail in
a number of cases non of them is
completely general
BSP tree is a general solution, but
with its own problems
Tree size
Tree

Voronoi Diagram
Subhas C. Nandy
Advanced Computing and Microelectronics Unit
Indian Statistical Institute
Kolkata 700108
Viewpoint 1: Locate the nearest dentist.
Viewpoint 2: Find the service area of potential customers for each dentist.
Voronoi Diagram
F

On the Agenda
The Art Gallery Problem
Polygon Triangulation
Computational Geometry
Chapter 3
Polygons and Triangulation
13.
23.
Art Gallery Problem
Given a simple polygon P, say
that two points p and q can see
each other if the open segment pq
lies entire

Introduction
Smallest enclosing circle algorithm
Randomized incremental construction
Smallest enclosing circles and more
Computational Geometry
Lecture 6: Smallest enclosing circles and more
Computational Geometry
Lecture 6: Smallest enclosing circles and

Voronoi Diagrams
A city builds a set of post ofces, and now needs to determine which houses will be
served by which ofce. It would be wasteful for a postman to go out of their way to make
a delivery if another post ofce is closer. What is the right way to

The painters algorithm
It was mentioned earlier that sorting algorithms were useful in computer
graphics. If we have a number of polygons to display we must make sure
that those nearest to the viewpoint obscure those which are further away.
Unit 6: BSP Tr