Wheel-throwing in digital space using number

196
Int. J. Arts and Technology, Vol. 4, No. 2, 2011
Wheel-throwing in digital space using
number-theoretic approach
Gautam Kumar, Naveen Kr. Sharma and
Partha Bhowmick*
Department of Computer Science and Engineering,
Indian Institute of Technology Kharagpur,
Kharagpur 721302, India
Fax: +91 3222 278985
E-mail: [email protected]
E-mail: [email protected]
E-mail: [email protected]
E-mail: [email protected]
∗
Corresponding author
Abstract: This paper introduces a novel technique to create digital potteries
using certain number-theoretic techniques of digital geometry. Given a digital
generatrix, the proposed wheel-throwing procedure works with a few primitive
integer computations only, wherein lies its strength and novelty. The digital
surface created out of the digital wheel-throwing is digitally connected and
irreducible when the digital generatrix is an irreducible digital curve segment,
which ensures its successful rendition with a realistic finish, whatsoever may
be the zoom factor. The proposed technique is also bestowed with the desired
quality of producing a monotone or a non-monotone digital surface of revolution
depending on whether or not the digital generatrix is monotone with respect to the
axis of revolution. Thick-walled potteries, therefore, can be created successfully
and efficiently to have the final product ultimately resembling a real-life pottery.
Experimental results with some typical generatrices demonstrate its efficiency,
elegance and versatility.
Keywords: arts and computer; computer graphics; digital circle; digital surface
of revolution; wheel-thrown potteries.
Reference to this paper should be made as follows: Kumar, G., Sharma, N.K. and
Bhowmick, P. (2011) ‘Wheel-throwing in digital space using number-theoretic
approach’, Int. J. Arts and Technology, Vol. 4, No. 2, pp.196–215.
Biographical notes: Gautam Kumar is an Undergraduate Student in the
Department of Computer Science and Engineering at Indian Institute of
Technology, Kharagpur, India. His areas of interest include geometric algorithms
and computer graphics.
Naveen Kr. Sharma is an Undergraduate Student in the Department of Computer
Science and Engineering at Indian Institute of Technology, Kharagpur, India. His
areas of interest include geometric algorithms and computer graphics.
Partha Bhowmick is currently working as an Assistant Professor in the
Department of Computer Science and Technology at Indian Institute of
Technology, Kharagpur, India. His primary research interest is digital geometry,
Copyright © 2011 Inderscience Enterprises Ltd.
Wheel-throwing in digital space using number-theoretic approach
197
pertaining to algorithms in the digital paradigm with applications to computer
graphics, low-level image processing, approximate pattern matching and shape
analysis. He has published over 50 research papers in international journals, edited
volumes and refereed conference proceedings, and holds four US patents.
A preliminary version of this paper appeared in the International Conference on
Arts and Technology (ArtsIT 2009), Yilan, Taiwan, 24–25 September, 2009.
1
Introduction
Creating wheel-thrown potteries is a millennium-old artistry, which, with the passing
time, has gained an enduring popularity with today’s state-of-the-art ceramic technology
(Bryant, 2004; Woody, 2008). Hence, with the proliferation of digitisation techniques in
our computerised society, digital creation and artistic visualisation of potteries are call of
the day. The existing graphic tools are mostly based on complex trigonometric procedures
involving computations in the real space, which have to be tuned properly to suit the discrete
nature of the 3D digital space (Galyean and Hughes, 1991; Hill and Kelley, 2007). For, the
method of circularly sweeping a shape/polygon/polyline/generating curve about the axis of
revolution is done in discrete steps, which requires a discrete approximation. And choosing
k equispaced angles about the y-axis requires the following transformation matrices for a
real-geometric realisation:
⎛
⎞
cos θi 0 sin θi 0
⎜
0
1
0
0 ⎟
⎟
Mi = ⎜
⎝ − sin θi 0 cos θi 0 ⎠
0
0
0
1
where θi = 2πi/k, i = 0, 1, . . . , k −1 (Hill and Kelley, 2007). Clearly, in order to generate
circles of varying radii describing the surface of revolution, the number of steps, k, becomes
a concerning issue.
The proposed technique of digital wheel-throwing, on the contrary, works purely in the
digital domain and banks on a few primitive integer computations only, wherein lies its
strength and novelty. Given a digital generatrix as an irreducible digital curve segment, the
digital surface produced by the digital wheel-throwing is both connected and irreducible
in digital-geometric sense. This, in turn, ensures its successful rendition with a realistic
finish that involves conventional processing of quad decomposition, texture mapping,
illumination, etc. The method is robust and efficient, and guarantees easy implementation
in Java3D and OpenGL will all relevant features incorporated. The rendered visualisation
is found to be absolutely free of any bugs or degeneracies, whatsoever may be the zoom
factor. Further, producing a monotone or a non-monotone digital surface of revolution
is also feasible without destroying its digital connectivity and irreducibility by respective
input of a monotone or a non-monotone digital generatrix. To create the exquisite digital
products having the desired resemblance with on-the-shelf potteries in toto, a double-layered
generatrix can be, therefore, supplied as the generatrix, which is its ultimate benefit. Some
typical products from the software, developed by us and their corresponding statistical
figures including CPU times to generate them, have been furnished to exhibit the efficiency
and elegance of the proposed technique.
198
1.1
G. Kumar, N.K. Sharma and P. Bhowmick
Existing methods
Almost all existing methods for modelling potteries start with an initial cylindrical ‘clay’
piece and use deformation techniques, as described in Kameyama (1997) and Korida et al.
(1997). The deformation is based either on shifting the individual points horizontally or on
using devices that accept feedback by means of touch-sensation at multiple points Ueda
et al. (2005). As a result, the user has a direct control over the geometry of the shape to
be constructed, which, however, poses more and more difficulties to represent the surface
mathematically. In addition, it requires large memory for display and storage. On the
contrary, in our method, the whole surface can be represented by a finite number of control
points and the axis of rotation. Some of the major existing practices are as follows:
Polyhedra representation: the whole surface of a pottery is represented by a finite set of
surface polygons. Its major drawback is that many polygons are often required to create a
realistic feel. For example, in the interactive modelling technique proposed in Galyean and
Hughes (1991), a simple teapot consists of 9,244 polygons. The voxel data is converted to a
polygonal surface using a ‘marching-cubes’ algorithm; although the technique is appropriate
for modelling a boulder or a tooth, it cannot create an exact surface of revolution like a
crankshaft or a pottery, since the circular property of potteries is not utilised. Texture can
be applied readily but storing the object requires more memory.
Finite element method: this is the naive approach for representing any 3D object (Han et al.,
2007). The entire volume of the object is composed from cubes of small dimension. The
shape is modified by eroding/depositing the finite elements using suitable interface. Too
many points are required for good resolution which have to be stored explicitly, thereby
requiring large memory. Circular property of potteries is not utilised at all.
Cylindrical element method: the entire pottery volume of a deformable object is discretised
with a set of thin cylinders for its boundary representation as described in Han et al. (2007).
Shape control is performed using collision detection between Haptic Interface Point (HIP)
and the virtual pottery. The drawback is to achieve a good resolution for large objects,
number of cylinders will be large, thereby requiring a large storage space.
Circular sector element method: the pottery is composed from a number of circular sector
elements with small internal angle and thickness. A pottery can be deformed from outside
to inside (contraction mode) or from inside to outside (expansion mode) (Lee et al., 2008).
This is done by collision detection between the individual sector elements and HIP. This
method generates realistic and efficient models, but the simplicity of collisions limits the
types of decorations which can be made on the surface. Moreover, for rendering several
objects with high resolution, this method takes longer time because of increase in elements
and subsequent collisions.
2
Preliminaries
A digital curve segment G := {pi : i = 1, 2, . . . , n} is a finite sequence of digital
points (i.e. points with integer coordinates) (Klette and Rosenfeld, 2004), in which two
points p(x, y) ∈ G and p (x , y ) ∈ G are 8-neighbours of each other, if and only if
max(|x − x |, |y − y |) = 1. To ensure that G is simple, irreducible and open-ended,
each point pi (i = 2, 3, . . . , n − 1) should have exactly two neighbours, and each of p1
and pn should have one, from G. Thus, the chain code of a point pi ∈ G with respect
to its previous point pi−1 ∈ G is given by ci ∈ {0, 1, 2, . . . , 7} (Freeman, 1961). To
Wheel-throwing in digital space using number-theoretic approach
199
generate a digital surface of revolution, S, we consider a digital curve segment G as the
digital generatrix, as shown in Figure 1. The digital generatrix may be taken as input either
as a sequence of chain codes or as a sequence of control points. Given m(≥4) control
points as input, the digital generatrix is considered as the digital irreducible curve segment
that approximates the sequence of m − 3 uniform non-rational cubic B-spline segments
interpolating the sequence of these control points (Foley et al., 1993; Hill and Kelley,
2007). The reasons for B-spline interpolation of the generatrix is its unique characteristic
of having both parametric and geometric continuities, which ensure the smoothness and
the optimal exactness of the fitted curve against the given set of control points. In addition,
a local change (insertion/deletion/repositioning) of control point(s) has only a local effect
on the shape of the digital generatrix (and a local effect on the generated surface, thereof).
This, in fact, simulates the local effect of a ‘potter’s hand’ rolling and manoeuvring the
‘clay’ on his rotating wheel (Figure 2).
The sets N4 (p) := {(x , y ) : |x − x | + |y − y | = 1} and N8 (p) := {(x , y ) :
max(|x − x |, |y − y |) = 1} corresponding to a point p(x, y) ∈ Z2 define the respective
4-neighbourhood (4N) and 8-neighbourhood (8N) of p. Similarly, if p(x, y, z) ∈ Z3 , then
N6 (p) := {(x , y , z ) : |x − x | + |y − y | + |z − z | = 1} and N26 (p) := {(x , y , z ) :
max(|x − x |, |y − y |, |z − z |) = 1} define the respective 6N and 26N of p. Each point in
Nk (p) is said to be a k-neighbour of p (k ∈ {4, 8} if p ∈ Z2 and k ∈ {6, 26} if p ∈ Z3 ).
We consider k = 8 and k̄ = 4 in Z2 , and k = 26 and k̄ = 6 in Z3 . Thus, in a (finite) digital
set S ⊂ Z2 (Z3 ), two points p ∈ S and q ∈ S are k-connected if and only if there exists a
sequence p := p0 , p1 , . . . , pn := q ⊆ S such that pi ∈ Nk (pi−1 ) for 1 i n. The
digital set S is said to be a connected digital set if and only if every pair of points in S is
k-connected. If a connected digital set S be such that S̄ := Z2 S(Z3 S) contains at least
two points, p̄ ∈ S̄ and q̄ ∈ S̄, which are not k̄-connected, then S is said to possess a hole. A
hole H is a finite and maximal subset of S̄ such that every pair of its points are k̄-connected
and none of its points is k-connected with any point from S̄ H . Clearly, S contains
h − 1(h ≥ 1) holes if and only if S̄ contains at least h points, namely, p̄1 , p̄2 , . . . , p̄h , no
two of which are k̄-connected.
Figure 1
A snapshot of a part of our algorithm in action: the digital generatrix (shown in the left
pane) and the corresponding digital surface resembling a flowerpot generated in the
right pane (see online version for colours)
200
Figure 2
G. Kumar, N.K. Sharma and P. Bhowmick
Simulating the local effect of a ‘potter’s hand’ by inserting the control points (from left
to right). Other operations (e.g. deletion and repositioning of control points) are also
incorporated in our algorithm (see online version for colours)
If S ⊂ Z2 (Z3 ) be a connected digital set containing exactly one hole, namely H , then S is
said to be a closed digital curve (surface), of possibly arbitrary thickness. A closed digital
curve (surface) S is irreducible (i.e. of unit thickness) if and only if exclusion of any point
p from S (and its inclusion to S̄) gives rise to a k̄-connected path from each point of H to
each point of S̄ H .
Let L be a real line that partitions an irreducible and closed digital curve S into two or
more (k-connected) components such that all points in each component are on the same
side of L or lying on L, and no two components share a common point. Then each such
component of S is an open digital curve (irreducible segment). Partitioning of an open
digital curve segment, in turn, gives rise to several open segments. Clearly, if the closed
digital curve S be such that any horizontal (vertical) line Ly (Lx ) always partitions S into
at most two components, then S is a y-monotone (x-monotone) digital curve. Similarly,
partitioning an irreducible and closed digital surface S by a plane produces two or more
components such that all points in each component are on the same side of or lying on ,
and no two components share a common point. Each component obtained by partitioning
S with is an open digital surface (irreducible). If the closed digital surface S be such that
any plane y (x , z ) orthogonal to y-axis (x-, z-axis) always partitions S into at most two
components, then S is a y-monotone (x-, z-monotone) digital surface. It may be mentioned
here that if the generatrix be an open, irreducible and y-monotone digital curve segment,
C, then the digital surface of revolution, S, produced by our algorithm is also a y-monotone
digital surface.
Figure 3 illustrates the notions of connectivity and irreducibility of a digital curve
(Klette and Rosenfeld, 2004), which, in turn, produces an irreducible digital surface.
Since there exists no k(= 8)-connected path from the topmost point to the bottommost
point of the digital curve in Figure 3a, the concerned curve is disconnected. Again, in
Figure 3b, there exists multiple paths from the topmost point to the bottommost point, which
implies there are some redundant points in the corresponding digital curve, wherefore it is
reducible. The set of reducible points, as shown in Figure 3c, once eliminated produces an
irreducible digital curve (Figure 3d). In Figure 3e, a closed and irreducible digital surface
S is shown, which contains a hole H inside it. The surface S is connected in k(= 26)neighbourhood as mentioned earlier. Irreducibility of S implies that no voxel p̄ ∈ H is
Wheel-throwing in digital space using number-theoretic approach
201
k̄(= 6)-connected to any voxel p lying outside S (i.e. p ∈ Z3 (S ∪ H )); further, if we
remove any voxel q ∈ S from S, then each voxel p̄ ∈ H has a k̄-connected path to each
voxel p ∈ Z3 (S ∪ H ). Figure 3f shows an open and irreducible digital surface, namely
S , which is obtained by partitioning S with a horizontal (integer) plane : z = c (∈ Z2 ).
Since S itself is irreducible, S is also so, as explained earlier. If we again partition S by
some other orthogonal integer plane, then we again get a smaller irreducible digital surface,
S , as shown in Figure 3g.
Figure 3
An illustration of connectivity and irreducibility of digital curves and surfaces (a) a
disconnected digital curve; (b) a connected but reducible digital curve; (c) the
reducible points (in yellow); (d) an irreducible digital curve; (e) a closed and
irreducible digital surface, S; (f) an open and irreducible digital surface, S obtained by
partitioning S with the horizontal plane : y = c and (g) another open and
irreducible digital surface, S , obtained by partitioning S with the vertical plane
: x = a (see online version for colours)
(a)
(e)
3
3.1
(b)
(c)
(f)
(d)
(g)
Proposed method
Algorithm to wheel-throw a single piece
We generate a wheel-thrown piece by revolving the generatrix G := {pi : i = 1, 2, . . . , n}
about an axis of revolution given by α : z = −c, x = a, where a and c are two
positive integers. To achieve this, for each digital point pi ∈ G, we construct the digital
circle CiZ by revolving pi around the specified axis of revolution, α. However, as G is
irreducible in nature, two consecutive points pi and pi+1 have their distances, namely ri
202
G. Kumar, N.K. Sharma and P. Bhowmick
and ri+1 , measured from α, differing by at most unity. If their distances from α is same,
Z
is digitally connected and irreducible.
then it is easy to observe that the surface CiZ ∪ Ci+1
The problem arises when pi and pi+1 have their respective distances from α differing by
Z
, which
unity. Then there may arise some missing voxels trapped between CiZ and Ci+1
Z
, as shown in Figure 4. Detection
results in digital disconnectedness in the surface CiZ ∪ Ci+1
of these missing voxels is performed to achieve a digitally connected surface, namely
SG := C1Z ∪ C2Z ∪ . . . ∪ CnZ , as follows.
Z
parallel to the zx-plane
Case 1 (ri+1 > ri ): While generating the digital circle Ci+1
corresponding to the point pi+1 ∈ G, there is either an east (E) transition or south-east
(SE) transition from the current point q(x, y, z) in Octant 1 (z ≤ x ≤ ri+1 ) (Foley et al.,
Z
Z
, of CiZ and Ci+1
on the zx-plane,
1993). If we take the respective projections, CiZ and Ci+1
Z
Z
then Ci and Ci+1 become concentric with their radii differing by unity. As ri+1 > ri , each
Z
run-length λ(k)
i+1 (k ≥ 0) of Ci+1 in Octant 1 is either same as the corresponding run-length
of CiZ or greater by unity (Bhowmick and Bhattacharya, 2008). Hence, a ‘missing
λ(k)
i
Z
is formed only if there is a transition towards SE (a change in
voxel’ between CiZ and Ci+1
Z
Z
giving rise to a ‘missing pixel’ between CiZ and Ci+1
.
run, thereof) from a point/pixel in Ci+1
We detect such missing pixels by determining whether or not there is a ‘miss’ during each
Z
Z
. More precisely, if the point next to the current point q(x, z) ∈ Ci+1
SE transition for Ci+1
in Octant 1 is (x − 1, z + 1) and the point (x − 1, z) does not belong to CiZ , then we include
Z
Z
Z
between (x, y, z) ∈ Ci+1
(x − 1, y, z + 1) ∈ Ci+1
.
the point (x − 1, y, z) in Ci+1
Z
in Octant 1 is
Case 2 (ri+1 < ri ): If the point next to the current point q(x, z) ∈ Ci+1
Z
(x − 1, z + 1) and the point (x, z + 1) does not belong to Ci , then we include the point
Z
Z
Z
between (x, y, z) ∈ Ci+1
(x − 1, y, z + 1) ∈ Ci+1
.
(x, y, z + 1) in Ci+1
Thus, depending on Cases 1 and 2, we detect and include the missing voxels for SG . Finally,
the 8-axis symmetry of digital circles (Foley et al., 1993) is used to complete the digitally
connected and irreducible surface of revolution from Octant 1 (Figure 4).
3.2
Number-theoretic approach
In this work, we have used a state-of-the-art algorithm, namely DCH, which is designed
on number-theoretic concepts (Bhowmick and Bhattacharya, 2008). The algorithm DCH
is particularly useful (apropos its speed and efficiency) when we have to construct a large
number of digital circles, which are mostly of high radii. Essentially, the algorithm is
different in principle from the algorithms which were developed in the early period of scanconversion (Bresenham, 1977; Danielsson, 1978; Doros, 1979; Horn, 1976; Kulpa, 1979;
Pitteway, 1974; Shimizu, 1981); and it has also some distinguishing features which are
notably different from the ones proposed in later periods (Blinn, 1987; Bresenham, 1985;
Hsu et al., 1993; Mcllroy, 1983; Suenaga et al., 1979; Wright, 1990; Wu and Rokne, 1987).
The work in Yao and Rokne (1995) has also shown that the notion of number theory is indeed
useful for generating a large number of digital circles. The previous algorithms essentially
resort to appropriate digitisation (i.e. computation of numeric differences) of first order and
second order derivatives, which are mostly useful to analyse and solve problems involving
curves and curve segments in the Euclidean/real plane.
As shown in Bhowmick and Bhattacharya (2008), for radius exceeding 100 or so, the
number-theoretic algorithm (DCH) has appreciable margin over Bresenham’s algorithm
(Bresenham, 1977). Further, the gain for the run length finding approach using the
Wheel-throwing in digital space using number-theoretic approach
203
number-theoretic technique of DCH goes on increasing as the radius increases. For
a very large radius exceeding 1,000 or so, the number-theoretic technique contributes
substantial improvements to a circle generation procedure. The technique is based on the
distribution of perfect squares (square numbers) in integer intervals. Owing to such a unique
characterisation, the problem of constructing a digital circle or a circular arc maps to the
domain of number theory. Given an integer radius and an integer center, the corresponding
digital circle can be constructed efficiently by using number-theoretic properties only. Some
of these relevant number-theoretic properties are as follows.
Figure 4
How a connected and irreducible surface of revolution is created by fixing the missing
voxels, failing which a disconnected surface would be produced: (a) A digital
generatrix in the form of an irreducible digital curve; (b) A disconnected surface of
revolution created due to missing voxels; (c) The set of missing voxels and
(d) The connected and irreducible surface of revolution when missing voxels are
taken care of (see online version for colours)
(a)
(b)
(c)
(d)
204
G. Kumar, N.K. Sharma and P. Bhowmick
If p(i, j ) be a point that lies in C1Z (O, r), then
r 2 − j 2 − j i2 < r 2 − j 2 + j
(1)
From Equation (1), the sequence of integer points constituting the first octant of C Z (O, r) is
obtained. Since (0, r) is the first point in Octant 1 (in clockwise enumeration), the topmost
grid points (j = r) satisfy 0 i 2 < r 2 −r 2 +r = r, or 0 i 2 r −1. Hence, the squares of
their abscissae in Octant 1 points with ordinate r do lie in the integer interval I0 := [0, r −1].
Similarly, the interval containing the squares of abscissae of all the Octant 1 points with
ordinate r − 1 can be shown as I1 = [r, 3r − 3]. In general, the interval containing the
squares of abscissae of the points of C Z,I (O, r), whose ordinates are r − k, k 1, is given
by
Ik = [uk , vk ]
(2)
where
uk = (2k − 1)r − k(k − 1)
(3)
vk = (2k + 1)r − k(k + 1) − 1
(4)
As a result, for k ≥ 1, the length of Ik is lk = 2r − 2k, and that of Ik+1 is lk+1 =
2r − 2(k + 1) = lk − 2.
From the above facts, it can be readily seen that the lengths of the intervals containing the
squares of equi-ordinate abscissae of the grid points in C Z,I (O, r) decrease constantly by 2,
starting from I1 . An important recursion that follows is: the squares of abscissae of grid
points, lying on C1Z (O, r) and having ordinate r −k, lie in the interval [uk , vk := uk +lk −1],
where
uk−1 + lk−1 if k 1
(5)
uk =
0
if k = 0
⎧
⎪
⎨lk−1 − 2 if k 2
lk = 2r − 2
(6)
if k = 1
⎪
⎩
r
if k = 0
An algorithm DCS (Figure 5) for construction of digital circles has been designed by
(Bhowmick and Bhattacharya, 2008) based on (numbers of) square numbers in the intervals
Ik (k ≥ 0), using the above concepts. The algorithm DCS is further improved to another
algorithm, DCR, and finally, culminated to a hybrid algorithm, DCH, using few advanced
run length properties of digital circles, which are derived on further number-theoretic
analysis. On such property is that the run length of grid points of C Z (O, r) with ordinate j −1
never exceeds one more than the run length of its grid points with ordinate j . Hence, it
can shown that (Bhowmick and Bhattacharya, 2008), if λj be the run length of grid points
of C Z,I (O, r) with ordinate j , then the run length of grid points with ordinate j − 1 for
j r − 1 and r 2 is given by
λj − 1
λj −1 −1
2
Wheel-throwing in digital space using number-theoretic approach
Figure 5
205
A snapshot of the number-theoretic algorithm in Wolfram Mathematica (see online
version for colours)
Combining, we obtain Equation 7, which can be used to derive the the horizontal run of
points with ordinate j − 1, from the previous run with ordinate j , for j r.
λj − 1
(7)
− 1 λj −1 λj + 1
2
To find the value of λj −1 , a binary search is applied in (λj − 3)/2, λj + 1 , using a LookUp-Table (of size N ), implemented in the form of a one-dimensional array that contains the
square of each integer n = 0, 1, 2, . . . , N, where N 2 is the largest square not exceeding the
maximum value R of radius r. A visual demonstration of Algorithm DCR may be found in
Wolfram Mathematica (Jha et al., 2009).
3.3
Creating textured/painted potteries
As explained in Section 3.1, the surface SG is generated from the digital generatrix G as
an ordered set of voxels. For each digital circle CiZ corresponding to each voxel pi ∈ G,
the voxels inclusive of the missing voxels are generated in a definite order, starting from
Octant 1 and ending at Octant 8. All the circles, namely C1Z , C2Z , . . . , CnZ , in turn, are also
206
G. Kumar, N.K. Sharma and P. Bhowmick
generated in order. The above ordering to represent a wheel-thrown piece helps to map
textures in a straightforward way. We map adjacent and equal-area rectangular parts from
the texture image to each of the quads. The circle is approximated as a regular polygon.
Clearly, there always lies a trade-off between the number of vertices of the approximate
polygon and the rendering speed, apart from the fact that a coarse approximation gives a
polyhedral effect (Figure 6). The nature of approximation error has been studied in a recent
work (Bhowmick and Bhattacharya, 2009) (a part of which is illustrated in Figure 7 and
also through the 3D plot in Figure 8), which shows that if we have polygons with k ≥ 20
or so, then for r ≤ 100, we have 2% or less error. For higher radii, of course, we should
increase k accordingly to have the desired error control. Note that, an error point is that
which lies inside the polygon but outside the digital circle (Bhowmick and Bhattacharya,
2009).
Figure 6
Results on quad-decomposition for a digital jug: approximating generating digital
circles by regular 2k-gons: (a) k = 4; (b) k = 7 and (c) k = 20 (see online version
for colours)
(a)
Figure 7
(b)
(c)
Approximate regular 2k-gons for k = 3, 4 and 7 corresponding to the digital circle of
radius 8: (a) k = 3 : η = 8; (b) k = 4 : η = 8 and (c) k = 7 : η = 0 (see online version
for colours)
(a)
(b)
(c)
Note: An error point is that which lies inside the polygon but outside the digital circle
(Bhowmick and Bhattacharya, 2009). Error points for k = 4 are given by {(i, j ) :
{|i|, |j |} = {3, 8}}. For other values of k, the corresponding errors are η(k = 2) = 68,
η(k = 3) = 18, η(k = 5) = 8, η(k = 6) = 4 and η(k 7) = 0.
Wheel-throwing in digital space using number-theoretic approach
Figure 8
207
3D plot of error vs. k and radius r of a digital circle (see online version for colours)
Note: With higher values of k, the resultant 2k-gon covering the digital circle has lesser error.
The number of sides, numSides, in the polygon approximation is kept same for each of
the digital points of G. We find the maximum among the distances of the points on G from
the axis of revolution, say, maxDis. We use maxDis to determine the value of numSides.
We want to map a square portion of texture-image
to each of the quads. The distance
√
between two adjacent points in G is either 1 or 2. We determine the value of numSides
by approximating the circle of radius maxDis with a regular polygon having side-length,
d = 1. Thus,
⎞
⎛
numSides = Round ⎝
sin−1
π
d
⎠
(8)
2 maxDis
Now, for each point on G, we approximate the circle of revolution with a regular polygon
with numSides sides. For every pair adjacent points on G, we join the corresponding vertices
of the approximate polygon corresponding to the circle of revolution. In this way, we obtain
a simple quad-decomposition of the surface of revolution. For a faster rendering, we can
approximate the digital generatrix/B-spline by selecting alternate points (or 1 in every
h > 1). Then, the value of d has to be changed to h. In our experiments, we have taken
h = 4.
In this way, the digital continuity of the original image is easily maintained on the texture
map, with satisfactory results. It may be noted that only for such an artistic finish of the
digital pottery, floating-point computations have been resorted to. Figure 9 demonstrates
the quad decomposition of a wheel-thrown vase and the resultant texture mapping.
208
G. Kumar, N.K. Sharma and P. Bhowmick
Figure 9
3.4
Quad decomposition of a wheel-thrown digital vase (top) with three different finishes
(bottom) (see online version for colours)
Creating thick-walled potteries
To create realistic potteries (shown in Section 4) having thick walls, we need to supply
(connected and irreducible) digital generatrices having two parallel segments — one for the
outer wall and another for the inner wall including the rim top. The procedure of generating
digital surfaces of revolution is then same as that explained in Section 3.1. As the digital
generatrix, in its entirety, essentially consists of two parallel segments, which do not touch
or intersect themselves, we get a single irreducible digital curve segment. The inner segment
defines the inner digital surface (of revolution) and the outer, the outer surface. The inner
surface is mostly not visible. However, for further applications, the inner digital surface,
which is an irreducible surface by definition (Section 2), may be required. Since we have a
double-sided (i.e. thick- and hollow-walled) digital pottery, irreducible in nature, it becomes
mathematically well-defined, and hence would be compliant as an input to an algorithm
in any relevant application. An instance of a small-yet-representative thick-walled digital
surface of revolution, which is irreducible in nature, is shown in Figure 10.
Wheel-throwing in digital space using number-theoretic approach
Figure 10
A thick- and hollow-walled irreducible digital surface of revolution: (a) a double
layered irreducible digital curve; (b) a thick-walled disconnected digital surface of
revolution; (c) a missing voxels; (d) a thick-walled irreducible digital surface of
revolution and (e) a part of the irreducible digital surface (see online version for
colours)
(a)
(b)
(d)
4
209
(c)
(e)
Experiments and results
We have implemented the algorithm in Java3DTM API, version 1.5.2, on an Intel(R)
Core(TM)2 Duo CPU E4500 2.20 GHz machine, the OS being Mandriva Linux Release
2008. Snapshots of some potteries are given in Figures 9, 11–13, etc. Figure 9 shows how
a digitally connected and irreducible surface of revolution (Section 2) is decomposed into
appropriately small quads in accordance with Equation (8) for subsequent texture mapping
(Section 3.3). The irreducible digital surface in Z3 , which is an ordered set of voxels, is
mapped to the corresponding real surface in Z2 for quad-decomposition, which is quite fast,
efficient and bug-free by dint of the very property of connectivity and irreducibility of the
digital surface of revolution.
Figure 11 shows another result for a ‘bowl’ with a relatively larger zoom factor.
When a texture is mapped onto the surface in Z2 , we get a flawless surface
resembling a real-world pottery, although uni-voxel thick. A thick-walled set of
potteries, created out of double-layered digital generatrices (Section 3.4), is shown
in Figure 13. A few other sets are shown in Figures 14 and 15. It is evident
from these results that our algorithm successfully produces a digital pottery, from
which necessary potteries of varying colours and textures can be developed as per
requirement. Arrangement of the potteries to produce a on-the-shelf collection of realistic
potteries, whether thin- or thick-walled, is possible to prepare a virtual gallery, there of.
210
Figure 11
G. Kumar, N.K. Sharma and P. Bhowmick
A digital wheel-thrown uni-voxel thick ‘bowl’ created by an irreducible digital curve
segment as the digital generatrix (see online version for colours)
Note: The surface is then decomposed into quads for texture mapping with suitable illumination
and shadow formation.
Figure 12
A wheel-thrown digital drum with two different finishes (see online version for colours)
Figure 13
Potteries with thick walls (see online version for colours)
Wheel-throwing in digital space using number-theoretic approach
Figure 14
211
Potteries with thick walls (see online version for colours)
Some statistical figures and CPU times to generate a few potteries by our software are
presented in Table 1. The total CPU time required to create a digital pottery consists of two
parts: T1 and T2 . The time T1 is for constructing the digital surface SG from a given digital
generatrix, G, and the time T2 is for quad-decomposition, followed by texture mapping
coupled with necessary rendering. The number of voxels constituting SG not only increases
with the length of G and the distance of G from the axis of revolution, α, but also it depends
on the shape of G. If the each pair of consecutive points comprising G has the radius
difference unity, then the number of missing voxels increases, which, in turn, increases the
total number of voxels defining SG .
212
Figure 15
G. Kumar, N.K. Sharma and P. Bhowmick
Some assorted potteries (see online version for colours)
Wheel-throwing in digital space using number-theoretic approach
Table 1
Some statistical figures and CPU times for some digital potteries
No. of
control
points
No. of
points in
original
B-spline
No. of
points in
approximate
B-spline
No. of
sides in
polygon
No. of
quads
T1
(ms)
T2
(ms)
147
103
100
131
227
508
563
599
314
615
403
418
592
607
37
26
25
33
57
127
141
150
79
154
101
105
148
152
16
163
181
185
185
87
114
113
216
127
207
216
186
246
576
4,075
4,344
5,920
10,360
10,962
15,960
16,837
16,848
19,431
20,700
22,464
27,342
37,146
37
26
25
32
55
127
133
137
74
146
98
101
136
145
364
449
580
642
750
665
763
872
891
846
1,001
961
1,488
1,815
6
4
4
5
7
10
20
15
12
28
10
16
20
24
5
213
Total
time
(T1 + T2 ) (ms)
401
475
605
674
805
792
896
1,009
965
992
1,099
1,062
1,624
1,960
Conclusion and future possibilities
We have shown how wheel-throwing can be done in 3D digital space using certain
efficient techniques of digital geometry. Some results given in this paper demonstrate its
efficiency and robustness in creating a digital pottery defined as a digitally connected and
irreducible surface of revolution, along with its readiness to generate realistic thick-walled
potteries, which satisfy both mathematical and aesthetic criteria. Future possibility lies in
generating irregular/bumpy surfaces and subsurfaces of revolution, and in defining various
morphological/set-theoretic operations on digital surfaces of revolution so as to generate
more interesting potteries out of the ‘digital wheel’.
References
Bhowmick, P. and Bhattacharya, B.B. (2008) ‘Number-theoretic interpretation and construction of a
digital circle’, Discrete Applied Mathematics, Vol. 156, No. 12, pp.2381–2399.
Bhowmick, P. and Bhattacharya, B.B. (2009) ‘Real polygonal covers of digital discs – some theories
and experiments’, Fundamenta Informaticae, Vol. 91, Nos. 3–4, pp.487–505.
Blinn, J.F. (1987) ‘How many ways can you draw a circle?’ IEEE Computer Graphics and
Applications, Vol. 7, No. 8, pp.39–44.
Bresenham, J.E. (1977) ‘A linear algorithm for incremental digital display of circular arcs’,
Communications of the ACM, Vol. 20, No. 2, pp.100–106.
Bresenham, J.E. (1985) ‘Run length slice algorithm for incremental lines’, in R.A. Earnshaw (Ed.),
Fundamental Algorithms for Computer Graphics, Vol. F17 of NATO ASI Series, New York:
Springer-Verlag, pp.59–104.
Bryant, V. (2004) ‘Web tutorials for potteries’, Available at: http://www.victor.bryant.hemscott.net/.
Danielsson, P.E. (1978) ‘Comments on circle generator for display devices’, Computer Graphics and
Image Processing, Vol. 7, No. 2, pp.300–301.
214
G. Kumar, N.K. Sharma and P. Bhowmick
Doros, M. (1979) ‘Algorithms for generation of discrete circles, rings, and disks’, Computer Graphics
and Image Processing, Vol. 10, pp.366–371.
Foley, J.D., Dam, A.v., Feiner, S.K. and Hughes, J.F. (1993) Computer Graphics – Principles and
Practice. Reading, MA: Addison-Wesley.
Freeman, H. (1961) ‘On the encoding of arbitrary geometric configurations’, IRE Transactions on
Electronic Computers, Vol. EC-10, pp.260–268.
Galyean, T.A. and Hughes, J.F. (1991), ‘Sculpting: an interactive volumetric modeling technique’,
ACM SIGGRAPH Computer Graphics, Vol. 25, No. 4, pp.267–274.
Han, G., Kim, J. and Choi, S. (2007) ‘Virtual pottery modeling with force feedback using cylindrical
element method’, International Conference on Next-Generation Computing (ICON-C),
pp.125–129.
Hill, F.S. and Kelley, S.M. (2007) Computer Graphics Using OpenGL. India: Prentice Hall.
Horn, B.K.P. (1976) ‘Circle generators for display devices’, Computer Graphics and Image
Processing, Vol. 5, No. 2, pp.280–288.
Hsu, S.Y., Chow, L.R. and Liu, C.H. (1993) ‘A new approach for the generation of circles’, Computer
Graphics Forum 12, Vol. 2, pp.105–109.
Jha, A., Bhowmick, P. and Bhattacharya, B.B. (2009) Available at: http://demonstrations.wolfram.
com/numbertheoreticconstructionofdigitalcircles/.
Kameyama, K-I. (1997) ‘Virtual clay modeling system’, VRST ’97: ACM Symposium on Virtual
Reality Software and Technology, pp.197–200.
Klette, R. and Rosenfeld, A. (2004) Digital Geometry: Geometric Methods for Digital Picture
Analysis. San Francisco: Morgan Kaufmann.
Korida, K., Nishino, H. and Utsumiya, K. (1997) ‘An interactive 3D interface for a virtual ceramic art
work environment’, VSMM ’97: International Conference on Virtual Systems and MultiMedia,
Washington, DC, USA: IEEE Computer Society, p.227.
Kulpa, Z. (1979) ‘A note on “circle generator for display devices’’’, Computer Graphics and Image
Processing, Vol. 9, pp.102–103.
Lee, J., Han, G. and Choi, S. (2008) ‘Haptic pottery modeling using circular sector element method’,
6th International Conference on Haptics: Perception, Devices and Scenarios, Vol. 5024 of LNCS,
pp.668–674.
Mcllroy, M.D. (1983), ‘Best approximate circles on integer grids’, ACM Transactions on Graphics,
Vol. 2, No. 4, pp.237–263.
Pitteway, M.L.V. (1974) ‘Integer circles, etc. – Some further thoughts’, Computer Graphics and
Image Processing, Vol. 3, pp.262–265.
Shimizu, K. (1981) ‘Algorithm for generating a digital circle on a triangular grid’, Computer Graphics
and Image Processing, Vol. 15, No. 4, pp.401–402.
Suenaga, Y., Kamae, T. and Kobayashi, T. (1979) ‘A high speed algorithm for the generation of
straight lines and circular arcs’, IEEE Transaction on Computers, Vol. 28, pp.728–736.
Ueda, E., Matsumoto, Y. and Ogasawara, T. (2005) ‘Virtual clay modeling system using multiviewpoint images’, 3DIM ’05: Fifth International Conference on 3-D Digital Imaging and
Modeling, pp.134–141.
Woody, E.S. (2008) Pottery on the Wheel, Allworth Press, New York. Original publisher: Farrar,
Straus and Giroux (1975).
Wright, W.E. (1990) ‘Parallelization of Bresenham’s line and circle algorithms’, IEEE Computer
Graphics and Applications, Vol. 10, No. 5, pp.60–67.
Wheel-throwing in digital space using number-theoretic approach
215
Wu, X. and Rokne, J.G. (1987) ‘Double-step incremental generation of lines and circles’, Computer
Vision, Graphics, and Image Processing, Vol. 37, No. 3, pp.331–344.
Yao, C. and Rokne, J.G. (1995) ‘Hybrid scan-conversion of circles’, IEEE Transactions on
Visualization and Computer Graphics, Vol. 1, No. 4, pp.311–318.