Abstract
This paper presents an easy-to-implement and efficient method to calculate the Minkowski Sums of simple convex objects. The method is based on direct manipulation of planes in 3D space. The paper then explains how this method is used for generating octrees for scenes consisting of triangular meshes.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agarwal, P.K., Flato, E., Halperin, D.: Polygon decomposition for efficient construction of Minkowski sums. Comput. Geom. Theory Appl. 21, 39–61 (2002)
Guibas, L.J., Ramshaw, L., Stolfi, J.: A kinetic framework for computational geometry. In: Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci, pp. 100–111 (1983)
Guibas, L.J., Seidel, R.: Computing convolutions by reciprocal search. Disc. Comp. Geom. 2, 175–193 (1987)
Gritzmann, P., Sturmfels, B.: Minkowski addition of polytopes: Computational complexity and applications to Grobner bases. SIAM J. Disc. Math 6(2), 246–269 (1993)
Fukuda, K.: From the zonotope construction to the Minkowski addition of convex polytopes. Journal of Symbolic Computation 38(4), 1261–1272 (2004)
Ghosh, P.K.: A unified computational framework for Minkowski operations. Comp. Graph. 17(4), 357–378 (1993)
Bekker, H., Roerdink, J.B.T.M.: An efficient algorithm to calculate the Minkowski sum of convex 3d polyhedra. In: Proc. of the Int. Conf. on Comput. Sci.-Part I, pp. 619–628. Springer, Heidelberg (2001)
Fogel, E., Halperin, D.: Exact and Efficient Construction of Minkowski Sums of Convex Polyhedra with Applications. In: ALENEX 2006, Miami, Florida (to appear, 2006)
O’Rourke, J.: Computational Geometry In C. Cambridge University Press, Cambridge (1994)
Eberly, D.: Dynamic Collision Detection using Oriented Bounding Boxes, http://www.geometrictools.com/
Diktas, E.D.: A Space Subdivision Framework for Virtual Reality and Haptic Applications, MSc Thesis, Department of Systems & Control Engineering, Bogazici University (June 2006)
Diktas, E.D., Sahiner, A.V.: Closest Feature Tracking Using Proximity Octrees, MediaLab Technical Report, Department of Computer Engineering, Bogazici University (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Diktaṣ, E.D., Ṣahiner, A.V. (2006). Minkowski Sum Based Octree Generation for Triangular Meshes. In: Levi, A., Savaş, E., Yenigün, H., Balcısoy, S., Saygın, Y. (eds) Computer and Information Sciences – ISCIS 2006. ISCIS 2006. Lecture Notes in Computer Science, vol 4263. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11902140_40
Download citation
DOI: https://doi.org/10.1007/11902140_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-47242-1
Online ISBN: 978-3-540-47243-8
eBook Packages: Computer ScienceComputer Science (R0)