Minkowski sum based octree generation for triangular meshes

Authors:
Engin Deniz Diktaṣ;Ali Vahit Ṣahiner
Affiliations:
Computer Engineering Department, Boğaziçi University, Istanbul, Turkey;Computer Engineering Department, Boğaziçi University, Istanbul, Turkey
Venue:
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
Year:
2006

Citing 5
Cited 0

Minkowski addition of polytopes: computational complexity and applications to Gro¨bner bases

SIAM Journal on Discrete Mathematics
Computational geometry in C

Computational geometry in C
Polygon decomposition for efficient construction of Minkowski sums

Computational Geometry: Theory and Applications - Special issue on: Sixteenth European Workshop on Computational Geometry (EUROCG-2000)
An Efficient Algorithm to Calculate the Minkowski Sum of Convex 3D Polyhedra

ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
A kinetic framework for computational geometry

SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.