Semi - infinite Optimization Meets Industry : A Deterministic Approach to Gemstone Cutting

نویسندگان

  • Karl-Heinz Küfer
  • Oliver Stein
  • Anton Winterfeld
چکیده

For five centuries artisans have been cutting faceted gemstones, creating jewels that sparkle with internally reflected light, showing off the “fire” of the stones. Working with stones that are transparent or translucent, a cutter makes the most of the color of a stone through careful choice of the angles between facets, depending on the refractive index of the material. At the same time, gem producers have their own goal: to use as much of the volume of the rough stones as possible. By applying modern methods of semi-infinite optimization to this problem, we were able to improve the volume yield significantly while guaranteeing optimal optical properties of the faceted gemstones. Experienced cutters of such stones—rubies, sapphires, tourmalines, and others—have always done their work manually, de-ciding on shape and facet design without technical support. In the recent work, researchers at the Fraunhofer Institute for Industrial Mathematics in Kaiserslautern, to-gether with a consortium of mechanical engineering companies and a gem producer, developed a fully automatic process for industrial gem production based on an optimal balance of volume yield and ideal proportions of the resulting gemstones. The machine first maps the surface of the rough stone by projecting narrow bands of light onto it. Using the scan data, the optimization software chooses one of many basic shapes (e.g., emerald, trillion, or pear; see Figure 1) and a suitable arrangement of facets (e.g., brilliant, Ceylon, or Portuguese cut; see Figure 2), and finds an embedding of the faceted gemstone in the rough stone such that the volume yield is maximized. Once the optimal solution has been found, a grinding and polishing plan is automatically generated and transferred to a CNC machine. Finally, with no manual intervention, the faceted gemstone is ground and polished to a precision of 10 micrometers. Parameterization of a faceted gemstone begins with the position and orientation of the cut stone within the rough stone; other parameters describe the shape of the faceted gemstone, including height, radius, and aspect ratio. The first person to investigate the influence of different shape parameters on the appearance of the brilliant cut was Marcel Tolkowski, at the beginning of the 20th century [14]. The optimal proportions he calculated (called the Tolkowski Ideal Cut) have long served as a reference for the quality of a brilliant cut. Recently, numerous groups have studied the optics of faceted gemstones (collections of articles can be found, for example, in [9] and [10]). The volume-optimization problem has been studied much less extensively. The methods developed to date concentrate on diamond cutting and assume a fixed polyhedral geometry of the faceted gem. Few references are available (see [8] and [15] or, for commercial publications on problems of this type, [4, 5], [13]). The available methods are appropriate for diamond-cutting problems (where one fixed facet arrangement, the so-called round brilliant cut, predominates) and cannot be applied to the cutting of colored gemstones because of subtle yet very important differences between these problem classes. On the one hand, the lapidary proportions are much less restrictive than the brilliant cut proportions. On the other hand, the assumption of a fixed facet arrangement is not appropriate for the lapidary cutting problem because of the large number (several hundreds) of possible geometries. The requirement that several hundreds of parameterized cut variations be taken into account precludes the use of fixed polyhedral geometries and leads to a crucial question, one that is left unanswered by the optimization methods developed so far but that needs to be answered before we can tackle the lapidary cutting problem: If the polyhedral description of a faceted gemstone cannot be used during optimization, what, then, do we optimize?

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

ثبت نام

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

منابع مشابه

Application of general semi-infinite programming to lapidary cutting problems

We consider a volume maximization problem arising in gemstone cutting industry. The problem is formulated as a general semi-infinite program (GSIP ) and solved using an interiorpoint method developed by Stein. It is shown, that the convexity assumption needed for the convergence of the algorithm can be satisfied by appropriate modelling. Clustering techniques are used to reduce the number of co...

متن کامل

A New Approach for Approximating Solution of Continuous Semi-Infinite Linear Programming

‎This paper describes a new optimization method for solving continuous semi-infinite linear problems‎. ‎With regard to the dual properties‎, ‎the problem is presented as a measure theoretical optimization problem‎, ‎in which the existence of the solution is guaranteed‎. ‎Then‎, ‎on the basis of the atomic measure properties‎, ‎a computation method was presented for obtaining the near optimal so...

متن کامل

A numerical approach for optimal control model of the convex semi-infinite programming

In this paper, convex semi-infinite programming is converted to an optimal control model of neural networks and the optimal control model is solved by iterative dynamic programming method. In final, numerical examples are provided for illustration of the purposed method.

متن کامل

A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization

We first present and analyze a central cutting surface algorithm for general semi-infinite convex optimization problems, and use it to develop an algorithm for distributionally robust optimization problems in which the uncertainty set consists of probability distributions with given bounds on their moments. The cutting surface algorithm is also applicable to problems with non-differentiable sem...

متن کامل

A unifying framework for several cutting plane methods for semidefinite programming

Cutting plane methods provide the means to solve large scale semidefinite programs (SDP) cheaply and quickly. We give a survey of various cutting plane approaches for SDP in this paper. These cutting plane approaches arise from various perspectives, and include techniques based on interior point cutting plane approaches, and an approach which mimics the simplex method for linear programming. We...

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2008