Lecture topic-BruteForce

# Formally a geometric figure is formally convex if

This preview shows page 1. Sign up to view the full content.

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: allest convex polygon enclosing smallest n points on the plane • Convex: – A geometric figure with no geometric convex indentations. – Formally, a geometric figure is Formally, convex if every line segment line connecting interior points is entirely interior points contained within the figure's Non­convex interior. interior. Design and Analysis of Algorithms – Chapter 3 37 Example: Convex Hull Example: Input: p1,p2,p3,p4,p5,p6,p7,p8,p9,p10,p11 p9 Output: p2,p9,p11,p4,p5,p6,p8,p2 p11 p4 p1 p2 p3 p7 p8 p10 p6 p5 Convex hull: application domain* Convex a Computer visualization, ray tracing • (e.g. video games, replacement of bounding boxes) a Path finding • (e.g. embedded AI of Mars mission rovers) a Geographical Information Systems (GIS) • (e.g. computing accessibility maps) a Visual pattern matching • (e.g. detecting car license plates) a Verification methods • (e.g. bounding of Number Decision Diagrams) a Geometry • (e.g. diameter computation) *slide refer to http://www.montefiore.ulg.ac.be/~briquet/algo3-chullhttp://www.montefiore.ulg.ac.be/~briquet/algo3-chull*slide 20070206.pdf Design and Analysis of Algorithms – Chapter 3 39 C...
View Full Document

## This note was uploaded on 10/31/2013 for the course RAIK 283 taught by Professor Yinglu during the Fall '12 term at UNL.

Ask a homework question - tutors are online