# Orthogonal Polygonization

• Jan 14th 2013, 03:20 PM
aelalaily
Orthogonal Polygonization
I am to implement an algorithm that orthogonally polygonize a set of points with the minimum number of vertices, in other words, given a set of points, the algorithm should find an orthogonal path passing through all of the points with the least number of possible vertices.

Any help here would be much appreciated!
• Jan 14th 2013, 06:56 PM
chiro
Re: Orthogonal Polygonization
Hey aelalaily.

What exactly do you mean by an orthogonal path? Are you simply trying to fit a function to a set of points using orthogonal polynomials?
• Jan 15th 2013, 03:16 AM
aelalaily
Re: Orthogonal Polygonization
I have a set of points, I want to draw a closed polygon in such a way that it passes by every point in that set, and that forms an orthogonal polygon.
So in essence a computational geometric problem where the objective is obtaining an orthogonal polygon passing by every point in a given set.

edit: I just realized it is posted in the wrong section of the forum. It should be in the Advanced Math Topics. My bad!