XX-Computational-Geometry

XX-Computational-Geometry - Introduction to Algorithms...

Info iconThis preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon
Introduction to Algorithms 6.046J/18.401J/SMA5503 Lecture 12 Prof. Erik Demaine
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Introdu October 24, 2001 © 2001 by Erik D. Demaine Computational geometry Algorithms for solving “geometric problems” in 2D and higher. Fundamental objects: point line segment line Basic structures: polygon point set
Background image of page 2
Introdu October 24, 2001 © 2001 by Erik D. Demaine Computational geometry Algorithms for solving “geometric problems” in 2D and higher. Fundamental objects: point line segment line Basic structures: convex hull triangulation
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Introdu October 24, 2001 © 2001 by Erik D. Demaine Orthogonal range searching Input: n points in d dimensions E.g., representing a database of n records each with d numeric fields Query: Axis-aligned box (in 2D, a rectangle) Report on the points inside the box: Are there any points? How many are there? List the points.
Background image of page 4
Introdu October 24, 2001 © 2001 by Erik D. Demaine Orthogonal range searching Input: n points in d dimensions Query: Axis-aligned box (in 2D, a rectangle) Report on the points inside the box Goal: Preprocess points into a data structure to support fast queries Primary goal: Static data structure In 1D, we will also obtain a dynamic data structure supporting insert and delete
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Introdu October 24, 2001 © 2001 by Erik D. Demaine 1D range searching In 1D, the query is an interval: First solution using ideas we know: Interval trees Represent each point x by the interval [ x , x ] . Obtain a dynamic structure that can list k answers in a query in O( k lg n ) time.
Background image of page 6
Introdu October 24, 2001 © 2001 by Erik D. Demaine 1D range searching In 1D, the query is an interval: Second solution using ideas we know: Sort the points and store them in an array Solve query by binary search on endpoints.
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 8
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/29/2011 for the course IT 201 taught by Professor K.v.arya during the Spring '11 term at IIT Kanpur.

Page1 / 28

XX-Computational-Geometry - Introduction to Algorithms...

This preview shows document pages 1 - 8. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online