Okay, I think I found my solution conceptually...but coding it is the
tricky part.
I have a drawing, 2d, of a "box." Not a geometric box but a "box" that
will be built which may not be of uniform size
D ___ ______ C
| |____| |
| |
| ____| B
A |________|
Thats just an example. So what I do is grab my four bounding points.
Bottom left is the point with the smallest x with smallest y. Bottom
right is point with largest x with smallest y. Top right is largest x
with largest y. Top left is largest y with smallest x.
Now to get the bottom perimeter I need to sort my points between A nd B
where X is stil increasing up to that point. Then B to C where Y is
increasing, then C to D where X is decreasing then whats left over in Y
descending order. We will be using an AutoCAD program that will draw a
line between each point (not just A,B,C,D but all points). So if I can
sort in this counter clockwise order then I have a vector where I draw
a lin from Ai to Ai+1. The trick is how to code? Any suggestions,
data structures etc?
Thanks! Have fun!
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
