EECS 487: Interactive Computer Graphics
|
|
- Shanna Short
- 6 years ago
- Views:
Transcription
1 EECS 487: Ineracive Compuer Graphics Lecure 7: B-splines curves Raional Bézier and NURBS Cubic Splines A represenaion of cubic spline consiss of: four conrol poins (why four?) hese are compleely user specified deermine a se of blending funcions There is no single bes represenaion of cubic spline: Cubic Inerpolae? Local? Coninuiy Affine? Convex*? VD*? Hermie C 1 n/a n/a Cardinal (Camull-Rom) excep endpoins C 1 no no Bézier endpoins C 1 naural C 2 n/a n/a B-splines C 2 * n/a when some of he conrol poins are angens no poins Naural Cubic Spline A naural cubic spline s conrol poins: posiion of sar poin 1 s derivaive of sar poin 2 nd derivaive of sar poin posiion of end poin f = a 0 + u 1 a 1 + u 2 a 2 + u a p 0 = f(0) = a a a a p 1 = f '(0) = a *0 1 a 2 + *0 2 a p 2 = f ''(0) = 2 *1 1 a 2 + *0 2 a p = f(1) = a a a a Naural Cubic Spline Given n conrol poins a naural cubic spline has n 1 segmens For segmen i: f i (0) = 1 i = 1 n f i (1) = i = 1 n consrain and basis marices: C = B = C 1 = subsequen segmens assume he posiion and 1 s and 2 nd derivaives of he end poin of he preceding segmen Se: f ' ' i (0) = f i 1 (1) i = 1 n 1 f " " i (0) = f i 1 (1) i = 1 n 1 f 1 " (0) = f n " (1) = 0 O Brien
2 Naural Cubic Splines Each curve segmen (oher han he firs) receives hree ou of is four conrol poins from he preceding segmen his gives he curve C 2 coninuiy However he polynomial coefficiens are dependen on all n conrol poins conrol is no local: any change in any segmen may change he whole curve curve ends o be ill-condiioned: a small change a he beginning can lead o large subsequen changes B-splines Given n ( d + 1) conrol poins a B-spline curve has n d segmens d is he degree of each B-spline segmen he segmens are numbered d o n 1 for ease of noaion number of conrol poins is independen of he degree unlike a Bézier spline where adding a conrol poin necessarily increases degree by one and unlike muli-segmened Bézier curve where muliple conrol poins supporing a new segmen mus be added a he same ime segmen degree (d) is also curve degree B-splines of degree d are said o have order k (= d + 1) TP Wa Advanages of B-splines Main advanages of B-splines: number of conrol poins no limied by degree (d) auomaic C d 1 coninuiy local conrol To creae a large model wih C 2 coninuiy and local conrol you prey much wan o use cubic B-splines Aside from he firs segmen each B-spline segmen shares he firs d conrol poins wih is preceding segmen sounds like naural spline how can B-splines have local conrol? Local Conrol Unlike naural splines and Bézier curves B-splines conrol poins are no derivaives Insead each segmen is a weighed-sum of d basis funcions (only) giving he conrol poins local conrol Hence Basis spline
3 Polynomials as a Vecor Space Why is B called he Basis Marix? Polynomials f = a 0 + a 1 u + a 2 u a n u n can be added: jus add he coefficiens can be muliplied by a scalar: muliply he coefficiens are closed under addiion and muliplicaion by scalar i.e. he resul is sill a polynomial I s a vecor space! A vecor space is defined by a se of basis linearly independen vecors linear combinaion of he basis vecors spans he space here vecor = polynomial Durand Canonical Power Basis 1 u u 2 u u n are independen any polynomial is a linear combinaion of hese a 0 + a 1 u + a 2 u a n u n ofen called he canonical basis funcions Jus as wih Euclidean space here are infinie number of possible basis For cubic he basis funcions could be for example: 1 1+u 1+u+u 2 1+u u 2 +u u u u 2 u +u u +1 Basis Marix and Basis Funcions A basis marix (B) ransforms he canonical basis o anoher basis: f = ua = ubp = (1 u)p 0 + up 1 = ub = n The s are he basis funcions of he oher basis (we ve known hem as he blending funcions) n Durand
4 B-splines Given n conrol poins here are n d segmens we call he segmens f i d i < n each segmen has a uni range 0 u 1 we call he enire B-spline curve wih n conrol poins f() The parameers i s where wo segmens join are called knos he sar and end poins ( d and n ) are also called knos he range [ d n ] is he domain of a B-spline curve he parameer u of segmen i is scaled o i u < y() P 0 P 2 P 9 P a cubic P 1 P f 5 Q 5 10 fq 9 9 B-spline 4 P Qf 8 8 Q Qf 8 4 f 4 P f Q 4 7 Qf 77 P 5 P 8 Kno Conrol poin Foley van Dam90 x() Uniform B-splines The knos of a uniform B-splines are spaced a equal inervals y() P 0 P 1 f Q P 2 P 9 P f 5 Q 5 5 P 8 P 4 P 7 f Q 8 Q f Qf 7 7 P 5 10 fq Qf 8 8 P Kno a cubic B-spline Conrol poin x() Foley van Dam90 Wha Degree is Sufficien? Linear B-spline Segmen Arbirary curves have an uncounable number of parameers In he linear case he basis funcions are b 0 = (1 u) and b 1 = u 1 Real-number funcion value expanded ino an infinie se of basis funcions: f = (a.k.a. en/riangle basis he i h funcions are shifed versions of he 0 h) Approximae by runcaing se a some reasonable poin e.g. : f = O Brien b = 0 u < 1 1+ u 1 < u < 0 1 u 0 < u < 1 0 u > 1 JamesHanrahan
5 Linear B-spline Curve Consider using linear B-splines (d=1 k=2) o draw a piecewise linear curve (a polyline) To draw he curve we perform linear inerpolaion of a se of conrol poins p 0 p n 1 = i 1 f i = i+2 p 0 2 p = i+1 i 1 +1 pi+2 p n 1 = i For segmen i we wrie he inerpolaing linear = i+ [ ] curve as f i = (1 u) 1 + u where u = 01 [Craig] Linear B-splines The influence of conrol poin on he whole curve is hus he en/riangle funcion: i < () = < +1 0 everywhere else () 1 1 The hardes par of working wih B-splines is keeping rack of he edious noaions! +1 i +1 [Craig] Linear B-splines Linearly inerpolaing he se of conrol poins o draw he curve: f i = (1 u) 1 + u = 1 + u = i < f i+1 = (1 u) + u+1 = u = < f() up u+1 2 f i i p0 pi 1 i 1 i i+ (1 u) 1 f i+1 +1 (1 u) +2 pn 1 [Craig] Linear B-splines f i = (1 u) 1 + u = 1 + u = i < f i+1 = (1 u) + u+1 = u = < We can rewrie he segmen funcions as: f i () = 1 () 1 + () i < f i+1 () = () + +1 ()+1 < And for he whole curve: n 1 f() = f i () = () i=1 where () s are he basis funcions (in his case linear) n 1 i=1 [Craig]
6 Quadraic B-splines Quadraic B-splines (d=2 k=) are drawn by wo inerpolaion seps similar bu differen o quadraic Bézier 4/5 1/5 4/5 4/5 1/5 1/5 Bézier quadraic: parameer along edge 2 1 q i 1 B-splines quadraic: parameer around conrol poin Whereas de Caseljau algorihm performs he ieraive inerpolaions for Bézier curves de Boor algorihm does so for B-splines f() q i [TPBuss] de Boor Algorihm De Boor algorihm is an ieraive inerpolaion algorihm ha generalizes de Caseljau s algorihm To evaluae a B-spline curve f() a parameer value : 1. deermine he [ i ) in which belongs; d i < n he domain of he curve is [ d n ] 2. o compue f() of degree d firs inerpolae beween conrol poins p s. hen in a boom up fashion coninue o perform r rounds of pairwise linear inerpolaions unil r = d using: r f jd () = j+k r f r 1 j 1 () + j f r 1 j () j+k r j j+k r j < j+k r j 1 r d j = i d + r i d + r +1 i [TPBuss] Quadraic B-splines 1 q i q i 1 f() B-splines quadraic Quadraic B-splines 1 q i q i 1 f() B-splines quadraic Using he de Boor algorihm we firs compue q i 1 and q i (noe: over wo kno inervals): 1 q i 1 = f i 12 () = i 1 < 1 1 q i = f 1 i2 () = 1 + i < 2 Then we linearly inerpolae beween q i 1 and q i in a second round (r = 2) of inerpolaion: f 2 i2 () = q i 1 + q i i < f() = [TPBuss] [TPBuss]
7 Quadraic B-splines f i () f i+1 () f i+2 () Inerpolaion and Basis Funcions The conrol poin influences f i2 () f i+12 () and f i+22 () from which we can assemble is blending funcion: () =! 1 i < < i < i+ 0 everywhere!else Bézier B-spline inerpolaion de Caseljau de Boor basis funcions Bernsein polynomials Cox-de Boor recurrence [TPBuss] Cox-de Boor Recurrence de Boor algorihm consrucs basis funcions boomup whereas Cox-de Boor recurrence generaes he basis funcions op-down Le k () be a k-h order basis funcion for weighing conrol poin 1 1 () = i < (boh for las segmen) 0 oherwise k () = k 1 () + i+k +1k 1 () i+k 1 i+k +1 if he denominaor is 0 (non-uniform knos) he basis funcion is defined o be 0 Cox-de Boor recurrence essenially akes a linear inerpolaion of linear inerpolaions of linear inerpolaions similar o he de Caseljau algorihm Cubic B-splines For 4 h order (cubic) B-splines he recursive definiion sars a 4 (): base: 1 () = linear: quadraic: cubic: 1 i < 0 oherwise 2 () = 1 () () () = 2 () + i+ i () 4 () = i+ () + i+4 i () 1 () 2 () () 4 () a sep funcion of 1 inerval a piecewise linear en funcion spanning 2 inervals a piecewise quadraic funcion spanning inervals a piecewise cubic funcion spanning 4 inervals Illusraed wih uniformly spaced knos
8 Uniform Cubic Basis Funcion Consruced from he Cox-de Boor recurrence aking advanage of fixed inerval beween knos considering only inervals for which he basis funcion is non-zero 1 1 () = i < 0 oherwise b 12 () = ( )1 () + ( )+11 () () = 2 b () + + i2 +12 () 2 4 () = b () + +4 i +1 () () i i+ i+4 [Buss Shirley Gleicher] Le! i = i!specializing!for!i = 0: b 04 () =!! 0 < < < < 4 0 everywhere!else Local Conrol Propery For uniform muli-segmen B-spline curves he kno values are equally spaced and each basis funcion is a copy and ranslae of each oher We define he enire se of curve segmens as one B-spline curve in : f() = n 1 () [n] The curve is a linear combinaion of all he basis funcions of he segmens: b() B 2 Bs 2 Foley van Dam 90 B Bs b 0 () b 1 () b 2 () b () b 4 () b 5 () b () b 7 () b 8 () B Bs 1 1 B Bs0 0 1 domain of curve b 4 () Wa 00 =i =i+1 =i+2 =i+ =i+4 y() P 1 P 4 P 0 fq P 4 P 4 P 4 Curve P P 2 fq 5 5 Q f Q 4 f 4 P 4 Curve Curve P 4 P 5 fq 7 7 P P 7 f 8 Q8 P8 Kno Conrol poin x() each segmen is influenced by four (non-zero) basis funcions each conrol poin is scaled by a single basis funcion each basis funcion is non-zero over four successive inervals in each conrol poin influences four segmens (only) local conrol Convex Hull Propery The basis funcion is 0 and sums o uniy in he range i o i+4 all he conrol poins form a convex hull he whole curve is wihin he convex hull Beween kno values he four basis funcions are non-zero and sum o uniy A each kno value one basis funcion swiches off and anoher swiches on and hree basis funcions are non-zero and sum o uniy b 0 () b 1 () b 2 () b () b 4 () b 5 () b () b 7 () b 8 () domain of curve b B 2 Bs 2 B Bs B Bs 1 1 B Bs0 0 1 u k () = 1 i < k=0 b i k ( ) 0 i < n 0 k Uniform Cubic B-spline Segmen Basis Funcions () i i+ i+4 Basis funcions for a single B-spline segmen shifed pieces of a single basis funcion o u [01] range Specializing for i = 0: 4 = u 4 =! u =!0 < 1 14 = u + u 2 + u +1 u = 1!1 < 2 24 = u u u = 2!2 < (1 u) u =! < 4 b 5 B 4 2 Bs B Bs B Bs 1 1 B Bs0 0 1 u [Shirley Gleicher]
9 Uniform Cubic B-spline Segmen Conrol poins for one segmen f i are i < n recall: he conrol poins can ake on arbirary values (geomeric consrains) Bézier is No B-spline Relaionship o he conrol poins is differen A segmen is described as: f i = j=0 + j + j u [01] (1 u) = + u u u + u 2 + u u The cubic B-spline segmen basis marix is: B = 1 y() P 9 P 8 P 1 P P fq 10 Q f 9 P Q f 8 Q Q 8 f 8 4 f 4 P Q 4 f 7 Qf 77 P 0 P 2 P Kno Conrol poin Foley van Dam 90 x() Bézier B-spline Durand Inerpolaion A B-spline curve doesn have o inerpolae any of is conrol poins Inerpolaion wih Muliple Conrol Poins A B-spline curve can be made o inerpolae one or more of is conrol poins by adding muliple conrol poins of he same value a he loss of coninuiy Examples: C 2 G 2 C 2 G 1 C 2 G 0 curve becomes a sraigh line on eiher side of he conrol poins Wa 00
10 Inerpolaion wih Muliple Conrol Poins Muliple conrol poins reduces coninuiy: he inersecion beween he wo convex hulls shrinks from a region o a line o a poin and causes he adjacen segmens o become linear Q Convex hull Q 4 Convex hull Non-uniform B-splines Non-uniform B-splines inerpolae wihou causing adjacen segmens o become linear by using muliple knos insead of muliple conrol poins The inerval beween i and may be non-uniform; when i = curve segmen f i is a single poin P 0 P 2 P 4 P 0 P P 0 P 4 y() P 9 P 8 P 1 P f 5 Q 5 P 10 Q 4 f 9 9 P 7 Q Q 4 Q 4 curve becomes a sraigh line on eiher side of he conrol poins 9 5 Q Qf 8 4 f 4 f Q 4 7 Qf 77 Qf 8 8 P P 1 P (a) Q P 1 = P 2 P 4 (b) Q Q 4 P 1 = P 2 = P (c) Foley van Dam 90 P 0 P 2 P 5 Kno Conrol poin Foley van Dam 90 x() Inerpolaion wih Muliple Knos Uniform B-splines: Uniform B-splines muliple conrol poins: curve becomes a sraigh line on eiher side of he conrol poins Non-uniform B-splines muliple knos: = [ ] f 4 and f 5 (Q 4 and Q 5 in figure) shrinks o 0 curve doesn become a sraigh line (hough coninuiy is sill los) Wa 00 Non-Uniform B-splines Basis Funcions Because he inervals beween knos are no uniform here is no single se of basis funcions Insead he basis funcions depend on he inervals beween kno values and are defined recursively in erms of lower-order basis funcions (using he Coxde Boor recurrence) A Bézier curve is really a non-uniform B-splines wih no (inerior) kno beween conrol poins B-splines can be rendered as a Bézier curve by insering muliple knos a he conrol poins wih no inerior kno!
11 Raional Curves Polynomial curves canno represen conic secions/ quadrics exacly for modeling machine pars e.g. Why no? A conic secion in 2D is he perspecive projecion of a parabola in D ono he plane z = 1 wih he COP a he origin o Polynomial curves are affine invarian bu no perspecive invarian Insead use a raional curve i.e. a raio of polynomials: f = p 1 p 2 Merrell Funkhouser andrews.edu Raional Cubic Bézier As wih homogeneous coordinae a raional curve is a nonraional curve ha has been perspecive projeced Cubic Bézier: add an exra weigh coordinae: w i = (w i x i w i y i w i z i w i ) (w i is he homogeneous coordinae) raional due o division by final weigh coordinae: (= perspecive divide) f p = projeced o z = 1: f p f w i w i If he w i s are all equal we recover he nonraional curve Ramamoorhi Wa00 Advanages of Raional Curves Boh affine and perspecive invarian Can represen conics as raional quadraics Role of he Weighs (w i s) For example: larger w 1 means ha he pre-image nonraional curve near p 1 is furher up in z and he projeced image is pulled owards p 1 Weighs (w i s) provide exra conrol: values affec ension near conrol poins he w i s canno all be simulaneously zero if all he w i s are 0 he curve is sill conained in he convex hull of he conrol polygon moving conrol poin changing weigh f f p [Farin] [FarinWa]
12 Non-Uniform Raional B-Splines f = w i k w i k wih: w i = scalar weigh for each conrol poin = conrol poins w i = (w i x i w i y i w i z i w i ) k = he B-splines basis funcions k = B-splines order Advanages of NURBS Mos general can represen: B-splines Bézier and raional Bézier conic secions cubic NURB conrol poins cubic Bézier conrol poins Properies: local conrol convex hull (if w i 0) variaion diminishing (if w i 0) invarian under boh affine and projecive ransformaions Sandard ool for represening freeform curves in CAGD applicaions [Farin] How o Choose a Spline Hermie curves are good for single segmens when you know he parameric derivaive or wan easy conrol of i Bézier curves are good for single segmens or paches where a user conrols he poins B-splines are good for large coninuous curves and surfaces NURBS are he mos general and are good when ha generaliy is useful or when conic secions mus be accuraely represened (CAD) Chenney
Today. Curves & Surfaces. Can We Disguise the Facets? Limitations of Polygonal Meshes. Better, but not always good enough
Today Curves & Surfaces Moivaion Limiaions of Polygonal Models Some Modeling Tools & Definiions Curves Surfaces / Paches Subdivision Surfaces Limiaions of Polygonal Meshes Can We Disguise he Faces? Planar
More informationLast Time: Curves & Surfaces. Today. Questions? Limitations of Polygonal Meshes. Can We Disguise the Facets?
Las Time: Curves & Surfaces Expeced value and variance Mone-Carlo in graphics Imporance sampling Sraified sampling Pah Tracing Irradiance Cache Phoon Mapping Quesions? Today Moivaion Limiaions of Polygonal
More informationSpline Curves. Color Interpolation. Normal Interpolation. Last Time? Today. glshademodel (GL_SMOOTH); Adjacency Data Structures. Mesh Simplification
Las Time? Adjacency Daa Srucures Spline Curves Geomeric & opologic informaion Dynamic allocaion Efficiency of access Mesh Simplificaion edge collapse/verex spli geomorphs progressive ransmission view-dependen
More informationSchedule. Curves & Surfaces. Questions? Last Time: Today. Limitations of Polygonal Meshes. Acceleration Data Structures.
Schedule Curves & Surfaces Sunday Ocober 5 h, * 3-5 PM *, Room TBA: Review Session for Quiz 1 Exra Office Hours on Monday (NE43 Graphics Lab) Tuesday Ocober 7 h : Quiz 1: In class 1 hand-wrien 8.5x11 shee
More informationCurves & Surfaces. Last Time? Today. Readings for Today (pick one) Limitations of Polygonal Meshes. Today. Adjacency Data Structures
Las Time? Adjacency Daa Srucures Geomeric & opologic informaion Dynamic allocaion Efficiency of access Curves & Surfaces Mesh Simplificaion edge collapse/verex spli geomorphs progressive ransmission view-dependen
More informationparametric spline curves
arameric sline curves comuer grahics arameric curves 9 fabio ellacini curves used in many conexs fons animaion ahs shae modeling differen reresenaion imlici curves arameric curves mosly used comuer grahics
More informationAML710 CAD LECTURE 11 SPACE CURVES. Space Curves Intrinsic properties Synthetic curves
AML7 CAD LECTURE Space Curves Inrinsic properies Synheic curves A curve which may pass hrough any region of hreedimensional space, as conrased o a plane curve which mus lie on a single plane. Space curves
More informationCENG 477 Introduction to Computer Graphics. Modeling Transformations
CENG 477 Inroducion o Compuer Graphics Modeling Transformaions Modeling Transformaions Model coordinaes o World coordinaes: Model coordinaes: All shapes wih heir local coordinaes and sies. world World
More informationGauss-Jordan Algorithm
Gauss-Jordan Algorihm The Gauss-Jordan algorihm is a sep by sep procedure for solving a sysem of linear equaions which may conain any number of variables and any number of equaions. The algorihm is carried
More information4.1 3D GEOMETRIC TRANSFORMATIONS
MODULE IV MCA - 3 COMPUTER GRAPHICS ADMN 29- Dep. of Compuer Science And Applicaions, SJCET, Palai 94 4. 3D GEOMETRIC TRANSFORMATIONS Mehods for geomeric ransformaions and objec modeling in hree dimensions
More information4. Minimax and planning problems
CS/ECE/ISyE 524 Inroducion o Opimizaion Spring 2017 18 4. Minima and planning problems ˆ Opimizing piecewise linear funcions ˆ Minima problems ˆ Eample: Chebyshev cener ˆ Muli-period planning problems
More informationImplementing Ray Casting in Tetrahedral Meshes with Programmable Graphics Hardware (Technical Report)
Implemening Ray Casing in Terahedral Meshes wih Programmable Graphics Hardware (Technical Repor) Marin Kraus, Thomas Erl March 28, 2002 1 Inroducion Alhough cell-projecion, e.g., [3, 2], and resampling,
More informationX-Splines : A Spline Model Designed for the End-User
X-Splines : A Spline Model Designed for he End-User Carole Blanc Chrisophe Schlic LaBRI 1 cours de la libéraion, 40 alence (France) [blancjschlic]@labri.u-bordeaux.fr Absrac his paper presens a new model
More informationSTEREO PLANE MATCHING TECHNIQUE
STEREO PLANE MATCHING TECHNIQUE Commission III KEY WORDS: Sereo Maching, Surface Modeling, Projecive Transformaion, Homography ABSTRACT: This paper presens a new ype of sereo maching algorihm called Sereo
More informationImage Content Representation
Image Conen Represenaion Represenaion for curves and shapes regions relaionships beween regions E.G.M. Perakis Image Represenaion & Recogniion 1 Reliable Represenaion Uniqueness: mus uniquely specify an
More informationM y. Image Warping. Targil 7 : Image Warping. Image Warping. 2D Geometric Transformations. image filtering: change range of image g(x) = T(f(x))
Hebrew Universi Image Processing - 6 Image Warping Hebrew Universi Image Processing - 6 argil 7 : Image Warping D Geomeric ransormaions hp://www.jere-marin.com Man slides rom Seve Seiz and Aleei Eros Image
More informationImage segmentation. Motivation. Objective. Definitions. A classification of segmentation techniques. Assumptions for thresholding
Moivaion Image segmenaion Which pixels belong o he same objec in an image/video sequence? (spaial segmenaion) Which frames belong o he same video sho? (emporal segmenaion) Which frames belong o he same
More informationA non-stationary uniform tension controlled interpolating 4-point scheme reproducing conics
A non-saionary uniform ension conrolled inerpolaing 4-poin scheme reproducing conics C. Beccari a, G. Casciola b, L. Romani b, a Deparmen of Pure and Applied Mahemaics, Universiy of Padova, Via G. Belzoni
More informationSam knows that his MP3 player has 40% of its battery life left and that the battery charges by an additional 12 percentage points every 15 minutes.
8.F Baery Charging Task Sam wans o ake his MP3 player and his video game player on a car rip. An hour before hey plan o leave, he realized ha he forgo o charge he baeries las nigh. A ha poin, he plugged
More informationProjection & Interaction
Projecion & Ineracion Algebra of projecion Canonical viewing volume rackball inerface ransform Hierarchies Preview of Assignmen #2 Lecure 8 Comp 236 Spring 25 Projecions Our lives are grealy simplified
More informationCoded Caching with Multiple File Requests
Coded Caching wih Muliple File Requess Yi-Peng Wei Sennur Ulukus Deparmen of Elecrical and Compuer Engineering Universiy of Maryland College Park, MD 20742 ypwei@umd.edu ulukus@umd.edu Absrac We sudy a
More informationSimultaneous Precise Solutions to the Visibility Problem of Sculptured Models
Simulaneous Precise Soluions o he Visibiliy Problem of Sculpured Models Joon-Kyung Seong 1, Gershon Elber 2, and Elaine Cohen 1 1 Universiy of Uah, Sal Lake Ciy, UT84112, USA, seong@cs.uah.edu, cohen@cs.uah.edu
More informationHermite Curves. Jim Armstrong Singularity November 2005
TechNoe TN-5- Herie Curves Ji Arsrong Singulariy Noveer 5 This is he second in a series of TechNoes on he sujec of applied curve aheaics in Adoe Flash TM. Each TechNoe provides a aheaical foundaion for
More informationShortest Path Algorithms. Lecture I: Shortest Path Algorithms. Example. Graphs and Matrices. Setting: Dr Kieran T. Herley.
Shores Pah Algorihms Background Seing: Lecure I: Shores Pah Algorihms Dr Kieran T. Herle Deparmen of Compuer Science Universi College Cork Ocober 201 direced graph, real edge weighs Le he lengh of a pah
More informationNEWTON S SECOND LAW OF MOTION
Course and Secion Dae Names NEWTON S SECOND LAW OF MOTION The acceleraion of an objec is defined as he rae of change of elociy. If he elociy changes by an amoun in a ime, hen he aerage acceleraion during
More informationChapter Six Chapter Six
Chaper Si Chaper Si 0 CHAPTER SIX ConcepTess and Answers and Commens for Secion.. Which of he following graphs (a) (d) could represen an aniderivaive of he funcion shown in Figure.? Figure. (a) (b) (c)
More informationCOMP26120: Algorithms and Imperative Programming
COMP26120 ecure C3 1/48 COMP26120: Algorihms and Imperaive Programming ecure C3: C - Recursive Daa Srucures Pee Jinks School of Compuer Science, Universiy of Mancheser Auumn 2011 COMP26120 ecure C3 2/48
More informationCAMERA CALIBRATION BY REGISTRATION STEREO RECONSTRUCTION TO 3D MODEL
CAMERA CALIBRATION BY REGISTRATION STEREO RECONSTRUCTION TO 3D MODEL Klečka Jan Docoral Degree Programme (1), FEEC BUT E-mail: xkleck01@sud.feec.vubr.cz Supervised by: Horák Karel E-mail: horak@feec.vubr.cz
More informationScattering at an Interface: Normal Incidence
Course Insrucor Dr. Raymond C. Rumpf Office: A 337 Phone: (915) 747 6958 Mail: rcrumpf@uep.edu 4347 Applied lecromagneics Topic 3f Scaering a an Inerface: Normal Incidence Scaering These Normal noes Incidence
More informationA Principled Approach to. MILP Modeling. Columbia University, August Carnegie Mellon University. Workshop on MIP. John Hooker.
Slide A Principled Approach o MILP Modeling John Hooer Carnegie Mellon Universiy Worshop on MIP Columbia Universiy, Augus 008 Proposal MILP modeling is an ar, bu i need no be unprincipled. Slide Proposal
More informationAssignment 2. Due Monday Feb. 12, 10:00pm.
Faculy of rs and Science Universiy of Torono CSC 358 - Inroducion o Compuer Neworks, Winer 218, LEC11 ssignmen 2 Due Monday Feb. 12, 1:pm. 1 Quesion 1 (2 Poins): Go-ack n RQ In his quesion, we review how
More informationQuantitative macro models feature an infinite number of periods A more realistic (?) view of time
INFINIE-HORIZON CONSUMPION-SAVINGS MODEL SEPEMBER, Inroducion BASICS Quaniaive macro models feaure an infinie number of periods A more realisic (?) view of ime Infinie number of periods A meaphor for many
More information1 œ DRUM SET KEY. 8 Odd Meter Clave Conor Guilfoyle. Cowbell (neck) Cymbal. Hi-hat. Floor tom (shell) Clave block. Cowbell (mouth) Hi tom.
DRUM SET KEY Hi-ha Cmbal Clave block Cowbell (mouh) 0 Cowbell (neck) Floor om (shell) Hi om Mid om Snare Floor om Snare cross sick or clave block Bass drum Hi-ha wih foo 8 Odd Meer Clave Conor Guilfole
More informationMATH Differential Equations September 15, 2008 Project 1, Fall 2008 Due: September 24, 2008
MATH 5 - Differenial Equaions Sepember 15, 8 Projec 1, Fall 8 Due: Sepember 4, 8 Lab 1.3 - Logisics Populaion Models wih Harvesing For his projec we consider lab 1.3 of Differenial Equaions pages 146 o
More informationSTRING DESCRIPTIONS OF DATA FOR DISPLAY*
SLAC-PUB-383 January 1968 STRING DESCRIPTIONS OF DATA FOR DISPLAY* J. E. George and W. F. Miller Compuer Science Deparmen and Sanford Linear Acceleraor Cener Sanford Universiy Sanford, California Absrac
More informationProjective geometry- 2D
Projecive geomer- D Acknowledgemens Marc Pollefes: for allowing e use of is ecellen slides on is opic p://www.cs.unc.edu/~marc/mvg/ Ricard Harle and Andrew Zisserman, "Muliple View Geomer in Compuer Vision"
More informationOptimal Crane Scheduling
Opimal Crane Scheduling Samid Hoda, John Hooker Laife Genc Kaya, Ben Peerson Carnegie Mellon Universiy Iiro Harjunkoski ABB Corporae Research EWO - 13 November 2007 1/16 Problem Track-mouned cranes move
More informationPage 1. News. Compositing, Clipping, Curves. Week 3, Thu May 26. Schedule Change. Homework 1 Common Mistakes. Midterm Logistics.
Universiy of Briish Columbia CPSC 4 Compuer Graphics May-June 5 Tamara Munzner Composiing, Clipping, Curves Week, Thu May 6 hp://www.ugrad.cs.ubc.ca/~cs4/vmay5 News era lab coverage: Mon -, Wed -4 P demo
More informationResearch Article Shape Preserving Interpolation Using C 2 Rational Cubic Spline
Applied Mahemaics Volume 1, Aricle ID 73, 1 pages hp://dx.doi.org/1.11/1/73 Research Aricle Shape Preserving Inerpolaion Using C Raional Cubic Spline Samsul Ariffin Abdul Karim 1 and Kong Voon Pang 1 Fundamenal
More informationPART 1 REFERENCE INFORMATION CONTROL DATA 6400 SYSTEMS CENTRAL PROCESSOR MONITOR
. ~ PART 1 c 0 \,).,,.,, REFERENCE NFORMATON CONTROL DATA 6400 SYSTEMS CENTRAL PROCESSOR MONTOR n CONTROL DATA 6400 Compuer Sysems, sysem funcions are normally handled by he Monior locaed in a Peripheral
More informationImage warping/morphing
Image arping/morphing Image arping Digial Visual Effecs Yung-Yu Chuang ih slides b Richard Szeliski, Seve Seiz, Tom Funkhouser and leei Efros Image formaion Sampling and quanizaion B Wha is an image We
More informationExperiments in Generalizing Geometry Theorems Stephen B. Gray
Experimens in Generalizing Geomery Theorems Sephen B. Gray. INTRODUCTION: THE PDN THEOREM Well-known advances in geomery have been made wih experimenal, or compueraided echniques. The irs was he proo o
More informationA Fast Non-Uniform Knots Placement Method for B-Spline Fitting
2015 IEEE Inernaional Conference on Advanced Inelligen Mecharonics (AIM) July 7-11, 2015. Busan, Korea A Fas Non-Uniform Knos Placemen Mehod for B-Spline Fiing T. Tjahjowidodo, VT. Dung, and ML. Han Absrac
More informationA Matching Algorithm for Content-Based Image Retrieval
A Maching Algorihm for Conen-Based Image Rerieval Sue J. Cho Deparmen of Compuer Science Seoul Naional Universiy Seoul, Korea Absrac Conen-based image rerieval sysem rerieves an image from a daabase using
More informationImage warping Li Zhang CS559
Wha is an image Image arping Li Zhang S559 We can hink of an image as a funcion, f: R 2 R: f(, ) gives he inensi a posiion (, ) defined over a recangle, ih a finie range: f: [a,b][c,d] [,] f Slides solen
More informationAn Improved Square-Root Nyquist Shaping Filter
An Improved Square-Roo Nyquis Shaping Filer fred harris San Diego Sae Universiy fred.harris@sdsu.edu Sridhar Seshagiri San Diego Sae Universiy Seshigar.@engineering.sdsu.edu Chris Dick Xilinx Corp. chris.dick@xilinx.com
More informationMobile Robots Mapping
Mobile Robos Mapping 1 Roboics is Easy conrol behavior percepion modelling domain model environmen model informaion exracion raw daa planning ask cogniion reasoning pah planning navigaion pah execuion
More informationNURBS rendering in OpenSG Plus
NURS rering in OpenSG Plus F. Kahlesz Á. alázs R. Klein Universiy of onn Insiue of Compuer Science II Compuer Graphics Römersrasse 164. 53117 onn, Germany Absrac Mos of he indusrial pars are designed as
More informationLAMP: 3D Layered, Adaptive-resolution and Multiperspective Panorama - a New Scene Representation
Submission o Special Issue of CVIU on Model-based and Image-based 3D Scene Represenaion for Ineracive Visualizaion LAMP: 3D Layered, Adapive-resoluion and Muliperspecive Panorama - a New Scene Represenaion
More informationEffects needed for Realism. Ray Tracing. Ray Tracing: History. Outline. Foundations of Computer Graphics (Fall 2012)
Foundaions of ompuer Graphics (Fall 2012) S 184, Lecure 16: Ray Tracing hp://ins.eecs.berkeley.edu/~cs184 Effecs needed for Realism (Sof) Shadows Reflecions (Mirrors and Glossy) Transparency (Waer, Glass)
More informationCOSC 3213: Computer Networks I Chapter 6 Handout # 7
COSC 3213: Compuer Neworks I Chaper 6 Handou # 7 Insrucor: Dr. Marvin Mandelbaum Deparmen of Compuer Science York Universiy F05 Secion A Medium Access Conrol (MAC) Topics: 1. Muliple Access Communicaions:
More informationFill in the following table for the functions shown below.
By: Carl H. Durney and Neil E. Coer Example 1 EX: Fill in he following able for he funcions shown below. he funcion is odd he funcion is even he funcion has shif-flip symmery he funcion has quarer-wave
More informationLandmarks: A New Model for Similarity-Based Pattern Querying in Time Series Databases
Lmarks: A New Model for Similariy-Based Paern Querying in Time Series Daabases Chang-Shing Perng Haixun Wang Sylvia R. Zhang D. So Parker perng@cs.ucla.edu hxwang@cs.ucla.edu Sylvia Zhang@cle.com so@cs.ucla.edu
More informationIn Proceedings of CVPR '96. Structure and Motion of Curved 3D Objects from. using these methods [12].
In Proceedings of CVPR '96 Srucure and Moion of Curved 3D Objecs from Monocular Silhouees B Vijayakumar David J Kriegman Dep of Elecrical Engineering Yale Universiy New Haven, CT 652-8267 Jean Ponce Compuer
More informationMARSS Reference Sheet
MARSS Reference Shee The defaul MARSS model (form="marxss") is wrien as follows: x = B x 1 + u + C c + w where w MVN( Q ) y = Z x + a + D d + v where v MVN( R ) x 1 MVN(π Λ) or x MVN(π Λ) c and d are inpus
More informationAnnouncements For The Logic of Boolean Connectives Truth Tables, Tautologies & Logical Truths. Outline. Introduction Truth Functions
Announcemens For 02.05.09 The Logic o Boolean Connecives Truh Tables, Tauologies & Logical Truhs 1 HW3 is due nex Tuesday William Sarr 02.05.09 William Sarr The Logic o Boolean Connecives (Phil 201.02)
More informationParametric equations 8A
Parameric equaions 8A a so () y () Susiue () ino (): y ( ) y 5, So he domain of f() is 6. y, So he range of f() is y 7. d so () y () Susiue () ino (): y y, 0 So he domain of f() is. 5 so 5 () y () Susiue
More informationME 406 Assignment #1 Solutions
Assignmen#1Sol.nb 1 ME 406 Assignmen #1 Soluions PROBLEM 1 We define he funcion for Mahemaica. In[1]:= f@_d := Ep@D - 4 Sin@D (a) We use Plo o consruc he plo. In[2]:= Plo@f@D, 8, -5, 5
More informationPrecise Voronoi Cell Extraction of Free-form Rational Planar Closed Curves
Precise Voronoi Cell Exracion of Free-form Raional Planar Closed Curves Iddo Hanniel, Ramanahan Muhuganapahy, Gershon Elber Deparmen of Compuer Science Technion, Israel Insiue of Technology Haifa 32000,
More informationDefinition and examples of time series
Definiion and examples of ime series A ime series is a sequence of daa poins being recorded a specific imes. Formally, le,,p be a probabiliy space, and T an index se. A real valued sochasic process is
More informationData Structures and Algorithms. The material for this lecture is drawn, in part, from The Practice of Programming (Kernighan & Pike) Chapter 2
Daa Srucures and Algorihms The maerial for his lecure is drawn, in par, from The Pracice of Programming (Kernighan & Pike) Chaper 2 1 Moivaing Quoaion Every program depends on algorihms and daa srucures,
More informationOutline. EECS Components and Design Techniques for Digital Systems. Lec 06 Using FSMs Review: Typical Controller: state
Ouline EECS 5 - Componens and Design Techniques for Digial Sysems Lec 6 Using FSMs 9-3-7 Review FSMs Mapping o FPGAs Typical uses of FSMs Synchronous Seq. Circuis safe composiion Timing FSMs in verilog
More informationMOTION DETECTORS GRAPH MATCHING LAB PRE-LAB QUESTIONS
NME: TE: LOK: MOTION ETETORS GRPH MTHING L PRE-L QUESTIONS 1. Read he insrucions, and answer he following quesions. Make sure you resae he quesion so I don hae o read he quesion o undersand he answer..
More information! errors caused by signal attenuation, noise.!! receiver detects presence of errors:!
Daa Link Layer! The Daa Link layer can be furher subdivided ino:!.! Logical Link Conrol (LLC): error and flow conrol!.! Media Access Conrol (MAC): framing and media access! differen link proocols may provide
More informationComputer representations of piecewise
Edior: Gabriel Taubin Inroducion o Geomeric Processing hrough Opimizaion Gabriel Taubin Brown Universiy Compuer represenaions o piecewise smooh suraces have become vial echnologies in areas ranging rom
More informationRay Casting. Outline. Outline in Code
Foundaions of ompuer Graphics Online Lecure 10: Ray Tracing 2 Nus and ols amera Ray asing Ravi Ramamoorhi Ouline amera Ray asing (choose ray direcions) Ray-objec inersecions Ray-racing ransformed objecs
More informationSystems & Biomedical Engineering Department. Transformation
Sem & Biomedical Engineering Deparmen SBE 36B: Compuer Sem III Compuer Graphic Tranformaion Dr. Aman Eldeib Spring 28 Tranformaion Tranformaion i a fundamenal corner one of compuer graphic and i a cenral
More informationCS 428: Fall Introduction to. Geometric Transformations (continued) Andrew Nealen, Rutgers, /20/2010 1
CS 428: Fall 2 Inroducion o Compuer Graphic Geomeric Tranformaion (coninued) Andrew Nealen, Ruger, 2 9/2/2 Tranlaion Tranlaion are affine ranformaion The linear par i he ideni mari The 44 mari for he ranlaion
More informationIntroduction to Computer Graphics 10. Curves and Surfaces
Inroduion o Comuer Grahis. Curves and Surfaes I-Chen Lin, Assisan Professor Naional Chiao Tung Univ, Taiwan Tebook: E.Angel, Ineraive Comuer Grahis, 5 h Ed., Addison Wesley Ref: Hearn and aker, Comuer
More informationAlgorithm for image reconstruction in multi-slice helical CT
Algorihm for image reconsrucion in muli-slice helical CT Kasuyuki Taguchi a) and Hiroshi Aradae Medical Engineering Laboraory, Toshiba Corporaion, 1385 Shimoishigami, Oawara, Tochigi 324-855, Japan Received
More informationCollision-Free and Curvature-Continuous Path Smoothing in Cluttered Environments
Collision-Free and Curvaure-Coninuous Pah Smoohing in Cluered Environmens Jia Pan 1 and Liangjun Zhang and Dinesh Manocha 3 1 panj@cs.unc.edu, 3 dm@cs.unc.edu, Dep. of Compuer Science, Universiy of Norh
More informationRULES OF DIFFERENTIATION LESSON PLAN. C2 Topic Overview CALCULUS
CALCULUS C Topic Overview C RULES OF DIFFERENTIATION In pracice we o no carry ou iffereniaion from fir principle (a ecribe in Topic C Inroucion o Differeniaion). Inea we ue a e of rule ha allow u o obain
More informationA High Accuracy Volume Renderer for Unstructured Data
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, VOL. 4, NO. 1, JANUARY-MARCH 1998 37 A High Accuracy Volume Renderer for Unsrucured Daa Peer L. Williams, Member, IEEE Compuer Sociey, Nelson L.
More informationCS 152 Computer Architecture and Engineering. Lecture 7 - Memory Hierarchy-II
CS 152 Compuer Archiecure and Engineering Lecure 7 - Memory Hierarchy-II Krse Asanovic Elecrical Engineering and Compuer Sciences Universiy of California a Berkeley hp://www.eecs.berkeley.edu/~krse hp://ins.eecs.berkeley.edu/~cs152
More informationDigital Geometry Processing Differential Geometry
Digial Geomery Processing Differenial Geomery Moivaion Undersand he srucure of he surface Differenial Geomery Properies: smoohness, curviness, imporan direcions How o modify he surface o change hese properies
More informationIt is easier to visualize plotting the curves of cos x and e x separately: > plot({cos(x),exp(x)},x = -5*Pi..Pi,y = );
Mah 467 Homework Se : some soluions > wih(deools): wih(plos): Warning, he name changecoords has been redefined Problem :..7 Find he fixed poins, deermine heir sabiliy, for x( ) = cos x e x > plo(cos(x)
More informationMidterm Exam Announcements
Miderm Exam Noe: This was a challenging exam. CSCI 4: Principles o Programming Languages Lecure 1: Excepions Insrucor: Dan Barowy Miderm Exam Scores 18 16 14 12 10 needs improvemen 8 6 4 2 0 0-49 50-59
More informationLecture 18: Mix net Voting Systems
6.897: Advanced Topics in Crypography Apr 9, 2004 Lecure 18: Mix ne Voing Sysems Scribed by: Yael Tauman Kalai 1 Inroducion In he previous lecure, we defined he noion of an elecronic voing sysem, and specified
More informationMotor Control. 5. Control. Motor Control. Motor Control
5. Conrol In his chaper we will do: Feedback Conrol On/Off Conroller PID Conroller Moor Conrol Why use conrol a all? Correc or wrong? Supplying a cerain volage / pulsewidh will make he moor spin a a cerain
More informationConstant-Work-Space Algorithms for Shortest Paths in Trees and Simple Polygons
Journal of Graph Algorihms and Applicaions hp://jgaa.info/ vol. 15, no. 5, pp. 569 586 (2011) Consan-Work-Space Algorihms for Shores Pahs in Trees and Simple Polygons Tesuo Asano 1 Wolfgang Mulzer 2 Yajun
More informationComputational Geometry in Wireless Networks - Routing. Presented by Heather M. Michaud
Compaional Geomery in Wireless Neworks - Roing Presened by Heaher M. Michad 1 Ad Hoc Wireless Neworks No fixed pre-exising infrasrcre Nodes can be saic or mobile Assme nodes don move dring roing or opology
More informationREDUCTIONS BBM ALGORITHMS DEPT. OF COMPUTER ENGINEERING ERKUT ERDEM. Bird s-eye view. May. 12, Reduction.
BBM 0 - ALGORITHMS DEPT. OF COMPUTER ENGINEERING ERKUT ERDEM REDUCTIONS May., 0 Bird s-eye view Desideraa. Classify problems according o compuaional requiremens. complexiy order of growh examples linear
More informationCS130 : Computer Graphics Curves (cont.) Tamar Shinar Computer Science & Engineering UC Riverside
CS130 : Computer Graphics Curves (cont.) Tamar Shinar Computer Science & Engineering UC Riverside Blending Functions Blending functions are more convenient basis than monomial basis canonical form (monomial
More informationFIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS
FIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS Mohammed A. Aseeri and M. I. Sobhy Deparmen of Elecronics, The Universiy of Ken a Canerbury Canerbury, Ken, CT2
More informationVisual Perception as Bayesian Inference. David J Fleet. University of Toronto
Visual Percepion as Bayesian Inference David J Flee Universiy of Torono Basic rules of probabiliy sum rule (for muually exclusive a ): produc rule (condiioning): independence (def n ): Bayes rule: marginalizaion:
More informationA Progressive-ILP Based Routing Algorithm for Cross-Referencing Biochips
16.3 A Progressive-ILP Based Rouing Algorihm for Cross-Referencing Biochips Ping-Hung Yuh 1, Sachin Sapanekar 2, Chia-Lin Yang 1, Yao-Wen Chang 3 1 Deparmen of Compuer Science and Informaion Engineering,
More information7.2 Puiseux Expansions
7. Puiseux Expansions Given an algebraic funcion on an algebraic curve, we wish o compue is principle pars by locaing is poles and compuing series expansions here. Since he powers of y form a Cx basis
More information3-D Object Modeling and Recognition for Telerobotic Manipulation
Research Showcase @ CMU Roboics Insiue School of Compuer Science 1995 3-D Objec Modeling and Recogniion for Teleroboic Manipulaion Andrew Johnson Parick Leger Regis Hoffman Marial Heber James Osborn Follow
More informationA time-space consistency solution for hardware-in-the-loop simulation system
Inernaional Conference on Advanced Elecronic Science and Technology (AEST 206) A ime-space consisency soluion for hardware-in-he-loop simulaion sysem Zexin Jiang a Elecric Power Research Insiue of Guangdong
More informationIn fmri a Dual Echo Time EPI Pulse Sequence Can Induce Sources of Error in Dynamic Magnetic Field Maps
In fmri a Dual Echo Time EPI Pulse Sequence Can Induce Sources of Error in Dynamic Magneic Field Maps A. D. Hahn 1, A. S. Nencka 1 and D. B. Rowe 2,1 1 Medical College of Wisconsin, Milwaukee, WI, Unied
More informationthe marginal product. Using the rule for differentiating a power function,
3 Augu 07 Chaper 3 Derivaive ha economi ue 3 Rule for differeniaion The chain rule Economi ofen work wih funcion of variable ha are hemelve funcion of oher variable For example, conider a monopoly elling
More informationLearning in Games via Opponent Strategy Estimation and Policy Search
Learning in Games via Opponen Sraegy Esimaion and Policy Search Yavar Naddaf Deparmen of Compuer Science Universiy of Briish Columbia Vancouver, BC yavar@naddaf.name Nando de Freias (Supervisor) Deparmen
More informationAccurate Simplification of Multi-Chart Textured Models
DOI: 10.1111/j.1467-8659.2010.01652.x COMPUTER GRAPHICS forum Volume 29 (2010), number 6 pp. 1842 1853 Accurae Simplificaion of Muli-Char Texured Models N. Coll and T. Paradinas Insiu d Informaica i Aplicacions,
More informationgeometric transformations
geomeric ranformaion comuer grahic ranform 28 fabio ellacini linear algebra review marice noaion baic oeraion mari-vecor mulilicaion comuer grahic ranform 28 fabio ellacini 2 marice noaion for marice and
More informationA Routing Algorithm for Flip-Chip Design
A Rouing Algorihm for Flip-hip Design Jia-Wei Fang, I-Jye Lin, and Yao-Wen hang, Graduae Insiue of Elecronics Engineering, Naional Taiwan Universiy, Taipei Deparmen of Elecrical Engineering, Naional Taiwan
More informationAxiomatic Foundations and Algorithms for Deciding Semantic Equivalences of SQL Queries
Axiomaic Foundaions and Algorihms for Deciding Semanic Equivalences of SQL Queries Shumo Chu, Brendan Murphy, Jared Roesch, Alvin Cheung, Dan Suciu Paul G. Allen School of Compuer Science and Engineering
More informationA NEW APPROACH FOR 3D MODELS TRANSMISSION
A NEW APPROACH FOR 3D MODELS TRANSMISSION A. Guarnieri a, F. Piroi a, M. Ponin a, A. Veore a a CIRGEO, Inerdep. Research Cener of Carography, Phoogrammery, Remoe Sensing and GIS Universiy of Padova, Agripolis
More informationEngineering Mathematics 2018
Engineering Mahemaics 08 SUBJET NAME : Mahemaics II SUBJET ODE : MA65 MATERIAL NAME : Par A quesions REGULATION : R03 UPDATED ON : November 06 TEXTBOOK FOR REFERENE To buy he book visi : Sri Hariganesh
More informationA METHOD OF MODELING DEFORMATION OF AN OBJECT EMPLOYING SURROUNDING VIDEO CAMERAS
A METHOD OF MODELING DEFORMATION OF AN OBJECT EMLOYING SURROUNDING IDEO CAMERAS Joo Kooi TAN, Seiji ISHIKAWA Deparmen of Mechanical and Conrol Engineering Kushu Insiue of Technolog, Japan ehelan@is.cnl.kuech.ac.jp,
More informationLow-Cost WLAN based. Dr. Christian Hoene. Computer Science Department, University of Tübingen, Germany
Low-Cos WLAN based Time-of-fligh fligh Trilaeraion Precision Indoor Personnel Locaion and Tracking for Emergency Responders Third Annual Technology Workshop, Augus 5, 2008 Worceser Polyechnic Insiue, Worceser,
More information