My Math Forum  

Go Back   My Math Forum > High School Math Forum > Geometry

Geometry Geometry Math Forum

LinkBack Thread Tools Display Modes
November 24th, 2016, 05:05 AM   #1
Joined: Nov 2016
From: Germany

Posts: 1
Thanks: 0

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.
petermeter is offline  
December 30th, 2016, 10:29 AM   #2
Global Moderator
Joined: Dec 2006

Posts: 18,568
Thanks: 1483

Do you still need help on this?
skipjack is offline  

  My Math Forum > High School Math Forum > Geometry

algorithm, minkowski, sum

Thread Tools
Display Modes

Similar Threads
Thread Thread Starter Forum Replies Last Post
Minkowski's theorem lotte Number Theory 0 July 28th, 2010 06: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 06:25 AM
The Minkowski Bound... TTB3 Number Theory 0 December 31st, 1969 04:00 PM

Copyright © 2018 My Math Forum. All rights reserved.