|November 24th, 2016, 05:05 AM||#1|
Joined: Nov 2016
Minkowski Sum Algorithm
I am trying to program the following algorithm to calculate the Minkowski sum of two convex polygons:
(Taken from Computational Geometry Algorithms and Applications (ISBN 978-3-540-77974-2) (Year 2008, Page 295))
It already works for simple polygons, but when I have something like this the condition to end the loop is never reached. The thing is, beta (2*PI) is always bigger than every angle of the w-Polygon. So according to the algorithm, only j gets increased in every iteration (i can never reach n+1).
I could assume that beta is 0, but then alpha will always be the biggest angle and the loop's end condition will never be reached too.
What I am I missing?
Last edited by skipjack; December 30th, 2016 at 10:29 AM.
|algorithm, minkowski, sum|
|Thread||Thread Starter||Forum||Replies||Last Post|
|Minkowski's theorem||lotte||Number Theory||0||July 28th, 2010 05:29 AM|
|Minkowski addition||Rajee||Computer Science||1||December 1st, 2009 06:37 AM|
|Minkowski addition||Rajee||Complex Analysis||0||December 1st, 2009 01:48 AM|
|The Minkowski Bound...||TTB3||Abstract Algebra||0||March 10th, 2009 05:25 AM|
|The Minkowski Bound...||TTB3||Number Theory||0||January 1st, 1970 12:00 AM|