Extended Space Mapping with Bézier Patches and Volumes
|
|
- Bartholomew Greer
- 5 years ago
- Views:
Transcription
1 Eteded Space Mappig with Béier Patches ad Volumes Bejami Schmitt 1, 2 Aleader Pasko 1 Vladimir Savcheko 1 Abstract We eplore a geeral eteded space mappig as a framework for trasformig a hypersurface i the coordiate-fuctio space with the followig projectio oto the geometric coordiate space to get the resultig implicit surface. Béier patches ad volumes allow for the iteractive modelig of comple shapes. We use them to defie geometric solids with the fuctio represetatio (F-rep) i 2D ad 3D space respectively. The positios of the cotrol poits i the coordiate-fuctio space are both used to maipulate fuctio values ad to defie space trasformatios. Because Béier primitives are parametrically defied, it is very difficult to cotrol their behavior outside of the domai of iterest. Hece, we apply fuctioal clippig to make the fuctio positive oly iside the domai. If the cotrol poits are moved i the coordiate space, we apply a eteded Béier clippig for the iverse mappig. We preset a iteractive modeler for Béier patches ad volumes with which we are able to desig comple 2D/3D F-rep objects. CR Categories ad Subject Descriptors: [Computer Graphics]: Computatioal Geometry ad Object Modelig Curve, Surface, ad Object Represetatios. Additioal Keywords: Shape Modelig Implicit Surfaces F-rep Eteded Space Space Mappig Fuctio Mappig Iteractivity. 1: Laboratory of Shape Modelig Uiversity of Aiu, Aiu-Wakamatsu City, Fukushima Prefecture , Japa {pasko,savche}@u-aiu.ac.jp 2: Uiversité de Roue, Facultés des Scieces IUP Géie Mathématiques et Iformatique Roue Frace schmitt_bejami@hotmail.com Implicit@ Surfaces 99, Eurographics/ACM SIGGRAPH Workshop (Bordeau, Frace, September ), J.Hughes ad C. Schlick (Eds.), pp INTRODUCTION Differet ways eist for represetig comple shapes. Parametric represetatios of curves ad surfaces are the most commo oes i geometric modelig ad computer graphics. Aother way to represet solids is to use implicit surfaces. Usually, the set of primitive implicit shapes is restricted by quadrics, tori, superquadratics, ad skeleto-based models. To model a comple irregular shape with skeleto-based implicits, oe should usually use may skeleto primitives. I this paper, we propose to model a comple shape with oly oe primitive. We defie primitive solids by miig two represetatios: parametric ad implicit surfaces. Oe of the mai advatages of the first is that it leads to a desig paradigm based o a cotrol-poit array, ad the secod allows the use of multiple geometric operatios [2,6]. We choose Béier patches ad volumes as parametric fuctios because of the simplicity of calculatio. We use them to defie geometric solids i 2D ad 3D spaces respectively. This approach has already bee applied to costruct piecewise algebraic surfaces [8,9,10] ad thick free-form shells [4]. I cotrast, we wish to use them i fuctioally based costructive modelig. The positios of the cotrol poits i the coordiatefuctio space are both used to maipulate fuctio values ad to defie space trasformatios. I this sese, the proposed techique falls ito the category of a geeral eteded space mappig. Because Béier primitives are parametrically defied, it is very difficult to cotrol their behavior outside of the domai of iterest. Hece, we apply fuctioal clippig to make the fuctio positive oly iside the domai. It is implemeted usig R- fuctio based set-theoretic itersectio with the uit square/cube. This turs the modeled object ito the fuctio represetatio (Frep) rather tha a traditioal implicit surface [6]. We the defie a iverse mappig to establish a correspodece betwee the coordiate space ad the parameter space. If the cotrol poits are placed i the rectagular grid, this is just a scalig operatio, but if the cotrol poits are moved i space, we apply o-liear mappig usig volume splies ad Béier clippig. We preset a iteractive modeler for Béier patches ad volumes with which we are able to desig comple 2D/3D F-rep objects. 2 EXTENDED SPACE MAPPING A space mappig establishes a oe-to-oe correspodece betwee poits of a give space ad, if applied to some poit set i the space, it chages this set to a differet oe. A mappig ca be defied by the fuctioal depedece betwee the ew ad old coordiates of poits.
2 ξ S 3.1 Parametric Béier Patches ad Volumes 0 A B A B Figure 1: Trasformig a 1D segmet AB ito A B by applyig eteded space mappig to a curve S defied as ξ = f(). Here, we discuss the eample illustrated by Fig.1. The itetio is to model a 1D geometric object (a lie segmet AB) o the -ais, ad the to trasform it to A B. Let us itroduce a fuctio of oe variable ξ = f(). It defies the segmet AB as f() 0. At the same time, it defies a curve S i the (, ξ) plae. We call this plae a eteded space, because it has a geometric coordiate ad a additioal fuctio coordiate. The segmet AB ca be also cosidered as a projectio of the part of the curve S, which is above the -ais. Now, let us traslate the curve S to S as it is show i Fig. 1. By doig this, we map the eteded space (, ξ) oto itself ad thus defie a eteded space mappig. Now, the segmet A B ca be also cosidered as the projectio of the part of the curve S, which is above the -ais. Therefore, we trasformed AB to A B with the sigle eteded space mappig. Note that, to obtai this trasformatio with mappigs of the coordiate oly, oe has to thik of some compositio of 1D traslatio ad scalig. We itroduced the geeral defiitio of eteded space mappigs i [2]. A short formal itroductio to it ca be foud i the Appedi. The curve S i Fig. 1 ca be defied parametrically. The, by movig its cotrol poits vertically (fuctio mappig) ad horiotally (space mappig) oe ca itroduce differet eteded space mappigs ad correspodigly trasform the segmet AB (eve ca break it ito two or more segmets!). The subject of this paper is to itroduce ad implemet eteded space mappigs for modelig 2D ad 3D objects with Béier patches ad volumes. 3 BEZIER SOLIDS We cosider a defiitio of a closed subset of -dimesioal Euclidea space E by the iequality f( 1, 2,, ) 0, where f is a real cotiuous fuctio o E. We call f the defiig fuctio. The above iequality is the fuctio represetatio (F-rep) of a geometric solid. It allows for the followig defiitio of - dimesioal solid i E space: f(x) > 0 for poits iside the solid, f(x) = 0 for poits o the solid s boudary (a implicit curve i 2D ad a implicit surface i 3D), f(x) < 0 for poits outside the solid, where X = ( 1, 2,, ) is a poit of E. S A Béier patch S(u, is defied as follows: m S( u, = B B ( P, i= 0 j= 0 where P ij are 3-dimesioal poits, called cotrol poits ad B i (i=0..) are Berstei basis fuctios, defied by i i Bi ( t) = ( t) t i 1. Similarly, a Béier volume is defied as follows: S( u, B j ( ( k, i= 0 j= 0k= 0 where P are 4-dimesioal poits i this case. 3.2 F-rep with Béier Patches ad Volumes Here, we follow the defiitios of F-rep solids usig parametric patches ad volumes give i [1]. To defie a 2D solid by f(,y) 0 i the domai {(,y) : 0 (,y) 1}, we assume that the ad y coordiates of S(u, are S (u, ad S y (u, ad ca be epressed as follows: = Bi B j ( i= 0 j = 0 = u i y j i. e.: =, P ij = y y = Bi B j ( i= 0 j = 0 = v The, the -coordiate of S(u,, S (u,, ca be used to defie a 2D solid as f(,y) = S (u,. A Béier patch ad its correspodig 2D solid are show i Fig. 2. We ca apply a fuctio mappig to the 2D solid by movig cotrol poits of the patch vertically ad thus chagig fuctio values. i j ij f(,y) 0 Figure 2: A Béier patch ad a correspodig 2D solid.
3 Similarly, to defie a 3D solid f(,y,) 0 i the domai { (,y,) : 0,y, 1 }, we assume that the, y ad coordiates of S(u,, S (u,, S y (u, ad S (u,, are: B j ( ( k = u i= 0 j = 0k = 0 y y B j ( ( k = v i= 0 j = 0k = 0 B j ( ( k = w i= 0 j = 0k = 0 i y j k where P ad P =, P = l m =. The ξ coordiate of S(u,, S ξ (u,, is the used to defie a 3D solid as follows: f(,y,) = S ξ (u,. We ca modify the 3D solid by chagig the ξ coordiate (the fuctio value) i cotrol poits of the volume. 3.3 Fuctioal Clippig ad Iverse Mappig At this stage, we are able to defie a Béier solid. Nevertheless, the behavior of the parametric fuctio outside the domai is difficult to cotrol ad the shape of the domai, i.e., the uit square or the uit cube, is too restrictive. Hece, we use a fuctioal clippig ad the a iverse mappig to overcome these two udesirable properties. ad & is the symbol of the itersectio operatio defied with the R-fuctio [6,7] as: 2 2 G = g1 & g 2 = g1 + g 2 g1 + g 2. The result of this procedure is illustrated by Fig. 4 (usig the same patch as i Fig. 3). The defiig fuctio is egative outside the domai, ad the desirable 2D solid is uchaged. Figure 4: 2D Béier solid after the fuctioal clippig. The same procedure has to be applied i the 3D case: Sclip ( u, = S( u, & Fs ( u, where Fs ( u, = Fb & Fb ( & Fb ( is the uit cube. Fuctioal clippig allows us to defie closed solids as show i Fig. 5. We did ot apply fuctioal clippig to the volume o the left. Its boudary is ot a closed surface i the domai. Whereas, with the volume o the right, fuctioal clippig was applied, ad the 3D solid as well as its boudary are clearly defied Fuctioal Clippig Fig. 3 shows a Béier patch ad its correspodig 2D solid, which is bouded by the itersectio curve (cotour) of the patch with the plae f = 0. The patch was costructed to produce oly oe closed implicit curve i the uit-square. As it ca be observed, the behavior of the parametric fuctio outside the domai cotradicts the requiremet of egative values of a defiig fuctio for poits outside the defied object. It results i udesirable ( ghost ) ero-valued cotours outside the uit square. Figure 5: Surfaces of 3D Béier solids i the uit cube. The left oe without fuctioal clippig, the right oe with fuctioal clippig. I our implemetatio, the procedures defiig parametric patches ad volumes ecapsulate the itroduced fuctioal clippig. Oce a solid is modeled, this allows us to apply ay operatio provided by a F-rep modeler to it Iverse Mappig Figure 3: Béier patch ad 2D solid without fuctioal clippig. Let S(u, be a fuctio defiig a parametric patch where S(u, = S (u,. Cosider the itersectio betwee the uit-square ad the 2D solid defied by this fuctio: S( u, & F ( u, clip = where F s (u, = F b (u) & F b ( is a defiig fuctio of the uitsquare with F b defiig the uit strip by each variable: F b ( t) = (1 t) t, s Here, usig a 2D solid as a eample, we deal with the trasformatio of the domai of a fuctio f(,y) defied by a parametric fuctio S(u,. The trasformatio of the domai meas that although the domai of S(u, remais a uit square, we will chage the rage of { (u,,y(u, } from a uit square to some other regio. The etesio of this method to higher dimesioal cases is straightforward. Although the domai becomes complicated, it is easy to perform fuctioal clippig operatios i the parameter space after a iverse mappig from (,y) to (u,. Arbitrary values ca be specified for the ad y coordiates of each cotrol poit, thus we ca defie a geerally shaped domai bouded by four Béier curves. Fig. 6 shows a eample
4 of the trasformatio of the domai as eplaied above. Two cotrol poits are traslated i the (,y) plae without chagig their values from the origial patch. This is oe more method of deformig a 2D solid istead of chagig its values. Béier patch, static cotrol poits poits defie a grid belogig to the (,y) plae. By chagig the value of the scalar P, the fuctio f(,y) values ad the ero- valued cotour are chaged. Because is the -coordiate of a cotrol poit, it is possible to use the traditioal visual represetatio of the patch ad the cotrol poits as show i Fig. 6, ad to displace the cotrol poits alog the -ais. I order to represet 4D cotrol poits of the Béier volume, we itroduced the color scale show i Fig.7. Fig. 8 presets a y eample of a 3D grid defied by the P, P ad P coordiates of the volume cotrol poits. Each cotrol poit is represeted by a sphere, ad the color is defied by the value of the ξ coordiate. Béier patch, moved cotrol poits ξ > 0 ξ = 0 Figure 6: 2D space mappig defied by traslatio of two cotrol poits i the (,y) plae. I order to get the values of the parameters (u, at a give poit ( 0,y 0 ), we have to calculate a itersectio poit betwee a patch S(u, ad a straight lie parallel to -ais passig through a poit ( 0,y 0,0). I other words, we have to apply a iverse space mappig to the poit ( 0,y 0 ). Several methods are available to calculate the itersectio betwee a Béier patch ad a straight lie, like the Béier clippig method proposed i [3]. The problem with usig this method is that it does ot provide for ay mappig for poits outside the domai, ad for poits iside the domai, it works too slowly. We use a iverse mappig, that is a combiatio of a approimate iverse mappig ad the Béier clippig. The procedure is as follows: 1. Apply the approimate iverse mappig to the give poit ( 0,y 0 ). This mappig uses the scattered data iterpolatio by the volume splie based o Gree s fuctio [2]. I the 2D case this is well kow as the thi plate splie. We apply this splie to iterpolate the displacemet values of ay give poit. 2. If the resultig poit (u, of the previous step lies iside the uit square, defie a boudig bo for it ad apply Béier clippig. This procedure provides a iverse mappig for ay poit, ad is faster tha pure Béier clippig for the same give accuracy. If the cotrol poits are moved so that the grid looses its regularity, the iverse mappig still works but the results are less ituitive. Figure 7: Color scale for the ξ coordiate of cotrol poits of the Béier volume. ξ>>0 ξ < 0 ξ > 0 4 INTERACTIVE MODELING 4.1 Visual Represetatio of Cotrol Poits ξ < 0 ξ = 0 For the Béier patch, the ad y coordiates of the cotrol ij Figure 8: 3D grid of colored cotrol poits of a Béier volume.
5 Figure 9: Iteractive modelig of a 2D solid. Figure 10: Screeshot of the Béier solid modeler. Desig of a fish shape with oly oe primitive.
6 4.2 Modelig Iterface We have implemeted a iteractive modeler usig Tcl/Tk for the iterface ad MAM/VRS [11] for graphics. I this sectio we illustrate mai features of the modeler Modelig 2D Solids with Béier Patches Fig. 9 shows several steps of modelig a simple 2D solid. O the left side, the grid of cotrol poits (3 3), the plae f = 0, ad the Béier patch are preseted. The color of the Béier patch reflects the fuctio values i accordace with the color scale (Fig. 7). First, the coordiate of oe of the cotrol poits is chaged to a egative value by simply draggig the sphere alog the cylider parallel to the -ais. Net, at the ed of the secod step, the four cotrol poits at the corers have egative values, ad fially, the cetral poit is pulled up with its coordiate chaged to a positive value. A ero-valued cotour, the boudary of the 2D solid, appears o the right side. The other way to deform the 2D solid is to move cotrol poits i the (,y) plae as it is show i Fig. 6. I this way, chages to both compoets of the eteded space mappig, amely the fuctio mappig ad the space mappig, are supported by the iterface Modelig 3D Solids with Béier Volumes Fig. 10 presets the iterface used to model 3D solids with Béier volumes. I this modelig iterface for Béier volumes, the user ca select a volume cross-sectio (upper area), directly chage fuctio values ad correspodig colors of the cotrols poits i the 3D grid (lower left area), ad visually cotrol the surface of the solid (lower right area). First, we select a plae i oe of the three orthogoal directios i the 3D grid of cotrol poits. The, we are able to work with this selected cross sectio, ad defie a 2D solid usig the Béier patch iterface. After repeatig this process, we ca the reder the polygoied surface of the 3D solid usig the algorithm described i [5]. I the lower left area, we ca also directly move cotrol poits i the 3D space to perform the space mappig ad chage fuctio values to perform fuctio mappigs. Figure 11: A set of ero-valued cotours ad a correspodig surface of a 3D solid modeled with a Béier volume. Fig. 11 shows a set of ero-valued cotours for a cotrol poit volume. Each cotour was modified by chagig the fourth coordiate ξ of the cotrol poits. This set gives a good idea of the resultig 3D solid, as the polygoied surface o the right shows. The cotours are updated by the system i real time, so the user ca request repolygoiatio of the surface after some sigificat chages have bee made. Figure 12: A Béier oo: a set of 3D solids modeled usig Béier volumes. 4.3 Iteractivity ad Eamples Is our modeler completely iteractive? Workig with a patch or a volume defied by less tha 10 cotrol poits o each ais, ad without usig a space mappig, the aswer is yes. I this case there is o delay betwee the modificatios beig made ad the visible result. Updates to the Béier patch ad ero-valued cotour are doe i real time. Polygoiatio is still too slow to be doe i real time. It takes 3 sec to polygoie the surface for the cotrol poit volume with polygoiatio grid o a 400 MH Petium II computer. If the umber of cotrol poits grows to become greater tha 10, or if a space mappig is applied, real time visualiatio becomes impossible. Before the implemetatio of this software, we wodered if it was possible to implemet a ituitive modeler, because the modelig techiques we use differ from stadard modelig techiques. Our eperiece shows that the proposed modelig paradigm is quite ituitive, ad usig it to desig comple solids becomes easy. We have produced may shapes usig our modeler (see Fig. 12). Note that each shape i this oo is defied by a sigle primitive. It would require may skeletal elemets, or may solid primitives as well as bledig set operatios to model each of these solids i the traditioal maer.
7 5 CONCLUSION We have developed a ew techique of modelig F-rep solids usig parametrically defied free-form patches ad volumes. Eve though the fuctio represetatio for geometric solids is widely used, there are difficulties with iteractive modificatio of F-rep solids. I order to overcome these difficulties, we use parametrically defied patches ad volumes with fuctioal clippig ad the combiatio of the o-liear iverse mappig ad Béier clippig. A etesio of this approach would be to use a piecewise model with several patches or volumes tied together. I this case a grid of uit squares/cubes is ivolved ad fuctioal clippig has ot to be applied at the shared edges/faces. We implemeted a iteractive modelig tool based o the proposed solutios. We eteded the F-rep library of the HyperFu laguage [12] with Béier solids. Our iteractive tool geerates the correspodig source code of the model i HyperFu. I this way, Béier solids ca be used to model comple F-rep objects alog with other primitives ad operatios such as set-theoretic, bledig, metamorphosis ad others [2,6]. APPENDIX. EXTENDED SPACE MAPPING Here, we provide defiitios for both eteded space ad eteded space mappigs itroduced i [2]. Cosider a +1- dimesioal Euclidea space E +1 ad a hypersurface S defied i it by a real cotiuous eplicit fuctio of variables: ξ = f( 1, 2,, ), (1) where P = ( 1, 2,, ) is a poit i the subspace E, ad P +1 = ( 1, 2,,,ξ) is a poit i E +1. The major requiremet for the fuctio f is to have at least C 0 cotiuity. The itersectio of the give hypersurface with the half space ξ 0 ad the projectio of the result alog the ξ ais oto E defie the poit set: G = { P : P +1 S,ξ 0 }. (2) Equatios 1 ad 2 together are equivalet to the more commo defiitio G = { P : f( 1, 2,, ) 0 } used i implicit ad F-rep modelig, but (1) ad (2) fit the formulatio of the eteded space mappig better. We cosider G to be a geometric object defied i the -dimesioal Euclidea space E. The space E +1 ca be called a eteded space ad ca be costructed from E by addig oe more dimesio with the ξ coordiate. A subset of G with ξ = 0 is usually called a implicit surface or a isosurface. I [2] we itroduced a geeral framework for trasformig geometric objects i E with the use of eteded space mappigs Φ:E +1 E +1 applied to the hypersurfaces (1) i E +1. Let a eteded space mappig be formulated as follows: P + 1 = Φ( P + 1 ), where P +1 = (,ξ) is a origial poit i E +1 with = ( 1, 2,, ), ad P + 1 = (,ξ ) is a poit resultig from the mappig Φ(,ξ) = (φ 1, φ 2 ). The trasformed geometric object from (2) is described by the system of equatios: = φ1(, ξ) ξ = φ2 (, ξ ) (3) ξ = f ( ) There are two compoets of the eteded space mappig: the first equatio of (3) defies a space mappig, ad the secod defies a fuctio mappig. The problem is to fid the eplicit descriptio of the trasformed object i the form: ξ = f ~ ( ), which does ot follow directly from the equatios (3). For a give, equatios (3) tur ito a system of +2 equatios with +2 variables,, ξ, ξ. Although oe ca fid the value of ξ by solvig this systeumerically for ay give poit, it is ot applicable i practice. We discussed i [2] several types of the eteded space mappig for which the fuctio ξ = f ~ ( ) ca be restored aalytically. ACKNOWLEDGEMENTS The authors would like to sicerely thak Eric Fausett for his help with the stylistic issues of this paper. We ackowledge the valuable commets by aoymous referees. REFERENCES [1] K.T. Miura, A.A. Pasko, V.V. Savcheko. Parametric patches ad volumes i the fuctioal represetatio of geometric solids, CSG 96 Coferece Proceedigs, Iformatio Geometers, Wichester, UK, , [2] V. Savcheko, A. Pasko. Trasformatio of fuctioally defied shapes by eteded space mappigs. The Visual Computer, 14: , [3] T. Nishita, T.W. Sedeberg ad M. Kakimoto. Ray tracig trimmed ratioal surfaces patches, Computer Graphics 24, 3: , August [4] J.P. Meo. Costructive shell represetatios for free-form surfaces ad solids, IEEE Computer Graphics ad Applicatios 14, 2:24-27, February [5] A.A. Pasko, V.V. Pilyugi ad V.V. Pokrovski. Geometric modelig i the aalysis of trivariate fuctios, Computers ad Graphics, 12, 3/4: , [6] A.Pasko, V. Adhie A. Souri ad V. Savcheko. Fuctio represetatio i geometric modelig: cocepts, implemetatio ad applicatios, The Visual Computer, 11: , [7] V. Shapiro. Real fuctios for represetatio of rigid solids, Computer Aided Geometric Desig 11, 2: , [8] T.W. Sederberg. Piecewise algebraic surface patches, Computer Aided Geometric Desig 2:53-59, [9] N.M.Patrikalakis ad G.A. Krieis. Piecewise cotiuous algebraic surfaces i terms of B-splies, Geometric Modelig for Product Egieerig, M.J. Woy et al. (Eds), Elsevier Sciece Publishers, 3-19, [10] A.E. Middleditch ad E. Dimas. Solid models with piecewise algebraic free-form faces, CSG 94 Coferece Proceedigs, Iformatio Geometers, Wichester, UK, , [11] MAM/VRS, [12] HyperFu,
Cubic Polynomial Curves with a Shape Parameter
roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad
More informationBezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only
Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of
More informationCreating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA
Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by
More informationA New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method
A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro
More informationConvex hull ( 凸殻 ) property
Covex hull ( 凸殻 ) property The covex hull of a set of poits S i dimesios is the itersectio of all covex sets cotaiig S. For N poits P,..., P N, the covex hull C is the give by the expressio The covex hull
More informationParametric curves. Reading. Parametric polynomial curves. Mathematical curve representation. Brian Curless CSE 457 Spring 2015
Readig Required: Agel 0.-0.3, 0.5., 0.6-0.7, 0.9 Parametric curves Bria Curless CSE 457 Sprig 05 Optioal Bartels, Beatty, ad Barsy. A Itroductio to Splies for use i Computer Graphics ad Geometric Modelig,
More informationReading. Parametric curves. Mathematical curve representation. Curves before computers. Required: Angel , , , 11.9.
Readig Required: Agel.-.3,.5.,.6-.7,.9. Optioal Parametric curves Bartels, Beatty, ad Barsky. A Itroductio to Splies for use i Computer Graphics ad Geometric Modelig, 987. Fari. Curves ad Surfaces for
More informationOctahedral Graph Scaling
Octahedral Graph Scalig Peter Russell Jauary 1, 2015 Abstract There is presetly o strog iterpretatio for the otio of -vertex graph scalig. This paper presets a ew defiitio for the term i the cotext of
More informationMATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)
MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fittig) I this chapter, we will eamie some methods of aalysis ad data processig; data obtaied as a result of a give
More informationLecture 18. Optimization in n dimensions
Lecture 8 Optimizatio i dimesios Itroductio We ow cosider the problem of miimizig a sigle scalar fuctio of variables, f x, where x=[ x, x,, x ]T. The D case ca be visualized as fidig the lowest poit of
More informationA Very Simple Approach for 3-D to 2-D Mapping
A Very Simple Approach for -D to -D appig Sadipa Dey (1 Ajith Abraham ( Sugata Sayal ( Sadipa Dey (1 Ashi Software Private Limited INFINITY Tower II 10 th Floor Plot No. - 4. Block GP Salt Lake Electroics
More informationPolymorph: Morphing Among Multiple Images
Feature Article Polymorph: Morphig Amog Multiple Images Image metamorphosis has prove to be a powerful visual effects tool. May breathtakig examples ow appear i film ad televisio, depictig the fluid trasformatio
More informationOnes Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationBOOLEAN MATHEMATICS: GENERAL THEORY
CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.
More informationOCR Statistics 1. Working with data. Section 3: Measures of spread
Notes ad Eamples OCR Statistics 1 Workig with data Sectio 3: Measures of spread Just as there are several differet measures of cetral tedec (averages), there are a variet of statistical measures of spread.
More informationConsider the following population data for the state of California. Year Population
Assigmets for Bradie Fall 2016 for Chapter 5 Assigmet sheet for Sectios 5.1, 5.3, 5.5, 5.6, 5.7, 5.8 Read Pages 341-349 Exercises for Sectio 5.1 Lagrage Iterpolatio #1, #4, #7, #13, #14 For #1 use MATLAB
More informationA SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON
A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work
More informationReading. Subdivision curves and surfaces. Subdivision curves. Chaikin s algorithm. Recommended:
Readig Recommeded: Stollitz, DeRose, ad Salesi. Wavelets for Computer Graphics: Theory ad Applicatios, 996, sectio 6.-6.3, 0., A.5. Subdivisio curves ad surfaces Note: there is a error i Stollitz, et al.,
More informationThe Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana
The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:
More informationNormals. In OpenGL the normal vector is part of the state Set by glnormal*()
Ray Tracig 1 Normals OpeG the ormal vector is part of the state Set by glnormal*() -glnormal3f(x, y, z); -glnormal3fv(p); Usually we wat to set the ormal to have uit legth so cosie calculatios are correct
More informationElementary Educational Computer
Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified
More information3D Model Retrieval Method Based on Sample Prediction
20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer
More informationPattern Recognition Systems Lab 1 Least Mean Squares
Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig
More informationAccuracy Improvement in Camera Calibration
Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z
More information9 x and g(x) = 4. x. Find (x) 3.6. I. Combining Functions. A. From Equations. Example: Let f(x) = and its domain. Example: Let f(x) = and g(x) = x x 4
1 3.6 I. Combiig Fuctios A. From Equatios Example: Let f(x) = 9 x ad g(x) = 4 f x. Fid (x) g ad its domai. 4 Example: Let f(x) = ad g(x) = x x 4. Fid (f-g)(x) B. From Graphs: Graphical Additio. Example:
More informationLecture 24: Bezier Curves and Surfaces. thou shalt be near unto me Genesis 45:10
Lecture 24: Bezier Curves ad Surfaces thou shalt be ear uto me Geesis 45:0. Iterpolatio ad Approximatio Freeform curves ad surfaces are smooth shapes ofte describig ma-made objects. The hood of a car,
More informationAlpha Individual Solutions MAΘ National Convention 2013
Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5
More informationImage Segmentation EEE 508
Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.
More informationAssignment 5; Due Friday, February 10
Assigmet 5; Due Friday, February 10 17.9b The set X is just two circles joied at a poit, ad the set X is a grid i the plae, without the iteriors of the small squares. The picture below shows that the iteriors
More informationNeural Networks A Model of Boolean Functions
Neural Networks A Model of Boolea Fuctios Berd Steibach, Roma Kohut Freiberg Uiversity of Miig ad Techology Istitute of Computer Sciece D-09596 Freiberg, Germay e-mails: steib@iformatik.tu-freiberg.de
More informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 1 Computers ad Programs 1 Objectives To uderstad the respective roles of hardware ad software i a computig system. To lear what computer scietists
More informationA Resource for Free-standing Mathematics Qualifications
Ope.ls The first sheet is show elow. It is set up to show graphs with equatios of the form = m + c At preset the values of m ad c are oth zero. You ca chage these values usig the scroll ars. Leave the
More informationSolving Fuzzy Assignment Problem Using Fourier Elimination Method
Global Joural of Pure ad Applied Mathematics. ISSN 0973-768 Volume 3, Number 2 (207), pp. 453-462 Research Idia Publicatios http://www.ripublicatio.com Solvig Fuzzy Assigmet Problem Usig Fourier Elimiatio
More informationLecture 1: Introduction and Strassen s Algorithm
5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access
More informationHandwriting Stroke Extraction Using a New XYTC Transform
Hadwritig Stroke Etractio Usig a New XYTC Trasform Gilles F. Houle 1, Kateria Bliova 1 ad M. Shridhar 1 Computer Scieces Corporatio Uiversity Michiga-Dearbor Abstract: The fudametal represetatio of hadwritig
More informationNumerical Methods Lecture 6 - Curve Fitting Techniques
Numerical Methods Lecture 6 - Curve Fittig Techiques Topics motivatio iterpolatio liear regressio higher order polyomial form expoetial form Curve fittig - motivatio For root fidig, we used a give fuctio
More informationImprovement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation
Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity
More information9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence
_9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to
More informationComputational Geometry
Computatioal Geometry Chapter 4 Liear programmig Duality Smallest eclosig disk O the Ageda Liear Programmig Slides courtesy of Craig Gotsma 4. 4. Liear Programmig - Example Defie: (amout amout cosumed
More informationMath 10C Long Range Plans
Math 10C Log Rage Plas Uits: Evaluatio: Homework, projects ad assigmets 10% Uit Tests. 70% Fial Examiatio.. 20% Ay Uit Test may be rewritte for a higher mark. If the retest mark is higher, that mark will
More informationTheory of Fuzzy Soft Matrix and its Multi Criteria in Decision Making Based on Three Basic t-norm Operators
Theory of Fuzzy Soft Matrix ad its Multi Criteria i Decisio Makig Based o Three Basic t-norm Operators Md. Jalilul Islam Modal 1, Dr. Tapa Kumar Roy 2 Research Scholar, Dept. of Mathematics, BESUS, Howrah-711103,
More informationReversible Realization of Quaternary Decoder, Multiplexer, and Demultiplexer Circuits
Egieerig Letters, :, EL Reversible Realizatio of Quaterary Decoder, Multiplexer, ad Demultiplexer Circuits Mozammel H.. Kha, Member, ENG bstract quaterary reversible circuit is more compact tha the correspodig
More informationTexture Mapping. Jian Huang. This set of slides references the ones used at Ohio State for instruction.
Texture Mappig Jia Huag This set of slides refereces the oes used at Ohio State for istructio. Ca you do this What Dreams May Come Texture Mappig Of course, oe ca model the exact micro-geometry + material
More informationThe isoperimetric problem on the hypercube
The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose
More informationArithmetic Sequences
. Arithmetic Sequeces COMMON CORE Learig Stadards HSF-IF.A. HSF-BF.A.1a HSF-BF.A. HSF-LE.A. Essetial Questio How ca you use a arithmetic sequece to describe a patter? A arithmetic sequece is a ordered
More informationHow do we evaluate algorithms?
F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:
More informationLearning to Shoot a Goal Lecture 8: Learning Models and Skills
Learig to Shoot a Goal Lecture 8: Learig Models ad Skills How do we acquire skill at shootig goals? CS 344R/393R: Robotics Bejami Kuipers Learig to Shoot a Goal The robot eeds to shoot the ball i the goal.
More informationNeuro Fuzzy Model for Human Face Expression Recognition
IOSR Joural of Computer Egieerig (IOSRJCE) ISSN : 2278-0661 Volume 1, Issue 2 (May-Jue 2012), PP 01-06 Neuro Fuzzy Model for Huma Face Expressio Recogitio Mr. Mayur S. Burage 1, Prof. S. V. Dhopte 2 1
More informationCounting the Number of Minimum Roman Dominating Functions of a Graph
Coutig the Number of Miimum Roma Domiatig Fuctios of a Graph SHI ZHENG ad KOH KHEE MENG, Natioal Uiversity of Sigapore We provide two algorithms coutig the umber of miimum Roma domiatig fuctios of a graph
More informationPerformance Plus Software Parameter Definitions
Performace Plus+ Software Parameter Defiitios/ Performace Plus Software Parameter Defiitios Chapma Techical Note-TG-5 paramete.doc ev-0-03 Performace Plus+ Software Parameter Defiitios/2 Backgroud ad Defiitios
More informationAppendix D. Controller Implementation
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Appedix D Cotroller Implemetatio Cotroller Implemetatios Combiatioal logic (sigle-cycle); Fiite state machie (multi-cycle, pipelied);
More informationCOMP 558 lecture 6 Sept. 27, 2010
Radiometry We have discussed how light travels i straight lies through space. We would like to be able to talk about how bright differet light rays are. Imagie a thi cylidrical tube ad cosider the amout
More information1 Enterprise Modeler
1 Eterprise Modeler Itroductio I BaaERP, a Busiess Cotrol Model ad a Eterprise Structure Model for multi-site cofiguratios are itroduced. Eterprise Structure Model Busiess Cotrol Models Busiess Fuctio
More informationPseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured
More informationSection 7.2: Direction Fields and Euler s Methods
Sectio 7.: Directio ields ad Euler s Methods Practice HW from Stewart Tetbook ot to had i p. 5 # -3 9-3 odd or a give differetial equatio we wat to look at was to fid its solutio. I this chapter we will
More informationThe Platonic solids The five regular polyhedra
The Platoic solids The five regular polyhedra Ole Witt-Hase jauary 7 www.olewitthase.dk Cotets. Polygos.... Topologically cosideratios.... Euler s polyhedro theorem.... Regular ets o a sphere.... The dihedral
More informationForce Network Analysis using Complementary Energy
orce Network Aalysis usig Complemetary Eergy Adrew BORGART Assistat Professor Delft Uiversity of Techology Delft, The Netherlads A.Borgart@tudelft.l Yaick LIEM Studet Delft Uiversity of Techology Delft,
More informationIMP: Superposer Integrated Morphometrics Package Superposition Tool
IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College
More information2D Isogeometric Shape Optimization considering both control point positions and weights as design variables
1 th World Cogress o tructural ad Multidiscipliary Optimizatio May 19-24, 213, Orlado, Florida, UA 2D Isogeometric hape Optimizatio cosiderig both cotrol poit positios ad weights as desig variables Yeo-Ul
More informationChapter 3 Classification of FFT Processor Algorithms
Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As
More informationCounting Regions in the Plane and More 1
Coutig Regios i the Plae ad More 1 by Zvezdelia Stakova Berkeley Math Circle Itermediate I Group September 016 1. Overarchig Problem Problem 1 Regios i a Circle. The vertices of a polygos are arraged o
More informationCSC 220: Computer Organization Unit 11 Basic Computer Organization and Design
College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:
More informationSouth Slave Divisional Education Council. Math 10C
South Slave Divisioal Educatio Coucil Math 10C Curriculum Package February 2012 12 Strad: Measuremet Geeral Outcome: Develop spatial sese ad proportioal reasoig It is expected that studets will: 1. Solve
More informationTriangular Bézier Clipping
Istitute of Scietific Computig Eidgeossische Techische Hochschule Zurich Ecole polytechique federale de Zurich Politecico federale di Zurigo Swiss Federal Istitute of Techology Zurich Computer Graphics
More informationParabolic Path to a Best Best-Fit Line:
Studet Activity : Fidig the Least Squares Regressio Lie By Explorig the Relatioship betwee Slope ad Residuals Objective: How does oe determie a best best-fit lie for a set of data? Eyeballig it may be
More informationCS Polygon Scan Conversion. Slide 1
CS 112 - Polygo Sca Coversio Slide 1 Polygo Classificatio Covex All iterior agles are less tha 180 degrees Cocave Iterior agles ca be greater tha 180 degrees Degeerate polygos If all vertices are colliear
More informationOrientation. Orientation 10/28/15
Orietatio Orietatio We will defie orietatio to mea a object s istataeous rotatioal cofiguratio Thik of it as the rotatioal equivalet of positio 1 Represetig Positios Cartesia coordiates (x,y,z) are a easy
More informationUsing a Dynamic Interval Type-2 Fuzzy Interpolation Method to Improve Modeless Robots Calibrations
Joural of Cotrol Sciece ad Egieerig 3 (25) 9-7 doi:.7265/2328-223/25.3. D DAVID PUBLISHING Usig a Dyamic Iterval Type-2 Fuzzy Iterpolatio Method to Improve Modeless Robots Calibratios Yig Bai ad Dali Wag
More informationTakashi Tsuboi Graduate School of Mathematical Sciences, the University of Tokyo, Japan
TOPOLOGY Takashi Tsuboi Graduate School of Mathematical Scieces, the Uiversity of Tokyo, Japa Keywords: eighborhood, ope sets, metric space, covergece, cotiuity, homeomorphism, homotopy type, compactess,
More informationVisualization of Gauss-Bonnet Theorem
Visualizatio of Gauss-Boet Theorem Yoichi Maeda maeda@keyaki.cc.u-tokai.ac.jp Departmet of Mathematics Tokai Uiversity Japa Abstract: The sum of exteral agles of a polygo is always costat, π. There are
More informationMath Section 2.2 Polynomial Functions
Math 1330 - Sectio. Polyomial Fuctios Our objectives i workig with polyomial fuctios will be, first, to gather iformatio about the graph of the fuctio ad, secod, to use that iformatio to geerate a reasoably
More informationCHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs
CHAPTER IV: GRAPH THEORY Sectio : Itroductio to Graphs Sice this class is called Number-Theoretic ad Discrete Structures, it would be a crime to oly focus o umber theory regardless how woderful those topics
More informationMultiresolution for Algebraic Curves and Surfaces using Wavelets
EUROGRAPHIS 0x / N.N. ad N.N. (Guest Editors) Volume xxx, (200x), Number yyy Multiresolutio for Algebraic urves ad Surfaces usig Wavelets Jordi Esteve Pere Bruet Alvar Viacua Uiversitat Politècica de ataluya,
More informationFINITE DIFFERENCE TIME DOMAIN METHOD (FDTD)
FINIT DIFFRNC TIM DOMAIN MTOD (FDTD) The FDTD method, proposed b Yee, 1966, is aother umerical method, used widel for the solutio of M problems. It is used to solve ope-regio scatterig, radiatio, diffusio,
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu
More informationSD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters.
SD vs. SD + Oe of the most importat uses of sample statistics is to estimate the correspodig populatio parameters. The mea of a represetative sample is a good estimate of the mea of the populatio that
More informationPolynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0
Polyomial Fuctios ad Models 1 Learig Objectives 1. Idetify polyomial fuctios ad their degree 2. Graph polyomial fuctios usig trasformatios 3. Idetify the real zeros of a polyomial fuctio ad their multiplicity
More informationMathematics and Art Activity - Basic Plane Tessellation with GeoGebra
1 Mathematics ad Art Activity - Basic Plae Tessellatio with GeoGebra Worksheet: Explorig Regular Edge-Edge Tessellatios of the Cartesia Plae ad the Mathematics behid it. Goal: To eable Maths educators
More informationExact Minimum Lower Bound Algorithm for Traveling Salesman Problem
Exact Miimum Lower Boud Algorithm for Travelig Salesma Problem Mohamed Eleiche GeoTiba Systems mohamed.eleiche@gmail.com Abstract The miimum-travel-cost algorithm is a dyamic programmig algorithm to compute
More informationAppendix A. Use of Operators in ARPS
A Appedix A. Use of Operators i ARPS The methodology for solvig the equatios of hydrodyamics i either differetial or itegral form usig grid-poit techiques (fiite differece, fiite volume, fiite elemet)
More informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 6 Defiig Fuctios Pytho Programmig, 2/e 1 Objectives To uderstad why programmers divide programs up ito sets of cooperatig fuctios. To be able to
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More informationDiego Nehab. n A Transformation For Extracting New Descriptors of Shape. n Locus of points equidistant from contour
Diego Nehab A Trasformatio For Extractig New Descriptors of Shape Locus of poits equidistat from cotour Medial Axis Symmetric Axis Skeleto Shock Graph Shaked 96 1 Shape matchig Aimatio Dimesio reductio
More informationDynamic Programming and Curve Fitting Based Road Boundary Detection
Dyamic Programmig ad Curve Fittig Based Road Boudary Detectio SHYAM PRASAD ADHIKARI, HYONGSUK KIM, Divisio of Electroics ad Iformatio Egieerig Chobuk Natioal Uiversity 664-4 Ga Deokji-Dog Jeoju-City Jeobuk
More informationCivil Engineering Computation
Civil Egieerig Computatio Fidig Roots of No-Liear Equatios March 14, 1945 World War II The R.A.F. first operatioal use of the Grad Slam bomb, Bielefeld, Germay. Cotets 2 Root basics Excel solver Newto-Raphso
More informationComputing the minimum distance between two Bézier curves
Computig the miimum distace betwee two Bézier curves Xiao-Diao Che, Liqiag Che, Yigag Wag, Gag Xu, Ju-Hai Yog, Jea-Claude Paul To cite this versio: Xiao-Diao Che, Liqiag Che, Yigag Wag, Gag Xu, Ju-Hai
More informationFBE IE-11/00-11 AUTOMATED TOLERANCE INSPECTION USING IMPICIT AND PARAMETRIC REPRESENTATIONS OF OBJECT BOUNDARIES CEM ÜNSALAN AYTÜL ERÇĐL
FBE IE-/- AUTOMATED TOLERACE ISPECTIO USIG IMPICIT AD PARAMETRIC REPRESETATIOS OF OBJECT BOUDARIES CEM ÜSALA AYTÜL ERÇĐL Ağustos August Fe Bilimleri Estitüsü Istitute for Graduate Studies i Sciece ad Egieerig
More informationRunning Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects. The
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19
CIS Data Structures ad Algorithms with Java Sprig 09 Stacks, Queues, ad Heaps Moday, February 8 / Tuesday, February 9 Stacks ad Queues Recall the stack ad queue ADTs (abstract data types from lecture.
More informationSmooth Spline Surfaces over Irregular Meshes
Smooth Splie Surfaces over Irregular Meshes Charles Loop Apple Computer, Ic. Abstract A algorithm for creatig smooth splie surfaces over irregular meshes is preseted. The algorithm is a geeralizatio of
More informationChapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 9 Poiters ad Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 9.1 Poiters 9.2 Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Slide 9-3
More informationare two specific neighboring points, F( x, y)
$33/,&$7,212)7+(6(/)$92,',1* 5$1'20:$/.12,6(5('8&7,21$/*25,7+0,17+(&2/285,0$*(6(*0(17$7,21 %RJGDQ602/.$+HQU\N3$/86'DPLDQ%(5(6.$ 6LOHVLDQ7HFKQLFDO8QLYHUVLW\'HSDUWPHQWRI&RPSXWHU6FLHQFH $NDGHPLFND*OLZLFH32/$1'
More informationImproving Template Based Spike Detection
Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for
More informationRunning Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time ( 3.1) Aalysis of Algorithms Iput Algorithm Output A algorithm is a step- by- step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.
More informationAnalysis of Algorithms
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Ruig Time Most algorithms trasform iput objects ito output objects. The
More informationMobile terminal 3D image reconstruction program development based on Android Lin Qinhua
Iteratioal Coferece o Automatio, Mechaical Cotrol ad Computatioal Egieerig (AMCCE 05) Mobile termial 3D image recostructio program developmet based o Adroid Li Qihua Sichua Iformatio Techology College
More informationCS 683: Advanced Design and Analysis of Algorithms
CS 683: Advaced Desig ad Aalysis of Algorithms Lecture 6, February 1, 2008 Lecturer: Joh Hopcroft Scribes: Shaomei Wu, Etha Feldma February 7, 2008 1 Threshold for k CNF Satisfiability I the previous lecture,
More informationFilter design. 1 Design considerations: a framework. 2 Finite impulse response (FIR) filter design
Filter desig Desig cosideratios: a framework C ı p ı p H(f) Aalysis of fiite wordlegth effects: I practice oe should check that the quatisatio used i the implemetatio does ot degrade the performace of
More informationGoals of the Lecture UML Implementation Diagrams
Goals of the Lecture UML Implemetatio Diagrams Object-Orieted Aalysis ad Desig - Fall 1998 Preset UML Diagrams useful for implemetatio Provide examples Next Lecture Ð A variety of topics o mappig from
More informationData Structures and Algorithms. Analysis of Algorithms
Data Structures ad Algorithms Aalysis of Algorithms Outlie Ruig time Pseudo-code Big-oh otatio Big-theta otatio Big-omega otatio Asymptotic algorithm aalysis Aalysis of Algorithms Iput Algorithm Output
More information