Skip to main content
Article thumbnail
Location of Repository

Dynamic Minkowski sum of convex shapes

By Evan Behar and Jyh-ming Lien

Abstract

Computing the Minkowski sums of rotating objects has always been done naïvely by re-computing every Minkowski sum from scratch. The correspondences between the Minkowski sums are typically completely ignored. We propose a method, called DYMSUM, that can efficiently update the Minkowski sums of rotating convex polyhedra. We show that DYMSUM is significantly more efficient than the traditional approach, in particular when the size of the input polyhedra are large and when the rotation is small between frames. From our experimental results, we show that the computation time of the proposed method grows slowly with respect to the size of the input comparing to the naïve approach. (a) ellipse (b) slightly rotated ellips

Year: 2011
OAI identifier: oai:CiteSeerX.psu:10.1.1.353.2130
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://cs.gmu.edu/~tr-admin/pa... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.