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	I believe this paper would have what I need @article{acy-macp-85 , author = "A. Aggarwal and J. S. Chang and C. K. Yap" , title = "Minimum area circumscribing polygons" , journal = "Visual Comput." , volume = 1 , year = 1985 , pages = "112--117" , keywords = "extremal figures, polygons" } But I'm not going to shell out 30 euros just to check. Instead I've deceided to fake it. I can easily find out which are the two vertices closest to my original 'bar intersection point'. Then I'll simply get the next vertices for each one, and elongate that till they meet. It should work just as well, since they will be already parallel to the alternating borders after region growing * convex hull computation, just not long enough. Thanks and so long, ->Tyberius Prime Loading...
Options:	Enable Slimies Enable Linkwords

Edit Post