Reorder polygon vertex array

I have an array of vertices from a polygon in random order. I need some kind of algorithm to reorder them so that they start from upper left and go clockwise
steenpatAsked:
Who is Participating?
I wear a lot of hats...

"The solutions and answers provided on Experts Exchange have been extremely helpful to me over the last few years. I wear a lot of hats - Developer, Database Administrator, Help Desk, etc., so I know a lot of things but not a lot about one thing. Experts Exchange gives me answers from people who do know a lot about one thing, in a easy to use platform." -Todd S.

rstaveleyCommented:
Homework?

If (0,0) is the centre and you have (-1,0) and (0,1), which would you say should come first?
0
rstaveleyCommented:
Clue: If you want to figure out the neighbours for a vertex, do you simply want to figure out the least acute (i.e. largest) angle that it makes with two other vertices?
0
steenpatAuthor Commented:
ignore deletion.
no this is not 'homework'.

Clue: If you want to figure out the neighbours for a vertex, do you simply want to figure out the least acute (i.e. largest) angle that it makes with two other vertices?

This won't work all the time if you have a concave or convex object for instance.
0
Get expert help—faster!

Need expert help—fast? Use the Help Bell for personalized assistance getting answers to your important questions.

steenpatAuthor Commented:
ignore deletion.
0
steenpatAuthor Commented:
ignore deletion.
0
ozoCommented:
If you have
(0,0) (1,1) (1,-1) (-1,1) (-1,-1)
what order would you want the vertices to be in?
0
steenpatAuthor Commented:
ozo:
start from upper left top most and go clockwise.
0
steenpatAuthor Commented:
so, that would be -1,1. this object will work fine if you use the least acute angle method, if for instance you make a hollow "C" shape object then it doesnt work anymore because you have pts that have lower angles which shouldnt come next in the list.
0
ozoCommented:
so (-1,1)(1,1)(1,-1)(-1,-1)
where do we put (0,0)?
0
rstaveleyCommented:
Assuming (0,0) is the origin in the middle, (-1,0) is as "left" as (0,1) is "top", so which do you decide is the most "top left"?
0
steenpatAuthor Commented:
look I have already have code that will grab the same corner pt every time. so.. dont worry about that.
I just need a way of reordering the pts for objects like described above.i dont really feel like repeating myself several times, so i'll say it again, the least acute angle method will not work for these types of objects.
0
ozoCommented:
please describe where in the order the (0,0) point would belong.
Do you want to maximize the area of the polygon?
Do you want to minimize the perimeter of the polygon?
So you want it to be starshaped from its centroid?
0
rstaveleyCommented:
I'm fed up with repeating my question too. <resign>
0
ozoCommented:
(1,1) (1,-1) (-1,1) (-1,-1)
(2,2) (2,-2) (-2,2) (-2,-2)
could be
(-2,2) (2,2) (1,1) (1,-1) (2,-2) (-2,-2) (-1,-1) (-1,1)
or
(-2,2) (-1,1) (1,1) (2,2) (2,-2) (1,-1) (-1,-1) (-2,-1)
or
(-2,2) (2,2) (2,-2) (-2,2) (-1,-1) (1,-1) (1,1) (-1, 1)
or
(-2,2) (2,2) (2,-2) (1,-1) (1,1) (-1,1) (-1,-1) (-2,-2)
or
(-2,2) (2,2) (1,1) (-1,1) (-1,-1) (1,-1) (2,-2) (-2,-2)
or
(-2,2) (-1,1) (-1,-1) (1,-1) (1,1) (2,2) (2,-2) (-2,-2)
among others
How do you want to decide among them?
One way could be to prefer polygons with a shorter perimeter, which you can do
by solving the Traveling Salesman problem.
This could take a long time if you have a lot of points, but if near-optimal solution is good enough, you might use the
 Christofides heuristic and start with a minimal spanning tree and convert it to a simple polygon by skipping nodes.
0

Experts Exchange Solution brought to you by

Your issues matter to us.

Facing a tech roadblock? Get the help and guidance you need from experienced professionals who care. Ask your question anytime, anywhere, with no hassle.

Start your 7-day free trial
steenpatAuthor Commented:
Ozo: I see what you're saying. in my case actually the vertices are in an order, but not in the same starting order everytime. i guess i misphrased this question when i said random order because i was in a hurry. i think all i need to do is to find the topmost, leftmost pt and then shuffle the array so they start with that pt and thats it...
0
It's more than this solution.Get answers and train to solve all your tech problems - anytime, anywhere.Try it for free Edge Out The Competitionfor your dream job with proven skills and certifications.Get started today Stand Outas the employee with proven skills.Start learning today for free Move Your Career Forwardwith certification training in the latest technologies.Start your trial today
Algorithms

From novice to tech pro — start learning today.

Question has a verified solution.

Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.

Have a better answer? Share it in a comment.