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	Well, it needs to be fast, and correct always beats approximate ( though approximate probably would do just as well )... As far as I understand the algorithm, it's pretty 'brute force' already. It exploits the fact, that the minimum k-gon always has (k-1) sides 'flush' with the polygon, and the center of all k-gon sides actually touching the polygon, then calculates all possible 'chains' of 'one side optimal' and 'one side flushed', and their 'extra area', and that calculating is just about where I loose it. I think I've finally grasped why I can't figure out how to calculate this from the paper. It's not actually in there. The paper is just a proof of the O(n^2 * log n * log k ) runtime! Maybe it's still in there, but it's not in 'plain formular' :(. Hyperbole: I'd appricate your help :). Are you on ICQ? Either way, drop me a line ( see my profile for both Q number and (slightly obfuscated ) e-mail address ), and I'll get the paper to you. Thanks to all of you, so long, ->Tyberius Prime Loading...
Options:	Enable Slimies Enable Linkwords

Edit Post