Polygon Decomposition for Efficient Construction of Minkowski Sums-Reference-Cited by-同舟云学术

Polygon Decomposition for Efficient Construction of Minkowski Sums

Published:2000 Issue: Volume: Page:20-31
ISSN:0302-9743
Container-title:Algorithms - ESA 2000
language:
Short-container-title:

Author:

Agarwal Pankaj K.,Flato Eyal,Halperin Dan

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45253-2_3

Reference25 articles.

1. The CGAL User Manual, Version 2.0, 1999. http://www.cs.ruu.nl/CGAL .

2. P. K. Agarwal and M. Sharir. Arrangements. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 49–119. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 1999.

3. M. Bern. Triangulations. In J. E. Goodman and J. O’Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 22, pages 413–428. CRC Press LLC, Boca Raton, FL, 1997.

4. B. Chazelle and D. P. Dobkin. Optimal convex decompositions. In G. T. Toussaint, editor, Computational Geometry, pages 63–133. North-Holland, Amsterdam, Netherlands, 1985.

5. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, 1997.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Dynamic Minkowski sums under scaling;Computer-Aided Design;2013-02

2. Efficient Minkowski Sum Computation of General Ployhedra;Applied Mechanics and Materials;2011-10

3. Optimal positioning of irregular shapes in stamping die strip;The International Journal of Advanced Manufacturing Technology;2010-06-20

4. A Simple Method for Computing Minkowski Sum Boundary in 3D Using Collision Detection;Springer Tracts in Advanced Robotics;2009

5. A More Efficient Method for Clustering Sheet Metal Shapes;Key Engineering Materials;2007-07