Paper Title:
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.

  Info
Periodical
Edited by
Han Zhao
Pages
487-490
DOI
10.4028/www.scientific.net/AMM.130-134.487
Citation
J. F. Zhang, X. J. Guo, Q. J. Geng, "Efficient Minkowski Sum Computation of General Ployhedra", Applied Mechanics and Materials, Vols. 130-134, pp. 487-490, 2012
Online since
October 2011
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Ernesto Lo Valvo, Roberto Licari
Abstract:The nesting of two-dimensional irregular shapes is a common problem which is frequently encountered by a number of industries where raw...
921
Authors: Jiang Yuan, Zi Xue Qiu, Jin Wei Cao
Abstract:Because of the disadvantages in evaluating straightness error of the traditional method, such as high algorithm complexity, low evaluating...
18
Authors: Gang Tong, Maria Savchenko, Ichiro Hagiwara
Abstract:Surface reconstruction and NURBS surface generation based on 3D surface mesh partitioning are more essential today. In this paper, we present...
1824
Authors: Sheng Wu Dong, Dong Wang, Yun Peng Wang
Chapter 12: Computer-Aided Design, Manufacturing and Engineering
Abstract:A new algorithm for position relationship between detecting point and polygon is proposed based on the research of radial method, and as the...
4248
Authors: Yu Ping Zhang, Zhao Ri Deng, Rui Qi Zhang
Chapter 8: Software Design and Development
Abstract:The triangulation of convex hull has the characteristics of point-set and polygon triangulation. According to some relative definitions, this...
1605