Polygon Division
- From: webwolve <webwolve@xxxxxxxxx>
- Date: Mon, 20 Feb 2006 11:17:04 EST
Excuse me if this is not the best place to post this question.
My issue is this. I'm developing a C++ Engineering application in which I need a function that takes a simple polygon (a piece of cut wood) consisting of 4 to 6 bounding points and is split perfectly down the middle (horizontally) to create 2 new polygons. I need to graphically represent the bottom half differently than the top half, so I need both polygons.
Points of Polygon could be (0,0), (0,25), (100,100), (400,100), (500, 25), (500, 0).
I want a method that would split this right in half at the y=50 line, and give me 2 new polygons in return.
The polygon will always have top and bottom parallel lines which can be used to determine the intersection line...aka a horizontal piece of 2x4 wood.
Any help would be appreciated.
Thanks!
.
- Follow-Ups:
- Re: Polygon Division
- From: Fernando Cacciola
- Re: Polygon Division
- Prev by Date: Re: Union of disks forms a sphere
- Next by Date: Amal-game
- Previous by thread: Call for Papers: IMECS 2006 (the multiconference of 14 engineering & scientific computing conferences)
- Next by thread: Re: Polygon Division
- Index(es):
Relevant Pages
|