Pii: S0010-4485(97)00064-x

نویسندگان

  • Kai Tang
  • Shuo-Yan Chou
  • Lin-Lin Chen
چکیده

An important issue in zigzag pocket machining is to design a machining strategy such that the resulting tool path requires a minimum number of tool retraction motions. The minimization is further classified as either local or global. In a local minimization, the inclination of a zigzag path is given a priori, and the goal is to partition the planar region to be machined into a minimum number of retraction-free subregions. The global minimization finds an inclination angle such that the local minimization with respect to this inclination is the minimum among all the possible inclination angles. This paper presents simple O(n log n) algorithms for solving both the local and the global minimization problems of a region with holes, where n is the number of line segments or arcs on the boundary of the region. The optimality of the presented algorithms is proved by using geometric analysis. q 1998 Elsevier Science Ltd. All rights reserved

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parametric circles and spheres

Formulations for parametric circles and spheres in terms of rational Gaussian (RaG) curves and surfaces are introduced. With the proposed formulations, a full circle is generated by interpolating a closed RaG curve to the vertices of an equilateral triangle, and a full sphere is generated by interpolating a closed RaG surface to the vertices of an octahedron with equilateral triangular faces. G...

متن کامل

Knot-removal surface fairing using search strategies

This paper presents two automatic fairing algorithms for parametric C-continuous bi-cubic B-spline surfaces. The fairing method consists of a knot removal and knot reinsertion step which locally smooths the surface. Search strategies like best-first-search and simulated-annealing are searching for the global minimum of the fairing measure. The best-first-search algorithm constructs only partial...

متن کامل

A process planning method for improving build performance in stereolithography

A process planning method is presented in this paper to aid stereolithography users in the selection of appropriate values of build process variables in order to achieve specific goals and characteristics that are desirable in the end prototype. To accomplish this, user-defined input in the form of goal preferences and feature tolerances are used to control how the prototype will be built by wa...

متن کامل

A mesh reconstruction algorithm driven by an intrinsic property of a point cloud

This paper presents an algorithm for reconstructing a triangle mesh surface from a given point cloud. Starting with a seed triangle, the algorithm grows a partially reconstructed triangle mesh by selecting a new point based on an intrinsic property of the point cloud, namely, the sampling uniformity degree. The reconstructed mesh is essentially an approximate minimum-weight triangulation to the...

متن کامل

Approximate development of trimmed patches for surface tessellation

This paper presents a method to construct an auxiliary planar domain of triangulation for tessellating trimmed parametric surface patches. By minimizing a mapping error function, an approximate locally isometric mapping between a given trimmed parametric surface patch and its triangulation domain is constructed. In this way the shape of triangular elements on the triangulation domain is approxi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998