Closed

Polygon detection library for C++

This project was awarded to vladgrinko for $251 USD.

Get free quotes for a project like this
Employer working
Awarded to:
Project Budget
$250 - $750 USD
Total Bids
11
Project Description

Hi everybody,
I need someone to implement a c++ library for polygon detection from a [url removed, login to view] like the algorithm in the paper below.
[url removed, login to view]

This library should take a list of line segments and a point as input
and as output
-it should give back a polygon where the point resides in
-island polygons to exclude
-All lose line segments which are not a part of any polygons
Acceptable complexity is around O(n) or some variety of it (e.g O(n) + nlogn etc)
O(n2) and worse is not acceptable

Please have a look at the drawing attached and read the rest

INPUT:
Line Segments List(AB,EF,AG,CD,HI,JK,KL,ML,MN)
Point pt1 (x,y)

OUTPUT
Included Polygon:points H,J,K,L,M,N,2,I (as a list)
Excluded Polygons (island(s)):points 4,5,6,7 (as a list)
and if there are more excluded polygons they should be the part of outputs

Loose Line Segments List (E1,G1,D2,2F,3C,3B)

Looking to make some money?

  • Set your budget and the timeframe
  • Outline your proposal
  • Get paid for your work

Hire Freelancers who also bid on this project

    • Forbes
    • The New York Times
    • Time
    • Wall Street Journal
    • Times Online