Lec16 - Proximity Planar triangulations Problem...

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

View Full Document Right Arrow Icon
Problem definitions, 1 TRIANGULATION INSTANCE: Set S = { p 1 , p 2 , . .., p N } of N points in the plane. QUESTION: Join the points in S with nonintersecting straight line segments so that every region internal to the convex hull of S is a triangle. Proximity Planar triangulations A triangulation for a set S is not necessarily unique. As a planar graph, a triangulation on N vertices has 3 N - 6 edges.
Background image of page 1

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

View Full DocumentRight Arrow Icon
Problem definitions, 2 CONSTRAINED TRIANGULATION INSTANCE: Set S = { p 1 , p 2 , . .., p N } of N points in the plane, and set E = { { p i , p j }, … } of nonintersecting edges on S . QUESTION: Join the points in S with nonintersecting straight line segments so that every region internal to the convex hull of S is a triangle and every edge of E is in the triangulation. Proximity Planar triangulations
Background image of page 2
Problem definitions, 3 POLYGON TRIANGULATION INSTANCE: Polygon P = { p 1 , p 2 , . .., p N } of N points in the plane. QUESTION:
Background image of page 3

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

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

This note was uploaded on 07/14/2011 for the course COT 5520 taught by Professor Mukherjee during the Summer '11 term at University of Central Florida.

Page1 / 6

Lec16 - Proximity Planar triangulations Problem...

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

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