Author:
Baram Alon,Fogel Efi,Halperin Dan,Hemmer Michael,Morr Sebastian
Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. Agarwal, P.K., Flato, E., Halperin, D.: Polygon decomposition for efficient construction of Minkowski sums. Comput. Geom. Theory Appl. 21, 39–61 (2002)
2. Behar, E., Lien, J.-M.: Fast and robust 2D Minkowski sum using reduced convolution. In: Proc. IEEE Conf. on Intelligent Robots and Systems (2011)
3. Bern, M.: Triangulations and mesh generation. In: Goodman, J.E., O’Rourke, J. (eds.) Handb. Disc. Comput. Geom., ch. 25, 2nd edn., pp. 529–582. Chapman & Hall/CRC, Boca Raton (2004)
4. Couto, M.C., de Rezende, P.J., de Souza, C.C.: Instances for the Art Gallery Problem (2009),
http://www.ic.unicamp.br/~cid/Problem-instances/Art-Gallery
5. Elber, G., Kim, M.-S.: Offsets, sweeps, and Minkowski sums. Comput. Aided Design 31(3), 163 (1999)