Efficient Minkowski Sum Computation of General Ployhedra

Jian Fei Zhang; Xi Juan Guo; Qing Jia Geng

doi:10.4028/www.scientific.net/AMM.130-134.487

Paper Titles

Exponential Sampling: A Gibbs Phenomena Removal Model for Finite Rate of Innovation Sampling Framework
p.470

Mathematical Modeling: A Brilliant Future of Electric Vehicles
p.475

Analysis of Manufacturing Systems with Parallel Unreliable Machines and Finite Buffer Based on Matrix-Analytic Method
p.479

The Semantic Retrieval Model of Manufacturing Resource Based on Rules and Similarity
p.483

Efficient Minkowski Sum Computation of General Ployhedra
p.487

Integrated Environment for PDM, RE and CAD/ CAM System
p.491

The Design of Improved Normalization Algorithm for Drop Analysis
p.495

The Modeling of Thread-Rolling Die-Plates Based on the “Design Table” Functions in CAD/CAE/CAM
p.499

Computer Aided Automotive Interior Design for Kansei Engineering
p.504

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 130-134Efficient Minkowski Sum Computation of General...

Efficient Minkowski Sum Computation of General Ployhedra

Abstract:

We present an algorithm to compute Minkowski sum of general ployhedra, the algorithm removes unnecessary information of computing pairwise Minkowski sum by redundancy analysis and adopt heuristic sorting order to improve computing efficiency of union process, contrast experiments show the algorithm is efficient and suitable for CAD and CAM.

You might also be interested in these eBooks

Mechanical and Electronics Engineering III

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 130-134)

Pages:

487-490

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.130-134.487

Citation:

Cite this paper

Online since:

October 2011

Authors:

Jian Fei Zhang, Xi Juan Guo, Qing Jia Geng

Keywords:

CAD, CAM, General Polyhedron, Minkowski Sum

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] X.J. Guo, Y.L. Gao and Y. Liu. Optimization Algorithm for Computing Exact Minkowski sum of 3D Convex Polyhedra IJICIC, Vol-4, no. 6, (2008), pp.1401-1410.

Google Scholar

[2] P Hachenberger, L Kettner and K Mehlhorn. Boolean operations on 3d selective Nef complexes: data structure, algorithms, optimized implementation and experiments. Comput. Geom. Theory Appl., Vol-38, no1-2, (2007), pp.64-99.

DOI: 10.1016/j.comgeo.2006.11.009

Google Scholar

[3] G. Varadhan, D. Manocha. Accurate Minkowski sum approximation of polyhedral models. Graph Models. Vol-68, no. 4, (2006), p.343–355.

DOI: 10.1016/j.gmod.2005.11.003

Google Scholar

[4] J.M. Lien. Covering Minkowski sum boundary using points with applications. Comput. Aided Geom. Des., Vol-25, no. 8, (2008), pp.652-666.

DOI: 10.1016/j.cagd.2008.06.006

Google Scholar

[5] P. K. Agarwal, E. Flato, and D. Halperin. Polygon decomposition for efficient construction of minkowski sums . European Symposium on Algorithms, (2000), p.20–31.

DOI: 10.1007/3-540-45253-2_3

Google Scholar

[6] P. Ghosh. A unified computational framework for Minkowski operations . Comput. Graph., Vol-17, no. 4 (1993), pp.357-378.

Google Scholar