Algorithm for ordering vertices of a polygon

Article View: comp.os.msdos.programmer

Article #1262

Back to comp.os.msdos.programmer Previous Next

#1262

From: Gilbert Leung
Date: Thu, 03 Sep 1992 19:42

10 lines
911 bytes

	I have a polygon with known vertices, but these points are
arranged in random order.  I need an algorithm to put these points
in an order such that I can trace the perimeter of this polygon.
Note that this arbitrary polygon can be concave and weird-shaped,
but it is simple enough that there is only ONE way to connect all
these points to form a polygon.

	Any help would be greatly appreciated.  Thanks in advance.

Gilbert

Technical Details

Message-ID: <1992Sep3.194209.10620@athena.mit.edu>

Path: arc1-ca.pugleaf.net!sparky!uunet!snorkelwacker.mit.edu!bloom-picayune.mit.edu!athena.mit.edu!gleung

Show Full Headers

Complete Article Headers

Newsgroups: comp.os.msdos.programmer
Path: arc1-ca.pugleaf.net!sparky!uunet!snorkelwacker.mit.edu!bloom-picayune.mit.edu!athena.mit.edu!gleung
From: gleung@athena.mit.edu (Gilbert Leung)
Subject: Algorithm for ordering vertices of a polygon
Message-ID: <1992Sep3.194209.10620@athena.mit.edu>
Keywords: polygon
Sender: news@athena.mit.edu (News system)
Nntp-Posting-Host: eckbo.mit.edu
Organization: Massachusetts Institute of Technology
Date: Thu, 3 Sep 1992 19:42:09 GMT
Lines: 11