Sketching Reaction-Diffusion Texture

Size: px
Start display at page:

Download "Sketching Reaction-Diffusion Texture"

Transcription

1 EUROGRAPHICS Workshop on Sketch-Bsed Interfces nd Modeling (006), pp. 1 8 Sketching Rection-Diffusion Texture Pper ID 100 Abstrct In this work, we present n interctive interfce for sketching synthesized textures. Rection-Diffusion (RD) is used s the bsis for texture synthesis. RD llows n unlimited mount of non-repeting texture nd offers gret flexibility for mpping textures to rbitrry surfces. However, it cn be difficult to find strting vlues of prmeters tht will produce interesting ptterns. We use mchine lerning to resolve the difficulty of determining pproprite initil vlues of the RD system. The system described here llows user to sketch pttern of spots or stripes with rbitrry orienttions, nd then utomticlly genertes pttern with the sme ttributes s the sketch. It lso llows the user to interctively crete more complex textures by dding nother lyer of pttern, s well s mnipulte the color of the resulting texture. We lso show tht this procedure cn be pplied to relistic 3D surfces. Ctegories nd Subject Descriptors (ccording to ACM CCS): I.3.7 [Computer Grphics]: Color, shding, shdowing, nd texture; I.3.8 [Computer Grphics]: Applictions Figure 1. () User sketches ellipses with different orienttion. Our system genertes dots with similr size, shpe, nd orienttion. (b) User dds smller ellipses to the sketch. The system genertes smller dots in between lrger dots. (c) User sketches lines with different slopes. The system genertes rndom stripes with similr orienttion. 1. Introduction Textures re two-dimensionl imges or three-dimensionl volumes tht cn be mpped onto n object s surfce. Very often, the object s surfce is lrger thn the texture smple vilble, hence the need for texture synthesis generting more of texture from given smple. There re two min types of textures: rster textures, nd procedurl textures. Rster textures cn be scnned pictures or pinted imges. They re redy-to-mp, but the cost of memory storge is very high nd resmpling nd mpping them to n rbitrry surfce cn be very difficult. Procedurl textures, on the other hnd, re defined mthemticlly, nd therefore tke little memory to store. They re lso esier to resmple nd mp to surfce. In this pper, we focus on textures generted from method clled Rection-Diffusion. In ddition to llowing n unlimited mount of non-repeting texture, this pproch lso offers greter flexibility for both controlling the ttributes of ptterns nd mpping textures to rbitrry surfces. Rection-Diffusion (RD) ws first introduced s model of morphogenesis, biologicl pttern-formtion process in which two or more chemicls clled morphogens diffuse over surfce nd rect with ech other. The differences in concentrtion of morphogens form certin niml cot ptterns, such s spots nd stripes [Tur5]. This process is defined by differentil equtions, which control the chnge in concentrtion of one morphogen reltive to other morphogens over time. A RD system consists of numerous prmeters, few of these being the rection rtes k/s, the diffusion rtes D, nd the rndom fctor β (Section 3). At present there is no intuitive wy to determine the vlues of these prmeters tht will produce interesting ptterns, much less pttern tht hs certin ttributes. Thus, lthough RD cn produce interesting nd vried textures, it is difficult for user to use RD system without hving deep knowledge of its internl workings. We solve this problem by developing n interctive interfce tht llows users to sketch rough version of their desired pttern. Our system then utomticlly genertes texture smple tht contins similr fetures (Figure 1). This is done by nlyzing the sketch s ttributes nd using mchine-lerning technique to mp these ttributes to the pproprite strting prmeters. Our pproch llows for more control over the ttributes of the ptterns produced by the RD system (in cse of Figure 1, the size nd orienttion of spots nd stripes). The system lso includes coloring interfce tht gives the user freedom to vry the color of the generted textures. Finlly, we show tht our pproch cn be pplied to generte ptterns, s defined by user, on 3D surfce. submitted to EUROGRAPHICS Workshop on Sketch-Bsed Interfces nd Modeling (006)

2 Pper ID 100 The rest of this pper is orgnized s follows. In Section, we present our interfce for sketching RD textures. In Section 3, we provide brief bckground of RD systems. In Section 4, we summrize the previous work tht hs been done on generting textures with RD. Section 5 contins detiled description of the implementtion of this system, including our extension to existing techniques nd our ppliction of mchine lerning to solve the problem of finding the pproprite prmeter vlues. In Section 6, we illustrte how our method extends to 3D surfces. We conclude with discussion of the future work in Section 7. Figure. Size of the spots produced vries over the grid (right), s depicted in user s sketch (left).. Sketching RD textures using the interfce Initilly, the user sketches ellipses nd lines in the sketch window, which ct s inputs to the system. The system then genertes texture consisting of spots or stripes tht hs similr ttributes s the initil sketch. These ttributes re shpe, size, spcing, nd orienttion of the spots nd stripes tht form the textures. The sketch window is divided into smller regions to llow for pttern with vried ttributes cross the entire imge. For the purpose of experimenting, the sketch ws divided into four regions (Figure ), but this could be n by n regions for lrger texture. Averge vlues of ttributes in ech region re used in determining the finl ttributes of the output texture. Since ptterns in different regions cn vry in size, shpe, or orienttion, liner interpoltion of the ttribute vlues between neighboring regions gives the output texture smooth trnsition from one region to the next..1. Sketching spots.1.1. Controlling size of spots. Spots re described by their size, shpe nd orienttion. The user cn generte spots by sketching ellipses in the sketch window. The system clcultes the verge size of ellipses in ech region. A mpping function then mps these vlues to set of strting prmeters such tht the spots generted by this system will hve the sme size s those sketched. This mpping function is described lter in Section As shown in Figure, the spots re vried in size cross the imge with smooth trnsition in size from the top left to the bottom right corner..1.. Controlling orienttion of spots. Using the sme technique s tht for vrying the size of spots s explined bove, their orienttion cn lso be vried cross the imge (Figure 3). Implementtion detils for generting textures with rbitrrily oriented spots cn be found in Section Controlling spcing mong spots. In generl, RD system of spots would hve the spcing between spots determined by the size of spots. Implementing cscded RD system s described in [Tur9], our system llows the user to generte ptterns from sketch where rbitrry sized spots cn hve rbitrry spcing between them (Figure 4). This technique will be described in detil in Section 4. Figure 3. Orienttion of spots produced (right) vries over the grid s sketched (left). Figure 4. Smll spots with lrge spcing (right) s sketched in the sketch window (left). The red lines re produced when the sketch is nlyzed. These lines correspond to the distnces mong the spots. Figure 5. The first simultion produces yellow spots (right) bsed on the sketch of the lrger ellipses (left). Figure 5b. The second simultion produces red spots (right). Red lines between smller ellipses in the sketch re produced when the sketch is nlyzed (left). submitted to EUROGRAPHICS Workshop on Sketch-Bsed Interfces nd Modeling (006)

3 Pper ID Figure 6. The system genertes pttern of stripes (right) tht hve the sme orienttion s in user s sketch (left) Complex ptterns. The previous subsections described how spots with desired size, orienttion nd spcing cn be obtined. However, the spots generted in this wy hve only one size in ech region. In order to hve smll spots interspersed with lrger spots through out the imge (Figure 5b), we implement cscded RD system s described in [Tur9]. Using our interfce, the user first sketches only the lrge ellipses in the sketch window (Figure 5). The system genertes spots with spcing nd orienttion s sketched. These spots form the first lyer of ptterns, with coloring scheme s described in Section.3. To dd more spots into this texture, the user first freezes these lrger spots (set the morphogens concentrtion in these cells constnt). A second set of ellipses cn now be drwn in the sketch window (Figure 5b). The system produces second set of spots (the second lyer of ptterns), with orienttion s sketched, in between the first set. The outcome of this second set of spots depends on the spcing mong the first set nd the size of the second set. The size of the second set of spots should be smll enough for them to form in between the lrger spots... Sketching stripes Stripe pttern cn be generted by sketching stright lines in the sketch window (Figure 6). Stripes re described by their width nd orienttion. The user needs to drw t lest one line representing stripes in ech region of the sketch window. The system clcultes verge slopes of lines in ech region. Bsed on these vlues, the system then genertes stripes with orienttions similr to those in the sketch. The detiled description of this implementtion cn be found in Section 5.1. The user cn choose one of four different sizes to drw the line, resulting in four different thicknesses of the stripes. texture by chnging the mpping of the morphogen concentrtions to colors. The color control interfce is bsed on the work presented in [KTBG03]. The interfce provides two sets of colors illustrted by the two long spcing brs in Figures 7 nd 8. The upper br displys the set of colors used for the first lyer of ptterns while the lower br displys the set of colors used for the second lyer (this second color set is used only in the cse of complex ptterns, s in Figure 8). A user cn use the Red/Green/Blue slide brs to define the colors to be used for either of the two sets. Colors cn be dded, modified, removed or the order of colors cn be chnged for ech of the two sets. A user cn lso djust the spcing between colors in one set by moving the buttons (one for ech color) on the spcing br. Aprt from the spcing br, the user cn use Bezier curve to blend between colors. The blending of colors in ech set is bsed on the distnce between two djcent colors on the spcing br, nd by the shpe of the corresponding Bezier curve. The concentrtion of given morphogen is mpped to the continuous set of colors; the lowest concentrtion (vlley) corresponds to the first color in the set, nd the highest concentrtion (pek) corresponds to the lst color (Figure 7). Figure 7. Concentrtion of morphogen A is mpped to the upper set of colors, with the lowest concentrtion mpped to violet nd the highest concentrtion mpped to pink. Trnsition between the vlley to the pek of the morphogen s concentrtions is visulized by chnge in color, from violet to yellow, to green, nd then to pink..3. Color control Our system genertes textures by imitting the RD process between morphogens. The concentrtion of ech morphogen is mpped to color. The ptterns of spots nd stripes re formed through the vritions in concentrtion of the morphogens s result of the RD process. After the texture is produced, the user cn use the color control interfce provided by the system to vry the color of the Figure 8. Spots belonging to the first lyer re mpped to the first color set (pink to yellow), while spots belonging to the second lyer re mpped to the second color set (pink to red). submitted to EUROGRAPHICS Workshop on Sketch-Bsed Interfces nd Modeling (006)

4 4 Pper ID Bckground of Rection-Diffusion A Rection-Diffusion (RD) system consists of two (or more) morphogens diffusing over surfce nd recting with one nother to form stble pttern. This pttern is visulized by mpping ech morphogen s concentrtion to color. In generl, this process cn be modeled by the following differentil equtions [Tur91]: = F(, b) + D b = G(, b) + Db b (Eq. 1) where nd b represent the concentrtions of morphogens A nd B, nd D nd D b re diffusion rtes of A nd B, respectively. At ny point in time, the concentrtions nd b re determined by the bove functions. F(,b) nd G(,b) describe the chnge in the concentrtion of A nd of B, respectively, s result of the rection processes between A nd B. These functions will decide if one morphogen inhibits the other, or sustins the other t the sme position. Lplcins nd b re the mesures of how high the concentrtions of A nd B re reltive to the concentrtions of the sme morphogens, respectively, in the surrounding cells. In the cse of grid (Figure 9), the formul for is s follows: = i 1, j + i+ 1, j + i, j 1 + i, j+ 1 4i, j (Eq. ) In generl, for n rbitrry surfce, e.g. mesh (Figure 9b), the formul will be: n = ik n (Eq. 3) k =1 i For given morphogen A, if the concentrtion of A in the current cell is higher thn tht of A in the surrounding cells, Lplcin is negtive. In the next time step, A diffuses wy from this cell, thus the concentrtion of A reduces. The reverse occurs if the concentrtion of A is lower in the current cell reltive to the surrounding cells. D nd D b specify how fst A nd B diffuse cross the surfce. At ny time t, the concentrtion of A is the sum of rection process between A nd B denoted by F(,b) nd diffusion process of A denoted by D (see Appendix). 4. Previous work The work by Turing in [Tur5] describes RD system of two morphogens tht forms spots (Turing spot system). Other reserchers hve since shown tht simple ptterns, from spots to stripes, cn lso be generted with rectiondiffusion mechnisms using different systems of morphogens nd equtions [Br81, Mur8, Mei8]. In [Mei8], Meinhrdt described RD system of two morphogens tht produces spots (Meinhrdt spot system), nd nother RD system of five morphogens tht produces stripes (Meinhrdt stripe system). In 1991, Witkin nd Kss dpted RD for texture synthesis nd dded nisotropy by vrying diffusion cross the surfce [WK91]. It ws lso shown tht complex ptterns could be generted using double simultions of cscded RD systems [Tur91]. Using the three RD systems (Turing spot, Meinhrdt spot, nd Meinhrdt stripe), we cn generte rndom spots or stripes by pplying rndom vritions to the concentrtions of morphogens in the system. We cn lso generte regulr stripes by rising the initil concentrtion of one morphogen t certin cells, clled inititor cells. During RD simultion, stripes rdite from these cells (Figure 10). Cscded systems built upon these three bsic forms cn lso generte more complex ptterns, such s leoprd spots or mixed spots of different sizes [Tur9]. We will explin the genertion of some of these complex ptterns in the following prgrphs. In the following section, we will describe our extensions tht give the user more flexibility in generting RD textures. Mixed spots of different sizes re obtined by first generting lrge size spots. These lrge spots re then frozen the concentrtions of morphogens in those cells tht form the spots re kept constnt. The second simultion then cretes smll spots in between the lrge spots (Figure 11). Leoprd spots, or rosettes, s shown in Figure 11b, re generted using the Turing spot system in similr wy, but with one extr step. After freezing the lrge spots, the concentrtions of morphogens in cells tht form these spots cells with pek concentrtion of given morphogen A nd vlley concentrtion of the other re reset to the initil level [Tur9]. During the second simultion, since the concentrtion of morphogen A in cells within the lrge spots is lower thn its pek, A tries to diffuse to cells surrounding the lrge spots, which leds to inhibition of morphogen B from collecting in these cells. As result, the smll spots tend to form circle round the lrge spots insted of in between them. In Figure 11b, A is represented by blck color nd B by yellow color. Figure 9. Morphogen A diffuses to nd from four djcent cells. Figure 9b. Morphogen A diffuses to nd from ll djcent cells. Figure 10. Regulr stripes rdite from inititor cells during RD process. submitted to EUROGRAPHICS Workshop on Sketch-Bsed Interfces nd Modeling (006)

5 Pper ID Implementtion 5.1. High-level description for spots Figure 11. Mixed spots generted by the Meinhrdt spot system. Figure 11b. Leoprd spots produced by Turing spot system. The min objective of this work is to develop n intuitive nd esy wy for user to utomticlly generte desired texture. The first step is the intuitive sketch interfce described in Section. However, the RD systems which re used to generte the textures require vlues of vrious prmeters s inputs. In order to extrct the prmeter vlues from the sketch, we devised high-level description for the spots in terms of the three prmeters: size, orienttion nd spcing. Figure 1. Two-step genertion of smll spots with lrge spcing using cscded Turing spot system. First, lrge spots with lrge spcing re produced (left). Next, smll spots re produced t the sme sites where lrge spots hd been (right). When single RD simultion is employed to generte spots, the distnce between spots, or spcing, is proportionl to the size of the spots. The lrger the spots re, the wider the spcing is. However, using cscded Turing spot systems s described in [Tur9], smll spots with lrge spcing cn be generted (Figure 1). The first simultion yields lrge spots with lrge spcing. The concentrtion of morphogens from the first simultion is then used to set up the second simultion such tht smller spots re produced t the sme positions where the lrge spots hd been, thus mintining lrge spcing. In other words, the first simultion produces spots with the specified spcing. The second simultion yields spots with the desired size while mintining the previous spcing. The existing systems of spots nd stripes described bove hve limited flexibility. For exmple, the spots nd stripes described before cnnot be oriented in ny rbitrry direction tht the user my desire. More importntly, the user needs to directly twek prmeters of the RD system in order to get desired pttern. It cn be difficult to find initil vlues of morphogens tht produce interesting ptterns, much less pttern tht hs certin desired ttributes. In the following section we describe our interfce with which user cn sketch RD texture. This is n intuitive method for user to generte ptterns utomticlly, without the need for knowledgeble tweking of RD prmeters. In order to llow more flexibility to the textures tht cn be generted, we lso provide extensions tht support rbitrrily oriented spots nd stripes. We lso show how we give dditionl control to the ttributes of the ptterns, nd how we pply mchine lerning to mp from our high-level spot description to RD prmeters. When the user drws spots in the sketch window, the system fits ellipses to the spots, nd extrcts their centers, orienttions nd rdii. The re of spot is used to describe its size; the rtio of minor rdius to mjor rdius to describe its shpe, nd the mjor xis to describe its orienttion. We then use Deluny tringultion method to determine the closest neighbors of spot, nd then clculte the distnce from this spot to its neighbors. In Figure 4, red lines produced during this process correspond to the distnces between spots. The verge distnce between djcent spots in the user s sketch is then used s the spcing between ll the spots for the purpose of generting the texture. 5.. Appliction of Mchine lerning for mpping user's sketch to RD prmeters In the previous section, we describe how physicl ttributes of the sketch re clculted. Once these vlues hve been extrcted from the user s sketch, they need to be mpped to the prmeters. In order to resolve the mpping between physicl ttributes nd RD prmeters, we use mchine lerning. This step is described in the following prgrphs Prepring trining dt for mchine lerning. The purpose of our mchine lerning function is to mp the spot ttributes to prmeter vlues. The first step is to lern how set of initil prmeter vlues mp to spot ttributes. Since the prmeters used to determine orienttion nd size with spcing re independent, lerning the mpping for the orienttion nd for the size with spcing cn be done seprtely. To reduce the totl number of dt points, we generted four different sets of trining dt, two for Turing nd Meinhrdt spots orienttion nd two for Turing nd Meinhrdt spots size nd spcing. The RD system ws run 15,600 times with different prmeter settings to generte textures with vrious ptterns tht serve s trining dt for this lerning process. For ech RD spot system, we use different threshold vlue for morphogen A or B to trce the boundry of the spot. We then fit ellipses to these spots. Bd textures (e.g. when the ptterns re not well formed, or if the size of the spots is too smll to perform ellipse fitting) re excluded. Using the sme method s for extrcting spot ttributes from user s sketch, we clculte the physicl ttributes of spots generted by the RD system (Figure 13). submitted to EUROGRAPHICS Workshop on Sketch-Bsed Interfces nd Modeling (006)

6 6 Pper ID 100 D nd D b shown in Eqution 1, we lso expnd the formul clculting Lplcins (Eqution ) nd dd direction coefficients to the flow of morphogens to nd from neighbor cells (Figure 14). These coefficients specify preferentil directions in which morphogens diffuse fster, thus the spots re elongted in these directions. As result, spots cn hve rbitrry orienttion. Figure 13. Ellipses (left) re fitted to RD spots (right). Yellow lines connect ech ellipse to their closest neighbors s determined by Deluny tringultion. During the texture genertion process, the trining dt were fed to mchine lerning function to mp the spot ttributes from the user s sketch to corresponding RD prmeters Non-homogeneous ptterns. In RD system, there re severl prmeters such s the rection rtes, diffusion rtes, nd direction coefficients tht determine the size, shpe, spcing, nd orienttion of the spots. In order to llow non-homogeneous ptterns, insted of using the sme prmeter vlues everywhere, we blend the prmeter vlues cross the grid. The result is ptterns of spots tht hve size, orienttion, nd spcing chnging cross the imge (Figure 15) Loclly Weighted Regression. To implement mchine lerning, we choose Loclly Weighted Regression (LWR) becuse it does not require n extremely lrge collection of trining dt, nd yet it is highly efficient for lerning complex mppings from rel-vlued input vectors to rel-vlued output vectors using noisy dt. Loclly Weighted Regression is memory-bsed lgorithm for lerning continuous curves tht uses only trining dt close to the prticulr point X. Points nerby re weighted by their distnce to point X. A nonliner regression n estimtion technique using interpoltion to predict one vrible from one or more other vribles is then clculted using these weighted points. Using memory-bsed lgorithm for mchine lerning lso mens tht we need to store the trining dt nd run LWR function every time to generte the prmeters. We use the LWR Mtlb function presented in [SA94]. Figure 14. Morphogens from one cell cn diffuse from nd to ll eight of its neighbors. Diffusion coefficients give the spots shpe nd orienttion. Figure 14b. Anisotropic Turing spots with the usersupplied direction indicted by rrow Mpping functions. The results we get from mpping size nd spcing of spots to RD prmeters re not lwys relible becuse of the errtic nture of trining dt. Therefore, we build mpping function for size nd spcing of spots using liner interpoltion. The function tkes spcing or re s input nd returns rection rtes nd direction coefficients s outputs. For orienttion of spots, the mpping function is LWR function tht tkes the rtio of minor rdius to mjor rdius s well s the mjor xis vector of the sketched ellipses s inputs, nd returns direction coefficients s outputs. () (b) Figure 15. Exmples of non-homogeneous textures of spots with size () nd orienttion (b) chnging cross the imge Extensions to existing RD spots Arbitrrily oriented spots. The existing RD systems described in the Section 4 cn generte only nisotropic spots, which re ellipticl spots in verticl or horizontl directions. This is becuse these systems llow the morphogens to diffuse to four neighbors only, long the directions North, South, Est, nd West (Figure 9). In this work, prt from using nisotropic diffusion rtes, we lso llow the morphogens to diffuse from nd to ech of the eight neighbors (Figure 14). In ddition to diffusion rtes Figure 16. Seeding the stripe system with line segments (left) results in texture with similr orienttion (right). Note tht slopes of the stripes vry cross the imge. submitted to EUROGRAPHICS Workshop on Sketch-Bsed Interfces nd Modeling (006)

7 Pper ID Oriented rndom stripes Direction coefficients cn be used to generte oriented spots (s explined in Section 5.3.1), but they do not help in generting oriented stripes. Inititor cells tht form oriented rndom line segments, however, cn crete oriented rndom stripes. The system clcultes the verge slopes of the lines sketched by the user in ech of the regions of the sketch window. These vlues re used to seed rndom lines with slight vritions of these verge slopes. The Meinhrdt stripes system then genertes rndom stripes tht hve similr orienttions (Figure 16). originl mesh to generte the desired pttern. As shown in Figure 0, the method produces spots with desired orienttion on cube. However, due to irregulr distribution of vertices, the orienttion of spots is not s cler when generted on the bunny. 6. Sketching RD texture on 3D mesh We demonstrte our interfce for creting RD textures on 3D surfces. Insted of drwing on seprte sketching window, the user cn drw spots directly on mesh. The system then fits ellipses to the spots, computes their ttributes, mps these to pproprite prmeters, which re then ssocited with vertices of the mesh tht lie within these ellipses. The remining vertices re ssigned prmeter vlues tht re liner combintion of the vlues t vertices lying within the closest ellipses. To generte spots of different sizes on the bunny in Figure 19, the diffusion rtes of morphogens A nd B re propgted nd blended over the mesh bsed on the size nd position of spots sketched by the user. The reltive proportions of morphogen flowing to ech of the neighboring vertices re clculted s explined below. For ech vertex i in the mesh nd its neighboring vertex ik (mong its n neighboring vertices numbered i1 through in), the term d ik denotes the distnce between centroids of the two tringles on either side of the edge connecting vertex i to vertex ik (Figure 17). The percentge coefficient P ik for the flow of morphogens between these two vertices is clculted s the rtio: d ik Pik = (Eq. 4) n d k = 1 ik And the Lplcin for vertex i is given by Eqution 5, where i is the morphogen concentrtion in vertex i. n = 4 Pik ik i (Eq. 5) k = 1 To generte oriented spots, the vector showing the orienttion of the ellipse is projected onto the tngent plne t ech vertex (Figure 18). During RD simultion, the fces surrounding ech vertex re rotted so tht this projected vector becomes prllel to the x xis. These fces re then scled down long the x xis ccording to the rtio of the minor rdius to the mjor rdius of the ellipse sketched by the user. Finlly, the reltive proportions of morphogen flowing to ech of the neighboring vertices re determined bsed on these trnsformed fces surrounding the vertex in the sme mnner s described bove. Once the differentil flow of morphogens hs been clculted, it is pplied to the Figure 17. Proportionl flow of morphogens long ech edge between the current vertex nd its neighboring vertices is determined by the normlized distnces between the centroids of the two fces on either side of tht edge. () (b) Figure 18. () The originl mesh showing the current vertex nd its surrounding vertices. The rrow shows the projection of the sketched ellipse s mjor xis vector onto the tngent plne t the current vertex. (b) Illustrtion of the vertices fter rottion followed by scling down the fces long the x-xis. Figure 19. Spots of different sizes generted on 3D mesh. Figure 0. Oriented spots generted on cube. submitted to EUROGRAPHICS Workshop on Sketch-Bsed Interfces nd Modeling (006)

8 8 Pper ID Summry nd future work The system described here llows user to mke simple sketch of desired pttern nd then utomticlly genertes lrge mount of texture tht hs similr pttern. This interfce llows the user to produce desired texture with ese nd without the need for ny internl knowledge of the Rection-Diffusion process. Insted of hving to run the system severl times to find the right set of prmeters tht will produce desired texture, the user cn sketch the ptterns they wnt nd hve the system utomticlly generte texture with similr ttributes. This is much more nturl nd intuitive method. As prt of future work, the dimension nd resolution of the grid cn be dynmiclly determined bsed on user s sketch, such s number nd size of ellipses or stripes, in order to mke the texture synthesis more flexible. As demonstrted here, this system cn be extended to support utomtic texture synthesis on cnonicl 3D surfces. The next step will be the development of stble nd robust system for utomtic texture synthesis on 3D model. 8. Appendix: 8.1. Formule for Turing spot system b [ k ( 16 b) + D ] [ k ( b b β ) + D b] 8.. Formule for Meinhrdt spot system 0.01 β s p t b b [ s ( 0.01 β bp + p ) + D b] 1 b + p3 + D 8.3. Formule for Meinhrdt stripe system 0.01 eβ k c b 0.01b c c d e d bk [ 0.01 eβ b d ck ] [( d ) k + D d] [( b e) k + D e] de de b e d b 3 + D + Db b b c 9. References: [Br81] BARD J. B. L.: A Model for Generting Aspects of Zebr nd Other Mmmlin Cot Ptterns. Journl of Theoreticl Biology, Vol. 93, No., pp (November 1981). [EMP*0] EBERT D. S., MUSGRAVE F. K., PEACHEY D., PERLIN K., WORLEY S.: Texturing & Modeling: A Procedurl Approch, Morgn Kufmnn, 3 rd edition, (December 00). [KTBG03] KULLA C. D., TUCEK D. J.., BAILEY R., GRIMM C. M.: Using Texture Synthesis for Non-Photorelistic Shding from Pint Smples. 11th Pcific Grphics Conference on Computer Grphics nd Applictions, pp. 477 (October 003). [Ml8] MALDELBROT B. B.: The Frctl Geometry of Nture, W. H. Freemn nd Compny, New York, 198. [Mei8] MEINHARDT H.: Models of Biologicl Pttern Formtion, Acdemic Press, London, 198. [Mur81] MURRAY J. D.: On Pttern Formtion Mechnisms for Lepidoptern Wing Ptterns nd Mmmlin Cot Mrkings. Philosophicl Trnsctions of the Royl Society B, Vol. 95, pp (October 1981). [Per85] PERLIN K.: An Imge Synthesizer. Computer Grphics, Vol. 19, No. 3 (SIGGRAPH 85), pp (July 1985). [PH89] PERLIN K., HOFFERT E. M.: Hypertexture, Computer Grphics, Vol. 3, No. 3 (SIGGRAPH 89), pp (July 1989). [SA94] SCHAAL S., ATKESON C. G.: Assessing the qulity of lerned locl models. Advnces in Neurl Informtion Processing Systems 6 Morgn Kufmnn, Sn Mteo, CA, pp , [Tur5] TURING A.: The Chemicl Bsis of Morphogenesis. Philosophicl Trnsctions of the Royl Society B, Vol. 37, pp (August 14, 195). [Tur91] TURK G.: Generting Textures on Arbitrry Surfces Using Rection-Diffusion. Computer Grphics, Vol. 5, No. 4 (SIGGRAPH 91), pp (July 1991). [Tur9] TURK G.: Texturing Surfces Using Rection- Diffusion. PhD Disserttion, The University of North Crolin t Chpel Hill, 199. [WK91] WITKIN A., KASS M.: Rection-Diffusion Textures. Computer Grphics, Vol. 5, No. 4 (SIGGRAPH 91), pp (July 1991). submitted to EUROGRAPHICS Workshop on Sketch-Bsed Interfces nd Modeling (006)

Class-XI Mathematics Conic Sections Chapter-11 Chapter Notes Key Concepts

Class-XI Mathematics Conic Sections Chapter-11 Chapter Notes Key Concepts Clss-XI Mthemtics Conic Sections Chpter-11 Chpter Notes Key Concepts 1. Let be fixed verticl line nd m be nother line intersecting it t fixed point V nd inclined to it t nd ngle On rotting the line m round

More information

Stained Glass Design. Teaching Goals:

Stained Glass Design. Teaching Goals: Stined Glss Design Time required 45-90 minutes Teching Gols: 1. Students pply grphic methods to design vrious shpes on the plne.. Students pply geometric trnsformtions of grphs of functions in order to

More information

Section 10.4 Hyperbolas

Section 10.4 Hyperbolas 66 Section 10.4 Hyperbols Objective : Definition of hyperbol & hyperbols centered t (0, 0). The third type of conic we will study is the hyperbol. It is defined in the sme mnner tht we defined the prbol

More information

9.1 apply the distance and midpoint formulas

9.1 apply the distance and midpoint formulas 9.1 pply the distnce nd midpoint formuls DISTANCE FORMULA MIDPOINT FORMULA To find the midpoint between two points x, y nd x y 1 1,, we Exmple 1: Find the distnce between the two points. Then, find the

More information

a < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1

a < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1 Mth 33 Volume Stewrt 5.2 Geometry of integrls. In this section, we will lern how to compute volumes using integrls defined by slice nlysis. First, we recll from Clculus I how to compute res. Given the

More information

1. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES)

1. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES) Numbers nd Opertions, Algebr, nd Functions 45. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES) In sequence of terms involving eponentil growth, which the testing service lso clls geometric

More information

1 Drawing 3D Objects in Adobe Illustrator

1 Drawing 3D Objects in Adobe Illustrator Drwing 3D Objects in Adobe Illustrtor 1 1 Drwing 3D Objects in Adobe Illustrtor This Tutoril will show you how to drw simple objects with three-dimensionl ppernce. At first we will drw rrows indicting

More information

Unit 5 Vocabulary. A function is a special relationship where each input has a single output.

Unit 5 Vocabulary. A function is a special relationship where each input has a single output. MODULE 3 Terms Definition Picture/Exmple/Nottion 1 Function Nottion Function nottion is n efficient nd effective wy to write functions of ll types. This nottion llows you to identify the input vlue with

More information

INTRODUCTION TO SIMPLICIAL COMPLEXES

INTRODUCTION TO SIMPLICIAL COMPLEXES INTRODUCTION TO SIMPLICIAL COMPLEXES CASEY KELLEHER AND ALESSANDRA PANTANO 0.1. Introduction. In this ctivity set we re going to introduce notion from Algebric Topology clled simplicil homology. The min

More information

II. THE ALGORITHM. A. Depth Map Processing

II. THE ALGORITHM. A. Depth Map Processing Lerning Plnr Geometric Scene Context Using Stereo Vision Pul G. Bumstrck, Bryn D. Brudevold, nd Pul D. Reynolds {pbumstrck,brynb,pulr2}@stnford.edu CS229 Finl Project Report December 15, 2006 Abstrct A

More information

MA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork

MA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork MA1008 Clculus nd Liner Algebr for Engineers Course Notes for Section B Stephen Wills Deprtment of Mthemtics University College Cork s.wills@ucc.ie http://euclid.ucc.ie/pges/stff/wills/teching/m1008/ma1008.html

More information

Illumination and Shading

Illumination and Shading Illumintion nd hding In order to produce relistic imges, we must simulte the ppernce of surfces under vrious lighting conditions. Illumintion models: given the illumintion incident t point on surfce, wht

More information

Complete Coverage Path Planning of Mobile Robot Based on Dynamic Programming Algorithm Peng Zhou, Zhong-min Wang, Zhen-nan Li, Yang Li

Complete Coverage Path Planning of Mobile Robot Based on Dynamic Programming Algorithm Peng Zhou, Zhong-min Wang, Zhen-nan Li, Yang Li 2nd Interntionl Conference on Electronic & Mechnicl Engineering nd Informtion Technology (EMEIT-212) Complete Coverge Pth Plnning of Mobile Robot Bsed on Dynmic Progrmming Algorithm Peng Zhou, Zhong-min

More information

10.5 Graphing Quadratic Functions

10.5 Graphing Quadratic Functions 0.5 Grphing Qudrtic Functions Now tht we cn solve qudrtic equtions, we wnt to lern how to grph the function ssocited with the qudrtic eqution. We cll this the qudrtic function. Grphs of Qudrtic Functions

More information

File Manager Quick Reference Guide. June Prepared for the Mayo Clinic Enterprise Kahua Deployment

File Manager Quick Reference Guide. June Prepared for the Mayo Clinic Enterprise Kahua Deployment File Mnger Quick Reference Guide June 2018 Prepred for the Myo Clinic Enterprise Khu Deployment NVIGTION IN FILE MNGER To nvigte in File Mnger, users will mke use of the left pne to nvigte nd further pnes

More information

Fig.1. Let a source of monochromatic light be incident on a slit of finite width a, as shown in Fig. 1.

Fig.1. Let a source of monochromatic light be incident on a slit of finite width a, as shown in Fig. 1. Answer on Question #5692, Physics, Optics Stte slient fetures of single slit Frunhofer diffrction pttern. The slit is verticl nd illuminted by point source. Also, obtin n expression for intensity distribution

More information

L. Yaroslavsky. Fundamentals of Digital Image Processing. Course

L. Yaroslavsky. Fundamentals of Digital Image Processing. Course L. Yroslvsky. Fundmentls of Digitl Imge Processing. Course 0555.330 Lecture. Imge enhncement.. Imge enhncement s n imge processing tsk. Clssifiction of imge enhncement methods Imge enhncement is processing

More information

6.3 Volumes. Just as area is always positive, so is volume and our attitudes towards finding it.

6.3 Volumes. Just as area is always positive, so is volume and our attitudes towards finding it. 6.3 Volumes Just s re is lwys positive, so is volume nd our ttitudes towrds finding it. Let s review how to find the volume of regulr geometric prism, tht is, 3-dimensionl oject with two regulr fces seprted

More information

1 Quad-Edge Construction Operators

1 Quad-Edge Construction Operators CS48: Computer Grphics Hndout # Geometric Modeling Originl Hndout #5 Stnford University Tuesdy, 8 December 99 Originl Lecture #5: 9 November 99 Topics: Mnipultions with Qud-Edge Dt Structures Scribe: Mike

More information

MATH 2530: WORKSHEET 7. x 2 y dz dy dx =

MATH 2530: WORKSHEET 7. x 2 y dz dy dx = MATH 253: WORKSHT 7 () Wrm-up: () Review: polr coordintes, integrls involving polr coordintes, triple Riemnn sums, triple integrls, the pplictions of triple integrls (especilly to volume), nd cylindricl

More information

6.2 Volumes of Revolution: The Disk Method

6.2 Volumes of Revolution: The Disk Method mth ppliction: volumes by disks: volume prt ii 6 6 Volumes of Revolution: The Disk Method One of the simplest pplictions of integrtion (Theorem 6) nd the ccumultion process is to determine so-clled volumes

More information

such that the S i cover S, or equivalently S

such that the S i cover S, or equivalently S MATH 55 Triple Integrls Fll 16 1. Definition Given solid in spce, prtition of consists of finite set of solis = { 1,, n } such tht the i cover, or equivlently n i. Furthermore, for ech i, intersects i

More information

2 Computing all Intersections of a Set of Segments Line Segment Intersection

2 Computing all Intersections of a Set of Segments Line Segment Intersection 15-451/651: Design & Anlysis of Algorithms Novemer 14, 2016 Lecture #21 Sweep-Line nd Segment Intersection lst chnged: Novemer 8, 2017 1 Preliminries The sweep-line prdigm is very powerful lgorithmic design

More information

CHAPTER III IMAGE DEWARPING (CALIBRATION) PROCEDURE

CHAPTER III IMAGE DEWARPING (CALIBRATION) PROCEDURE CHAPTER III IMAGE DEWARPING (CALIBRATION) PROCEDURE 3.1 Scheimpflug Configurtion nd Perspective Distortion Scheimpflug criterion were found out to be the best lyout configurtion for Stereoscopic PIV, becuse

More information

Topics in Analytic Geometry

Topics in Analytic Geometry Nme Chpter 10 Topics in Anltic Geometr Section 10.1 Lines Objective: In this lesson ou lerned how to find the inclintion of line, the ngle between two lines, nd the distnce between point nd line. Importnt

More information

In the last lecture, we discussed how valid tokens may be specified by regular expressions.

In the last lecture, we discussed how valid tokens may be specified by regular expressions. LECTURE 5 Scnning SYNTAX ANALYSIS We know from our previous lectures tht the process of verifying the syntx of the progrm is performed in two stges: Scnning: Identifying nd verifying tokens in progrm.

More information

Unit #9 : Definite Integral Properties, Fundamental Theorem of Calculus

Unit #9 : Definite Integral Properties, Fundamental Theorem of Calculus Unit #9 : Definite Integrl Properties, Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl

More information

Geometric transformations

Geometric transformations Geometric trnsformtions Computer Grphics Some slides re bsed on Shy Shlom slides from TAU mn n n m m T A,,,,,, 2 1 2 22 12 1 21 11 Rows become columns nd columns become rows nm n n m m A,,,,,, 1 1 2 22

More information

Tilt-Sensing with Kionix MEMS Accelerometers

Tilt-Sensing with Kionix MEMS Accelerometers Tilt-Sensing with Kionix MEMS Accelerometers Introduction Tilt/Inclintion sensing is common ppliction for low-g ccelerometers. This ppliction note describes how to use Kionix MEMS low-g ccelerometers to

More information

9 Graph Cutting Procedures

9 Graph Cutting Procedures 9 Grph Cutting Procedures Lst clss we begn looking t how to embed rbitrry metrics into distributions of trees, nd proved the following theorem due to Brtl (1996): Theorem 9.1 (Brtl (1996)) Given metric

More information

Pythagoras theorem and trigonometry (2)

Pythagoras theorem and trigonometry (2) HPTR 10 Pythgors theorem nd trigonometry (2) 31 HPTR Liner equtions In hpter 19, Pythgors theorem nd trigonometry were used to find the lengths of sides nd the sizes of ngles in right-ngled tringles. These

More information

50 AMC LECTURES Lecture 2 Analytic Geometry Distance and Lines. can be calculated by the following formula:

50 AMC LECTURES Lecture 2 Analytic Geometry Distance and Lines. can be calculated by the following formula: 5 AMC LECTURES Lecture Anlytic Geometry Distnce nd Lines BASIC KNOWLEDGE. Distnce formul The distnce (d) between two points P ( x, y) nd P ( x, y) cn be clculted by the following formul: d ( x y () x )

More information

An Efficient Divide and Conquer Algorithm for Exact Hazard Free Logic Minimization

An Efficient Divide and Conquer Algorithm for Exact Hazard Free Logic Minimization An Efficient Divide nd Conquer Algorithm for Exct Hzrd Free Logic Minimiztion J.W.J.M. Rutten, M.R.C.M. Berkelr, C.A.J. vn Eijk, M.A.J. Kolsteren Eindhoven University of Technology Informtion nd Communiction

More information

USING HOUGH TRANSFORM IN LINE EXTRACTION

USING HOUGH TRANSFORM IN LINE EXTRACTION Stylinidis, Efstrtios USING HOUGH TRANSFORM IN LINE EXTRACTION Efstrtios STYLIANIDIS, Petros PATIAS The Aristotle University of Thessloniki, Deprtment of Cdstre Photogrmmetry nd Crtogrphy Univ. Box 473,

More information

On the Detection of Step Edges in Algorithms Based on Gradient Vector Analysis

On the Detection of Step Edges in Algorithms Based on Gradient Vector Analysis On the Detection of Step Edges in Algorithms Bsed on Grdient Vector Anlysis A. Lrr6, E. Montseny Computer Engineering Dept. Universitt Rovir i Virgili Crreter de Slou sin 43006 Trrgon, Spin Emil: lrre@etse.urv.es

More information

Section 3.1: Sequences and Series

Section 3.1: Sequences and Series Section.: Sequences d Series Sequences Let s strt out with the definition of sequence: sequence: ordered list of numbers, often with definite pttern Recll tht in set, order doesn t mtter so this is one

More information

MATH 25 CLASS 5 NOTES, SEP

MATH 25 CLASS 5 NOTES, SEP MATH 25 CLASS 5 NOTES, SEP 30 2011 Contents 1. A brief diversion: reltively prime numbers 1 2. Lest common multiples 3 3. Finding ll solutions to x + by = c 4 Quick links to definitions/theorems Euclid

More information

3.5.1 Single slit diffraction

3.5.1 Single slit diffraction 3..1 Single slit diffrction ves pssing through single slit will lso diffrct nd produce n interference pttern. The reson for this is to do with the finite width of the slit. e will consider this lter. Tke

More information

Chapter 2 Sensitivity Analysis: Differential Calculus of Models

Chapter 2 Sensitivity Analysis: Differential Calculus of Models Chpter 2 Sensitivity Anlysis: Differentil Clculus of Models Abstrct Models in remote sensing nd in science nd engineering, in generl re, essentilly, functions of discrete model input prmeters, nd/or functionls

More information

3.5.1 Single slit diffraction

3.5.1 Single slit diffraction 3.5.1 Single slit diffrction Wves pssing through single slit will lso diffrct nd produce n interference pttern. The reson for this is to do with the finite width of the slit. We will consider this lter.

More information

Before We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1):

Before We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1): Overview (): Before We Begin Administrtive detils Review some questions to consider Winter 2006 Imge Enhncement in the Sptil Domin: Bsics of Sptil Filtering, Smoothing Sptil Filters, Order Sttistics Filters

More information

Hyperbolas. Definition of Hyperbola

Hyperbolas. Definition of Hyperbola CHAT Pre-Clculus Hyperols The third type of conic is clled hyperol. For n ellipse, the sum of the distnces from the foci nd point on the ellipse is fixed numer. For hyperol, the difference of the distnces

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology

More information

Digital Design. Chapter 6: Optimizations and Tradeoffs

Digital Design. Chapter 6: Optimizations and Tradeoffs Digitl Design Chpter 6: Optimiztions nd Trdeoffs Slides to ccompny the tetbook Digitl Design, with RTL Design, VHDL, nd Verilog, 2nd Edition, by Frnk Vhid, John Wiley nd Sons Publishers, 2. http://www.ddvhid.com

More information

Cone Cluster Labeling for Support Vector Clustering

Cone Cluster Labeling for Support Vector Clustering Cone Cluster Lbeling for Support Vector Clustering Sei-Hyung Lee Deprtment of Computer Science University of Msschusetts Lowell MA 1854, U.S.A. slee@cs.uml.edu Kren M. Dniels Deprtment of Computer Science

More information

A New Learning Algorithm for the MAXQ Hierarchical Reinforcement Learning Method

A New Learning Algorithm for the MAXQ Hierarchical Reinforcement Learning Method A New Lerning Algorithm for the MAXQ Hierrchicl Reinforcement Lerning Method Frzneh Mirzzdeh 1, Bbk Behsz 2, nd Hmid Beigy 1 1 Deprtment of Computer Engineering, Shrif University of Technology, Tehrn,

More information

Computing offsets of freeform curves using quadratic trigonometric splines

Computing offsets of freeform curves using quadratic trigonometric splines Computing offsets of freeform curves using qudrtic trigonometric splines JIULONG GU, JAE-DEUK YUN, YOONG-HO JUNG*, TAE-GYEONG KIM,JEONG-WOON LEE, BONG-JUN KIM School of Mechnicl Engineering Pusn Ntionl

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology

More information

If f(x, y) is a surface that lies above r(t), we can think about the area between the surface and the curve.

If f(x, y) is a surface that lies above r(t), we can think about the area between the surface and the curve. Line Integrls The ide of line integrl is very similr to tht of single integrls. If the function f(x) is bove the x-xis on the intervl [, b], then the integrl of f(x) over [, b] is the re under f over the

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology

More information

Answer Key Lesson 6: Workshop: Angles and Lines

Answer Key Lesson 6: Workshop: Angles and Lines nswer Key esson 6: tudent Guide ngles nd ines Questions 1 3 (G p. 406) 1. 120 ; 360 2. hey re the sme. 3. 360 Here re four different ptterns tht re used to mke quilts. Work with your group. se your Power

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology

More information

Graphing Conic Sections

Graphing Conic Sections Grphing Conic Sections Definition of Circle Set of ll points in plne tht re n equl distnce, clled the rdius, from fixed point in tht plne, clled the center. Grphing Circle (x h) 2 + (y k) 2 = r 2 where

More information

A Transportation Problem Analysed by a New Ranking Method

A Transportation Problem Analysed by a New Ranking Method (IJIRSE) Interntionl Journl of Innovtive Reserch in Science & Engineering ISSN (Online) 7-07 A Trnsporttion Problem Anlysed by New Rnking Method Dr. A. Shy Sudh P. Chinthiy Associte Professor PG Scholr

More information

Epson Projector Content Manager Operation Guide

Epson Projector Content Manager Operation Guide Epson Projector Content Mnger Opertion Guide Contents 2 Introduction to the Epson Projector Content Mnger Softwre 3 Epson Projector Content Mnger Fetures... 4 Setting Up the Softwre for the First Time

More information

Modeling and Simulation of Short Range 3D Triangulation-Based Laser Scanning System

Modeling and Simulation of Short Range 3D Triangulation-Based Laser Scanning System Modeling nd Simultion of Short Rnge 3D Tringultion-Bsed Lser Scnning System Theodor Borngiu Anmri Dogr Alexndru Dumitrche April 14, 2008 Abstrct In this pper, simultion environment for short rnge 3D lser

More information

4452 Mathematical Modeling Lecture 4: Lagrange Multipliers

4452 Mathematical Modeling Lecture 4: Lagrange Multipliers Mth Modeling Lecture 4: Lgrnge Multipliers Pge 4452 Mthemticl Modeling Lecture 4: Lgrnge Multipliers Lgrnge multipliers re high powered mthemticl technique to find the mximum nd minimum of multidimensionl

More information

Accelerating 3D convolution using streaming architectures on FPGAs

Accelerating 3D convolution using streaming architectures on FPGAs Accelerting 3D convolution using streming rchitectures on FPGAs Hohun Fu, Robert G. Clpp, Oskr Mencer, nd Oliver Pell ABSTRACT We investigte FPGA rchitectures for ccelerting pplictions whose dominnt cost

More information

Naming 3D objects. 1 Name the 3D objects labelled in these models. Use the word bank to help you.

Naming 3D objects. 1 Name the 3D objects labelled in these models. Use the word bank to help you. Nming 3D ojects 1 Nme the 3D ojects lelled in these models. Use the word nk to help you. Word nk cue prism sphere cone cylinder pyrmid D A C F A B C D cone cylinder cue cylinder E B E prism F cue G G pyrmid

More information

AVolumePreservingMapfromCubetoOctahedron

AVolumePreservingMapfromCubetoOctahedron Globl Journl of Science Frontier Reserch: F Mthemtics nd Decision Sciences Volume 18 Issue 1 Version 1.0 er 018 Type: Double Blind Peer Reviewed Interntionl Reserch Journl Publisher: Globl Journls Online

More information

Surfaces. Differential Geometry Lia Vas

Surfaces. Differential Geometry Lia Vas Differentil Geometry Li Vs Surfces When studying curves, we studied how the curve twisted nd turned in spce. We now turn to surfces, two-dimensionl objects in three-dimensionl spce nd exmine how the concept

More information

Slides for Data Mining by I. H. Witten and E. Frank

Slides for Data Mining by I. H. Witten and E. Frank Slides for Dt Mining y I. H. Witten nd E. Frnk Simplicity first Simple lgorithms often work very well! There re mny kinds of simple structure, eg: One ttriute does ll the work All ttriutes contriute eqully

More information

Lecture 7: Building 3D Models (Part 1) Prof Emmanuel Agu. Computer Science Dept. Worcester Polytechnic Institute (WPI)

Lecture 7: Building 3D Models (Part 1) Prof Emmanuel Agu. Computer Science Dept. Worcester Polytechnic Institute (WPI) Computer Grphics (CS 4731) Lecture 7: Building 3D Models (Prt 1) Prof Emmnuel Agu Computer Science Dept. Worcester Polytechnic Institute (WPI) Stndrd d Unit itvectors Define y i j 1,0,0 0,1,0 k i k 0,0,1

More information

Essential Question What are some of the characteristics of the graph of a rational function?

Essential Question What are some of the characteristics of the graph of a rational function? 8. TEXAS ESSENTIAL KNOWLEDGE AND SKILLS A..A A..G A..H A..K Grphing Rtionl Functions Essentil Question Wht re some of the chrcteristics of the grph of rtionl function? The prent function for rtionl functions

More information

3 4. Answers may vary. Sample: Reteaching Vertical s are.

3 4. Answers may vary. Sample: Reteaching Vertical s are. Chpter 7 Answers Alterntive Activities 7-2 1 2. Check students work. 3. The imge hs length tht is 2 3 tht of the originl segment nd is prllel to the originl segment. 4. The segments pss through the endpoints

More information

Angle Properties in Polygons. Part 1 Interior Angles

Angle Properties in Polygons. Part 1 Interior Angles 2.4 Angle Properties in Polygons YOU WILL NEED dynmic geometry softwre OR protrctor nd ruler EXPLORE A pentgon hs three right ngles nd four sides of equl length, s shown. Wht is the sum of the mesures

More information

Overview. Network characteristics. Network architecture. Data dissemination. Network characteristics (cont d) Mobile computing and databases

Overview. Network characteristics. Network architecture. Data dissemination. Network characteristics (cont d) Mobile computing and databases Overview Mobile computing nd dtbses Generl issues in mobile dt mngement Dt dissemintion Dt consistency Loction dependent queries Interfces Detils of brodcst disks thlis klfigopoulos Network rchitecture

More information

9 4. CISC - Curriculum & Instruction Steering Committee. California County Superintendents Educational Services Association

9 4. CISC - Curriculum & Instruction Steering Committee. California County Superintendents Educational Services Association 9. CISC - Curriculum & Instruction Steering Committee The Winning EQUATION A HIGH QUALITY MATHEMATICS PROFESSIONAL DEVELOPMENT PROGRAM FOR TEACHERS IN GRADES THROUGH ALGEBRA II STRAND: NUMBER SENSE: Rtionl

More information

Easy Interactive Tools Ver.3.0 Operation Guide

Easy Interactive Tools Ver.3.0 Operation Guide Esy Interctive Tools Ver.3.0 Opertion Guide Esy Interctive Tools Summry 2 Fetures Esy Interctive Tools is n ppliction tht llows you to drw on projected imges. By using the interctive pen supplied with

More information

8.2 Areas in the Plane

8.2 Areas in the Plane 39 Chpter 8 Applictions of Definite Integrls 8. Ares in the Plne Wht ou will lern out... Are Between Curves Are Enclosed Intersecting Curves Boundries with Chnging Functions Integrting with Respect to

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology

More information

2014 Haskell January Test Regular Expressions and Finite Automata

2014 Haskell January Test Regular Expressions and Finite Automata 0 Hskell Jnury Test Regulr Expressions nd Finite Automt This test comprises four prts nd the mximum mrk is 5. Prts I, II nd III re worth 3 of the 5 mrks vilble. The 0 Hskell Progrmming Prize will be wrded

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology

More information

12-B FRACTIONS AND DECIMALS

12-B FRACTIONS AND DECIMALS -B Frctions nd Decimls. () If ll four integers were negtive, their product would be positive, nd so could not equl one of them. If ll four integers were positive, their product would be much greter thn

More information

Chapter Spline Method of Interpolation More Examples Electrical Engineering

Chapter Spline Method of Interpolation More Examples Electrical Engineering Chpter. Spline Method of Interpoltion More Exmples Electricl Engineering Exmple Thermistors re used to mesure the temperture of bodies. Thermistors re bsed on mterils chnge in resistnce with temperture.

More information

Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming

Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming Lecture 10 Evolutionry Computtion: Evolution strtegies nd genetic progrmming Evolution strtegies Genetic progrmming Summry Negnevitsky, Person Eduction, 2011 1 Evolution Strtegies Another pproch to simulting

More information

OUTPUT DELIVERY SYSTEM

OUTPUT DELIVERY SYSTEM Differences in ODS formtting for HTML with Proc Print nd Proc Report Lur L. M. Thornton, USDA-ARS, Animl Improvement Progrms Lortory, Beltsville, MD ABSTRACT While Proc Print is terrific tool for dt checking

More information

PNC NC code PROGRAMMER'S MANUAL

PNC NC code PROGRAMMER'S MANUAL PNC-3200 NC code PROGRAMMER'S MANUAL Thnk you very much for purchsing the PNC-3200. To ensure correct nd sfe usge with full understnding of this product's performnce, plese be sure to red through this

More information

Subtracting Fractions

Subtracting Fractions Lerning Enhncement Tem Model Answers: Adding nd Subtrcting Frctions Adding nd Subtrcting Frctions study guide. When the frctions both hve the sme denomintor (bottom) you cn do them using just simple dding

More information

arxiv: v1 [cs.cg] 9 Dec 2016

arxiv: v1 [cs.cg] 9 Dec 2016 Some Counterexmples for Comptible Tringultions rxiv:62.0486v [cs.cg] 9 Dec 206 Cody Brnson Dwn Chndler 2 Qio Chen 3 Christin Chung 4 Andrew Coccimiglio 5 Sen L 6 Lily Li 7 Aïn Linn 8 Ann Lubiw 9 Clre Lyle

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology

More information

Lab 1 - Counter. Create a project. Add files to the project. Compile design files. Run simulation. Debug results

Lab 1 - Counter. Create a project. Add files to the project. Compile design files. Run simulation. Debug results 1 L 1 - Counter A project is collection mechnism for n HDL design under specifiction or test. Projects in ModelSim ese interction nd re useful for orgnizing files nd specifying simultion settings. The

More information

SOME EXAMPLES OF SUBDIVISION OF SMALL CATEGORIES

SOME EXAMPLES OF SUBDIVISION OF SMALL CATEGORIES SOME EXAMPLES OF SUBDIVISION OF SMALL CATEGORIES MARCELLO DELGADO Abstrct. The purpose of this pper is to build up the bsic conceptul frmework nd underlying motivtions tht will llow us to understnd ctegoricl

More information

SUPPLEMENTARY INFORMATION

SUPPLEMENTARY INFORMATION Supplementry Figure y (m) x (m) prllel perpendiculr Distnce (m) Bird Stndrd devition for distnce (m) c 6 prllel perpendiculr 4 doi:.8/nture99 SUPPLEMENTARY FIGURE Confirmtion tht movement within the flock

More information

A Comparison of the Discretization Approach for CST and Discretization Approach for VDM

A Comparison of the Discretization Approach for CST and Discretization Approach for VDM Interntionl Journl of Innovtive Reserch in Advnced Engineering (IJIRAE) Volume1 Issue1 (Mrch 2014) A Comprison of the Discretiztion Approch for CST nd Discretiztion Approch for VDM Omr A. A. Shib Fculty

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology

More information

Midterm 2 Sample solution

Midterm 2 Sample solution Nme: Instructions Midterm 2 Smple solution CMSC 430 Introduction to Compilers Fll 2012 November 28, 2012 This exm contins 9 pges, including this one. Mke sure you hve ll the pges. Write your nme on the

More information

MTH 146 Conics Supplement

MTH 146 Conics Supplement 105- Review of Conics MTH 146 Conics Supplement In this section we review conics If ou ne more detils thn re present in the notes, r through section 105 of the ook Definition: A prol is the set of points

More information

Grade 7/8 Math Circles Geometric Arithmetic October 31, 2012

Grade 7/8 Math Circles Geometric Arithmetic October 31, 2012 Fculty of Mthemtics Wterloo, Ontrio N2L 3G1 Grde 7/8 Mth Circles Geometric Arithmetic Octoer 31, 2012 Centre for Eduction in Mthemtics nd Computing Ancient Greece hs given irth to some of the most importnt

More information

Math 142, Exam 1 Information.

Math 142, Exam 1 Information. Mth 14, Exm 1 Informtion. 9/14/10, LC 41, 9:30-10:45. Exm 1 will be bsed on: Sections 7.1-7.5. The corresponding ssigned homework problems (see http://www.mth.sc.edu/ boyln/sccourses/14f10/14.html) At

More information

AML710 CAD LECTURE 16 SURFACES. 1. Analytical Surfaces 2. Synthetic Surfaces

AML710 CAD LECTURE 16 SURFACES. 1. Analytical Surfaces 2. Synthetic Surfaces AML7 CAD LECTURE 6 SURFACES. Anlticl Surfces. Snthetic Surfces Surfce Representtion From CAD/CAM point of view surfces re s importnt s curves nd solids. We need to hve n ide of curves for surfce cretion.

More information

Engineer To Engineer Note

Engineer To Engineer Note Engineer To Engineer Note EE-169 Technicl Notes on using Anlog Devices' DSP components nd development tools Contct our technicl support by phone: (800) ANALOG-D or e-mil: dsp.support@nlog.com Or visit

More information

P(r)dr = probability of generating a random number in the interval dr near r. For this probability idea to make sense we must have

P(r)dr = probability of generating a random number in the interval dr near r. For this probability idea to make sense we must have Rndom Numers nd Monte Crlo Methods Rndom Numer Methods The integrtion methods discussed so fr ll re sed upon mking polynomil pproximtions to the integrnd. Another clss of numericl methods relies upon using

More information

Agilent Mass Hunter Software

Agilent Mass Hunter Software Agilent Mss Hunter Softwre Quick Strt Guide Use this guide to get strted with the Mss Hunter softwre. Wht is Mss Hunter Softwre? Mss Hunter is n integrl prt of Agilent TOF softwre (version A.02.00). Mss

More information

ISG: Itemset based Subgraph Mining

ISG: Itemset based Subgraph Mining ISG: Itemset bsed Subgrph Mining by Lini Thoms, Stynryn R Vlluri, Kmlkr Krlplem Report No: IIIT/TR/2009/179 Centre for Dt Engineering Interntionl Institute of Informtion Technology Hyderbd - 500 032, INDIA

More information

Fig.25: the Role of LEX

Fig.25: the Role of LEX The Lnguge for Specifying Lexicl Anlyzer We shll now study how to uild lexicl nlyzer from specifiction of tokens in the form of list of regulr expressions The discussion centers round the design of n existing

More information

A REINFORCEMENT LEARNING APPROACH TO SCHEDULING DUAL-ARMED CLUSTER TOOLS WITH TIME VARIATIONS

A REINFORCEMENT LEARNING APPROACH TO SCHEDULING DUAL-ARMED CLUSTER TOOLS WITH TIME VARIATIONS A REINFORCEMENT LEARNING APPROACH TO SCHEDULING DUAL-ARMED CLUSTER TOOLS WITH TIME VARIATIONS Ji-Eun Roh (), Te-Eog Lee (b) (),(b) Deprtment of Industril nd Systems Engineering, Kore Advnced Institute

More information

A Heuristic Approach for Discovering Reference Models by Mining Process Model Variants

A Heuristic Approach for Discovering Reference Models by Mining Process Model Variants A Heuristic Approch for Discovering Reference Models by Mining Process Model Vrints Chen Li 1, Mnfred Reichert 2, nd Andres Wombcher 3 1 Informtion System Group, University of Twente, The Netherlnds lic@cs.utwente.nl

More information

Integration. October 25, 2016

Integration. October 25, 2016 Integrtion October 5, 6 Introduction We hve lerned in previous chpter on how to do the differentition. It is conventionl in mthemtics tht we re supposed to lern bout the integrtion s well. As you my hve

More information

Engineer-to-Engineer Note

Engineer-to-Engineer Note Engineer-to-Engineer Note EE-295 Technicl notes on using Anlog Devices DSPs, processors nd development tools Visit our Web resources http://www.nlog.com/ee-notes nd http://www.nlog.com/processors or e-mil

More information