Point-Line Duality Let

Slides:



Advertisements
Similar presentations
Maximum Flow and Minimum Cut Problems In this handout: Duality theory Upper bounds for maximum flow value Minimum Cut Problem Relationship between Maximum.
Advertisements

Lower Envelopes Yuval Suede. What’s on the menu? Lower Envelopes Davenport-Schinzel Sequences Trivial upper bound Super linear complexity* Tight upper.
1 LP Duality Lecture 13: Feb Min-Max Theorems In bipartite graph, Maximum matching = Minimum Vertex Cover In every graph, Maximum Flow = Minimum.
Problems in curves and surfaces M. Ramanathan Problems in curves and surfaces.
Approximations of points and polygonal chains
Advanced Topics in Algorithms and Data Structures Lecture 7.2, page 1 Merging two upper hulls Suppose, UH ( S 2 ) has s points given in an array according.
Dynamic Planar Convex Hull Operations in Near- Logarithmic Amortized Time TIMOTHY M. CHAN.
ENGM 732 Formalization of Network Flows Network Flow Models.
Computational Geometry II Brian Chen Rice University Computer Science.
+ Convex Functions, Convex Sets and Quadratic Programs Sivaraman Balakrishnan.
Advanced Topics in Algorithms and Data Structures Lecture 7.1, page 1 An overview of lecture 7 An optimal parallel algorithm for the 2D convex hull problem,
Convex Hulls in 3-space Jason C. Yang.
CHAPTER 5: CONVEX POLYTOPES Anastasiya Yeremenko 1.
6.3 Parallel Plane Facts Objectives: 1.Recognize lines parallel to planes, parallel lines and skew lines 2.Use properties relating parallel planes and.
Computational Geometry -- Voronoi Diagram
17. Computational Geometry Chapter 7 Voronoi Diagrams.
2. Voronoi Diagram 2.1 Definiton Given a finite set S of points in the plane , each point X of  defines a subset S X of S consisting of the points of.
CSCI 3160 Design and Analysis of Algorithms Tutorial 6 Fei Chen.
UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2001 Lecture 4 Chapter 6: Arrangements Monday,
Half-Space Intersections
UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2004 Chapter 5: Voronoi Diagrams Monday, 2/23/04.
Convex Sets (chapter 2 of Convex programming) Keyur Desai Advanced Machine Learning Seminar Michigan State University.
Exploiting Duality (Particularly the dual of SVM) M. Pawan Kumar VISUAL GEOMETRY GROUP.
Lecture 8 : Arrangements and Duality Computational Geometry Prof. Dr. Th. Ottmann 1 Duality and Arrangements Duality between lines and points Computing.
Computational Geometry Piyush Kumar (Lecture 4: Planar Graphs, Polygons and Art Gallery) Welcome to CIS5930.
Chapter 5 Linear Inequalities and Linear Programming Section R Review.
Efficient Partition Trees Jiri Matousek Presented By Benny Schlesinger Omer Tavori 1.
Polyhedral Optimization Lecture 3 – Part 2
Center for Graphics and Geometric Computing, Technion 1 Computational Geometry Chapter 8 Duality.
Line Arrangement Chapter 6. Line Arrangement Problem: Given a set L of n lines in the plane, compute their arrangement which is a planar subdivision.
8.4 Solving Polynomial & Rational Inequalities
Center for Graphics and Geometric Computing, Technion 1 Computational Geometry Chapter 8 Arrangements and Duality.
Comparative Statics and Duality of the Cost Function Lecture VII.
Center for Graphics and Geometric Computing, Technion 1 Computational Geometry Chapter 8 Arrangements and Duality.
Arrangements and Duality Sanjay Sthapit Comp290 10/6/98.
Circles. Equation of a circle: ( x – h )2 )2 + ( y – k )2 )2 = r2r2 Center of the circle: C( h, k ) Radius of the circle: r Diameter of the circle: d.
Arrangements and Duality Motivation: Ray-Tracing Fall 2001, Lecture 9 Presented by Darius Jazayeri 10/4/01.
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 8/19/2008.
3-3 Graphing and Solving Systems of Linear Inequalities Objective: Students will be able to graph a system of inequalities to find the solutions of the.
+ Quadratic Programming and Duality Sivaraman Balakrishnan.
CHAPTER 6 VOCABULARY The region of the graph of an inequality on one side of a boundary. Half-Plane WORD LIST Addition Property of Inequalities Boundary.
Arrangements and Duality Supersampling in Ray Tracing.
Applications of Geometric Programming in Information Security Chris Ware University of Victoria.
UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2010 O’Rourke Chapter 6 with some material.
An Introduction to Computational Geometry: Arrangements and Duality Joseph S. B. Mitchell Stony Brook University Some images from [O’Rourke, Computational.
AHD: Alternate Hierarchical Decomposition Convex decomposition of nonconvex objects into their convex hull components, represented in hierarchical tree.
Do Now from 1.2a Find the domain of the function algebraically and support your answer graphically. Find the range of the function.
Find the lower and upper quartiles for the data set.
CMPS 3130/6130 Computational Geometry Spring 2017
Locate Points on a Coordinate Plane
Proving that a Valid Inequality is Facet-defining
What Are Preservatives And Additives.
The horizontal number line is called the ______. x-axis
RECORD. RECORD A Vector Space: the Definition.
Finding the Area Between Curves
Find a vector equation for the line through the points {image} and {image} {image}
Find a vector equation for the line through the points {image} and {image} {image}
Depth Estimation via Sampling
Parallel Lines & Angle Relationships
10:00.
Efficient Algorithms for the Weighted k-Center Problem on a Real Line
Field.
AREA Section 4.2.
Computational Geometry
Proving that a Valid Inequality is Facet-defining
TBF Generall Mathematics - II Lecture – 8 : Linear Inequalities
AREA Section 4.2.
Parallel Computational Geometry
Convex Hull - most ubiquitous structure in computational geometry
Presentation transcript:

Point-Line Duality Let 𝑃= 𝑝 1 ,…, 𝑝 𝑛 ⊆ℝ be a set of 𝑛 points. Now define a set 𝑃 ∗ = 𝑝 1 ∗ ,…, 𝑝 𝑛 ∗ of 𝑛 lines as follows: Primal plane Point: 𝑝=( 𝑝 𝑥 , 𝑝 𝑦 ) Line: 𝑙:𝑦=𝑚𝑥+𝑏 Dual plane Line: 𝑝 ∗ :𝑦= 𝑝 𝑥 𝑥 − 𝑝 𝑦 Point: 𝑙 ∗ =(𝑚, −𝑏) p*1 l2 l1 p3 p*2 l*1 p4 p1 l*2 p2 p*3 p*4

Properties: Dual Primal p*1 l2 l1 p3 p*2 l*1 p4 p1 l*2 p2 p*3 p*4 𝑝 ∗ ∗ =𝑝 𝑝∈𝑙 ⇔ 𝑙 ∗ ∈ 𝑝 ∗ incidence-preserving 𝑝 lies above 𝑙 ⇔ 𝑙 ∗ lies above 𝑝 ∗ p1 l2  l*2 p*1 p3 is above l1  l*1 is above p*3

Properties: Primal Dual p*1 l1 l*1 p1 p*2 p2

LCH  UE Primal Dual p*2 p*1 p*3 p*4 p1 p5 p2 p4 p3 p*5 LCH lower convex hull UE upper envelope (= pointwise maximum) halfplane intersection (of upper halfplanes) LCH = p1, p2, p3, p4, p5 UE = p*1, p*2, p*3, p*4, p*5