A comparison between zero and first order approximation algorithms for layered manufacturing

被引:10
|
作者
de Jager, P. J. [1 ]
Broek, J. J. [1 ]
Vergeest, J. S. M. [1 ]
机构
[1] Delft Univ Technol, Fac Ind Design Engn, Delft, Netherlands
关键词
D O I
10.1108/13552549710191854
中图分类号
TH [机械、仪表工业];
学科分类号
0802 ;
摘要
Current rapid prototyping processes are mainly based on layered manufacturing techniques using 2.5D slices. Defines manufacturing by means of 2.5D slices as a zero order approximation. A disadvantage of this approximation is the staircase effect, requiring thin layers to be used. If the outer surfaces of the slices can be inclined, speaks of a first order approximation. This approximation is achieved by linear interpolation between adjacent contours, resulting in ruled slices. Describes a method to approximate a given model geometry in a layered fashion not exceeding a user-defined error 3 using either a zero or a first order approximation and an adaptive layer thickness. Analyses the model geometry for curvature and inclination in order to determine the adaptive layer thickness. Provides a method for matching corresponding contours from adjacent slices. Several test objects have been processed using both zero and first order approximation. Shows that the first order approximation significantly reduces the number of required layers for a given delta when compared to the zero order approximation.
引用
收藏
页码:144 / 149
页数:6
相关论文
共 50 条
  • [31] Solutions to the Sub-Optimality and Stability Issues of Recursive Pole and Zero Distribution Algorithms for the Approximation of Fractional Order Models
    Sabatier, Jocelyn
    ALGORITHMS, 2018, 11 (07):
  • [32] Novel superlinear first order algorithms
    Géczy, P
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2004, E87A (06) : 1620 - 1631
  • [33] First approximation of the zero stress state of artery wall
    不详
    BIORHEOLOGY, 2005, 42 (1-2) : 150 - 150
  • [34] Environmental impacts of zero tillage in Brazil - A first approximation
    Landers, JN
    Barros, GSD
    Rocha, MT
    Manfrinato, WA
    Weiss, J
    CONSERVATION AGRICULTURE: ENVIRONMENT, FARMERS EXPERIENCES, INNOVATIONS, SOCIO-ECONOMY, POLICY, 2003, : 341 - 350
  • [35] Theoretical and numerical comparison of first order algorithms for cocoercive equations and smooth convex optimization
    Briceno-Arias, Luis M.
    Pustelnik, Nelly
    SIGNAL PROCESSING, 2023, 206
  • [36] A comparison of first- and second-order training algorithms for dynamic neural networks
    Bajramovic, F
    Gruber, C
    Sick, B
    2004 IEEE INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS, VOLS 1-4, PROCEEDINGS, 2004, : 837 - 842
  • [37] PARALLEL COMPARISON ALGORITHMS FOR APPROXIMATION-PROBLEMS
    ALON, N
    AZAR, Y
    COMBINATORICA, 1991, 11 (02) : 97 - 122
  • [38] COMPARISON OF ALGORITHMS FOR RATIONAL L INFINITY APPROXIMATION
    LEE, CM
    ROBERTS, FDK
    MATHEMATICS OF COMPUTATION, 1973, 27 (121) : 111 - 121
  • [39] A comparison of exact and ε-approximation algorithms for constrained routing
    Kuipers, Fernando
    Orda, Ariel
    Raz, Danny
    Van Mieghem, Piet
    NETWORKING 2006: NETWORKING TECHNOLOGIES, SERVICES, AND PROTOCOLS; PERFORMANCE OF COMPUTER AND COMMUNICATION NETWORKS; MOBILE AND WIRELESS COMMUNICATIONS SYSTEMS, 2006, 3976 : 197 - 208
  • [40] A comprehensive comparison between thermodynamic perturbation theory and first-order mean spherical approximation: Based on discrete potentials with hard core
    Zhou, Shiqi
    Zhou, Run
    CHEMICAL PHYSICS, 2017, 493 : 1 - 11