Loading presentation...

Present Remotely

Send the link below via email or IM


Present to your audience

Start remote presentation

  • Invited audience members will follow you as you navigate and present
  • People invited to a presentation do not need a Prezi account
  • This link expires 10 minutes after you close the presentation
  • A maximum of 30 users can follow your presentation
  • Learn more about this feature in our knowledge base article

Do you really want to delete this prezi?

Neither you, nor the coeditors you shared it with will be able to recover it again.


Inducing n-gon of an arrangement of lines

L. Scharf & M.Scherfenberg

hadi banaee

on 30 August 2010

Comments (0)

Please log in to add your comment.

Report abuse

Transcript of Inducing n-gon of an arrangement of lines

Inducing n-gon of an arrangement of lines NO Yes NO YES NO NO YES YES case 1 case 3 case 6 case 2 case 4 case 5 case 7 Algorithm Authors:
L. Scharf & M. Scherfenberg
EuroCG'09 - Brussels, Belgium Presented by:
Hadi Banaee
Department of Computer Science,
Amirkabir University.
Dec 2009 Introduction History Initialization Every simple polygon induces an arrangement of lines, simply by extending its edges. Every arrangement of lines in the plane has an inducing polygon?? Lines that all intersect in one point and lines that form a 3×2 parallel grid serve as examples of such arrangements. When the lines of an arrangement are in general position, an inducing polygon with n edges exists and can be found in O(n^2) time. Bose et al. present an algorithm for constructing an inducing simple n-path in O(n^2) time.
That polyline can be extended to an inducing n-gon if there exists a line such that all intersection points of the arrangement lie on one side of that line.
If the polygon is allowed to have more than one edge collinear to some line, proved that an inducing polygon of size O(n) always exists and can be constructed in O(n^2) time. notations cases
Full transcript