Smallest Quadrilateral around polygon — OZONE Asylum, home of the Mad Scientists

This page's ID: 28569

Edit Post

Who can edit a post?	The poster and administrators may edit a post. The poster can only edit it for a short while after the initial post.

Your User Name:
Your Password:
Login Options:	Remember Me On This Computer

Your Text: Insert Slimies » Insert UBB Code » Close Last Tag \| All Tags UBB Help	Hello, I'm looking for an algorithm to find the smallest 4 sided polygon ( ie. a quadrilateral ) around a given (convex) polygon. I'm specifically not looking for the [url=http://cgm.cs.mcgill.ca/~orm/maer.html]minimum enclosing rectangle[/url]. I'm pretty certain there is an algorithmus somewhere out there, at least the paper I'm working with says "Finally the smalest 4-sided polygon surrounding the segmented code is evaluated [segmented code in question is a convex polygon]. This is a special case of convex hull evaluation, in which the hull is constrained to have exactly four sides. The output consists in a list of four points which are vertices of a general polygon surrounding the code", alas it seems I'm using all the wrong words for google ( again :( ) Thanks for your input, so long, ->Tyberius Prime Loading...
Options:	Enable Slimies Enable Linkwords

Edit Post