Computer Graphics & Small Bands Enclosing a Set of Spherical Points and Local Accessibility Problems in NC Machining


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 7, No. 7, pp. 2188-2195, Jul. 2000
10.3745/KIPSTE.2000.7.7.2188,   PDF Download:

Abstract

This paper deals with the problem of determining small-bands enclosing a given set of points on the sphere. The small-band is a spherical region, whose boundary is composed of two circles, and which does not contain any great circle. It is a kind of domains that is derived from formalizing the local accessibility problems for 3-axis NC machining into spherical containment problems so as to avoid the gouging. It also can be generated in 4- and 5-axis machining. When a set of points and the size of a great-band are given, the methods for computing a feasible band and all feasible bands enclosing in and time have been suggested, respectively. These methods can be applied into the cases of small bands. However, the method for determining a smallest great band enclosing cannot be applied into the cases of small bands since the solution region may contain holes. In this paper, we concentrate on the method for determining the smallest small-band enclosing and suggest an time algorithm, where is the number of points on the sphere.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
J. S. Ha, "Computer Graphics & Small Bands Enclosing a Set of Spherical Points and Local Accessibility Problems in NC Machining," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 7, no. 7, pp. 2188-2195, 2000. DOI: 10.3745/KIPSTE.2000.7.7.2188.

[ACM Style]
Jong Sung Ha. 2000. Computer Graphics & Small Bands Enclosing a Set of Spherical Points and Local Accessibility Problems in NC Machining. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 7, 7, (2000), 2188-2195. DOI: 10.3745/KIPSTE.2000.7.7.2188.