Project Detail

Description

This is a project of Computational Geometry using Visual C++ 6.0 or higher.
Please,bid.only if you have the right experience.
Don’t was my time if you are an expert

No ESCROW OR PREPAYMENT OR PAYPAL PAYMENT

I pay only when I have checked that all runs properly.

After I have payed,you release me source code in Visual C++ 6.0 or higher.


NO USER INTERFACE REQUIRED.

Project description :

1. Given a list of 2d segment lines,defined trough the coordinates of initial and final point.
2. You need to read them from a txt file (see ext1.txt)
3. Each row contains x1,y1,x2,y2 of each segment line.
4. As you can see from fig.1,few segments (example thos blue colored) have the initial or final
that doesn’t intersect any of other segment lines.In these case ,consider the prolongation until they intersect segments line


EXT1.txt containts the input example,so you can use it to check the results.

AIM OF THE PROJECT

The aim of project is to set all the polygons that can be generated from the given segments.
The output is formed from a txt file,in the form

(As convention,Polygon 0 is the Main Polygon,that is the polygon that contains all polygons.
See fig.2 ,Poligon 0 has the followinf vertex : 1,9,4,7,11)


ID Poligon 0
x1,y1,x9,y9
x9,y9,x4,y4
x4,y4,x7,y7
x7,y7,x11,y11
x11,y11,x1,y1


ID Poligon 1
x1,y1,x2,y2
x2,y1,x10,y10
x10,y10,x14,y14
x14,y14,x1,y1

.. and so on..

ID Poligon 2
X13,y13 ,x8,y8
List of vertexs counter clockwise
….

ID Poligon N
xi ,yi ,xj,yj
List of vertexs counter clockwise
….



It not important,the order with the polygons are written in the file.The important is that the first is the MAIN POLYGON.

Since high accurance it is required in output vertex,please use roboust computational geometry algoritms


Additional files submitted:
prj1.pdf
ex1.txt