Polygon decomposition for efficient construction of Minkowski sums

This publication has 19 references indexed in Scilit:

• ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS
  International Journal of Computational Geometry & Applications, 2002
• A General Framework for Assembly Planning: The Motion Space Approach
  Algorithmica, 2000
• Polygon Decomposition
  Published by Elsevier ,2000
• Offsets, sweeps, and Minkowski sums
  Computer-Aided Design, 1999
• Polynomial/Rational Approximation of Minkowski Sum Boundary Curves
  Graphical Models and Image Processing, 1998
• Davenport–Schinzel Sequences and Their Geometric Applications (Micha Sharir and Pankaj K. Agarwal)
  SIAM Review, 1996
• COMPUTING MINKOWSKI SUMS OF PLANE CURVES
  International Journal of Computational Geometry & Applications, 1995
• Approximating the minimum weight steiner triangulation
  Discrete & Computational Geometry, 1994
• Generation of configuration space obstacles: The case of moving algebraic curves
  Algorithmica, 1989
• Decomposing a Polygon into Simpler Components
  SIAM Journal on Computing, 1985