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	Have you seen an implemetation or a other mentions of such algorithm ? If the minimum enclosed quad of a convex polygon share some edges with the initial polygon that should simplify greatly the work and allow for a brute force approach that would test the cost ( in term of area ) deleting various edges ofthe convex hull. Otherwise, well I don't know how to approach the problem. My gut feelings says to fiddle around with voronoi diagrams and eventually delaunay triangulation ... but that might be a dead end. [url=http://www.p01.org/][sigrotate][img]http://poi.ribbon.free.fr/files/p01_ozoneasylum_sig_love.gif[/img]\|[img]http://poi.ribbon.free.fr/files/p01_ozoneasylum_sig_love_small.gif[/img]\|[img]http://poi.ribbon.free.fr/files/p01_ozoneasylum_sig_charly.gif[/img]\|[img]http://poi.ribbon.free.fr/files/p01_ozoneasylum_sig_dk.gif[/img]\|[img]http://poi.ribbon.free.fr/files/p01_ozoneasylum_sig_reason.gif[/img]\|[img]http://poi.ribbon.free.fr/files/p01_ozoneasylum_sig_galaxy.gif[/img][/sigrotate][/url] Loading...
Options:	Enable Slimies Enable Linkwords

Edit Post