Path: utzoo!utgpu!news-server.csri.toronto.edu!mailrus!cs.utexas.edu!tut.cis.ohio-state.edu!rutgers!orstcs!ure.CS.ORST.EDU!tubbsk
From: tubbsk@ure.CS.ORST.EDU (Ken Tubbs)
Newsgroups: comp.graphics
Subject: Polygon approximation
Message-ID: <19631@orstcs.CS.ORST.EDU>
Date: 1 Aug 90 22:31:38 GMT
Sender: usenet@orstcs.CS.ORST.EDU
Reply-To: tubbsk@ure.CS.ORST.EDU (Ken Tubbs)
Distribution: usa
Organization: Oregon State Univ. - CS - Corvallis, OR
Lines: 15

I am looking for information/algorithms/code for polygon approximation.
Specifically, given a list of points which represent a 2D region I would
like to find a polygonal approximation to this region using a minimum
number of vertices.  Has any one done this and would you be willing to
share your code?  I have implemented the alogrithm in "Algorithms for
Graphics and Image Processing" by Pavlidis but I don't find its
performance to be very good.  (Or I've got bugs!)

Thanks in advance,

Ken Tubbs, Field Applications Engineer
Vision Products Group
Intelledex, Inc.
Internet: tubbsk@cs.orst.edu
UUCP: {tektronix,hp-pcd}!orstcs!tubbsk