Non-uniform Subdivision for B-splines of Arbitrary Degree
|
|
- Cathleen Shaw
- 6 years ago
- Views:
Transcription
1 Non-niform Sbdivision for B-slines of Arbirary Degree S. Schaefer, R. Goldman We resen an efficien algorihm for sbdividing non-niform B-slines of arbirary degree in a manner similar o he Lane-Riesenfeld sbdivision algorihm for niform B- slines of arbirary degree. Or algorihm consiss of dobling he conrol oins followed by d ronds of non-niform averaging similar o he d ronds of niform averaging in he Lane-Riesenfeld algorihm for niform B-slines of degree d. However, nlike he Lane- Riesenfeld algorihm which follows mos direcly from he coninos convolion formla for he niform B-sline basis fncions, or algorihm follows narally from blossoming. We show ha or kno inserion mehod is simler and more efficien han revios kno inserion algorihms for non-niform B-slines.. Inrodcion Sbdivision crves and srfaces are biqios in Comer Grahics and Geomeric Modeling. Sbdivision recrsively refines simle olygonal shaes which, if he sbdivision rles are chosen correcly, converge in he limi o smooh shaes. Becase sbdivision can creae smooh crves and srfaces of arbirary oology, sbdivision is now an inegral ar of Geomeric Modeling []. The Lane-Riesenfeld sbdivision algorihm [6] is he mos commonly sed sbdivision algorihm for niform B-slines of arbirary degree. To sbdivide a B-sline crve of degree d, he algorihm roceeds in wo hases. The firs se dobles each conrol oin. This se is followed by d ronds of mid-oin averaging, where each edge is relaced by a verex locaed a he mid-oin of ha edge. Ieraing his sbdivision rocess generaes a seqence of iecewise linear crves ha in he limi converges o he niform B-sline defined by he original conrol oins. We can easily visalize his algorihm as he yramid shown in Figre. In his figre, arrows corresond o aking linear combinaions of he oins a he base of each arrow wih he weighs secified on each edge. This reeaed averaging aradigm is qie owerfl and lies a he fondaion of many srface sbdivision schemes based on niform B-slines of arbirary degree [7,0,,]. One of he disadvanages of he Lane-Riesenfeld algorihm is ha his algorihm only oeraes on B-slines wih niform kno sacing. Generally, however, B-slines can have non-niformly saced knos. Non-niform kno sacing forms he basis for NURBS crves and srfaces commonly sed in Comer Aided Design. Therefore, here we consider he qesion of wheher a sbdivision algorihm, similar o Lane-Riesenfeld sbdivision, can be consrced for non-niform B-slines. In ariclar, given a B-sline crve of degree d wih a monoonically increasing se of knos,,... n we wold like o doble he nmber of conrol oins by insering knos i sch ha i i i+ ; ha is, by
2 Non-niform Sbdivision for B-slines of Arbirary Degree Figre. The Lane-Riesenfeld algorihm: he conrol oins are dobled (boom of he yramid) followed by d ronds of midoin averaging. Here we illsrae he cbic case. insering one new kno in each arameer inerval.. Previos Work There are acally several algorihms ha erform kno inserion on non-niform B- slines of arbirary degree. For examle, Boehm s kno inserion algorihm [] insers one kno a a ime. However, his rocedre ms be reeaed for every kno i, leading o a raher inefficien algorihm when comared o he Lane-Riesenfeld algorihm for niform kno sacing. The Oslo algorihm [] is similar o Boehm s algorihm exce ha he Oslo algorihm simlaneosly insers mlile knos beween wo of he original consecive knos. However, when we erform sbdivision, we wish o inser only one new kno beween each old air of consecive knos. In his seing he Oslo algorihm redces o Boehm s kno inserion algorihm. Barry e al. [] rovides a bonded deh varian of he Oslo algorihm for insering mlile knos. Similar o he Oslo algorihm, his algorihm excels when insering mlile knos beween each old air of consecive knos whereas we will only be insering a single new kno in each kno inerval. Sablonniere [9] inrodces a erahedral algorihm for erforming a change of basis beween fncions defined locally over wo differen kno seqences. This algorihm can be sed o erform kno inserion as well b is seldom sed in racice becase Sablonniere s algorihm is slower han boh Boehm s algorihm and he Oslo algorihm. Conribions We shall resen an efficien algorihm for sbdividing non-niform B-slines of arbirary degree in a manner similar o he Lane-Riesenfeld algorihm for niform B-slines. Or algorihm consiss of dobling he conrol oins followed by d ronds of non-niform averaging for a degree d B-sline crve where he averages deend on he local kno sacing of he crve. This algorihm has a srcre similar o he Lane-Riesenfeld algorihm,
3 Non-niform Sbdivision for B-slines of Arbirary Degree which is also comosed of dobling followed by d ronds of averaging; b in he Lane- Riesenfeld algorihm he averaging is niform and indeenden of he local kno sacing. Moreover, nlike he Lane-Riesenfeld algorihm where he sandard roof is based on he coninos convolion formla for he niform B-sline basis fncions [], or algorihm follows easily from blossoming [8].. Non-niform Sbdivision Consider a B-sline crve of degree d wih knos... n and conrol oins 0,..., n d. The conrol oin i is associaed wih he knos i+ i+... i+d and is reresened by he olar form or blossom of he B-sline crve evalaed a hese kno vales [8]. Ths we wrie i = b[ i+,..., i+d ]whereb is he blossom of he B-sline crve. Or goal is o inser new knos,,... n sch ha i i i+. Kno inserion is akin o sbdivision; or kno inserion rocedre will rodce a more highly refined conrol olygon relaive o he new kno seqence. As he knos become dense, his sbdivision rocedre will generae a seqence of iecewise linear crves ha converge in he limi o he non-niform B-sline crve for he original conrol oins. When all of he i are niformly saced and each i = i+ i+, hen he Lane-Riesenfeld algorihm is a simle, effecive rocedre for erforming his kno inserion. However, if he i or i are non-niform, hen more comlex algorihms ms be alied. While Boehm s algorihm can always be sed o erform kno inserion, Boehm s algorihm is slow and lacks he elegan srcre of he Lane-Riesenfeld algorihm. Or algorihm is comosed of wo ses: dobling followed by d ronds of averaging, where d is he degree of he crve. This srcre is idenical o he Lane-Riesenfeld algorihm, exce ha or averaging ronds deend locally on he kno srcre corresonding o he srronding conrol oins. b [,,,...] y x y x y x b [ x,,,...] b [ y,,,...],,,... x,,,... y,,,... Figre. The mli-affine roery of he blossom (lef) and a shor-hand noaion indicaing he insered kno where he weighs in he affine combinaion are imlici. The firs se in or algorihm, dobling, is exacly he same as he Lane-Riesenfeld algorihm and we simly doble he conrol oins in he crve. We hen follow his se wih d ronds of averaging. In he k h averaging se where k =,...,d, we locally inser he knos k, k, k, k+, k+,...sing he mli-affine roery of he blossom. This roery saes ha if b[x,,,...]andb[y,,,...] are conrol oins whose cor-
4 Non-niform Sbdivision for B-slines of Arbirary Degree 0 Figre. Or non-niform sbdivision algorihm for degree d = where conrol oins are referred o by he corresonding kno vales. The kno vale a he cener of each riangle indicaes he kno o inser locally sing he wo conrol oins a he base of he riangle. 0 Figre. Or non-niform sbdivision algorihm for degree d =. Noice ha he knos insered a level are idenical o hose sed in Figre. resonding kno seqences differ by a mos one vale (x and y in or examle) and he kno vale we wish o inser is, we simly form he affine combinaion b[,,,...]= y y x b[x,,,...]+ x y x b[y,,,...]. Figre deics his roery. On he lef he arrows indicae affine combinaions along wih he weighs associaed wih each edge. The righ side of he figre shows or eqivalen noaion ha secifies only he insered kno. Figre illsraes his algorihm for a linear B-sline. For convenience, we refer o he B-sline conrol oins simly by heir kno vales and omi he fncion call o he blossom b. The conrol oins si a he base of he yramid and are already dobled. The vale shown in he cener of each yramid indicaes he kno vale o inser sing he wo conrol oins a he base of he yramid. The resling conrol oins reresened by heir kno vales are shown a he o of he yramid. The resl of he comaion in Figre are he conrol oins for he desired kno seqence afer sbdividing he crve.
5 Non-niform Sbdivision for B-slines of Arbirary Degree Figre. Or non-niform sbdivision algorihm for degree d =. The dashed edges indicae a weigh of zero for he verex a he base of he edge. Half of he old conrol oins are coied o he nex level a each rond of averaging. Figre deics or algorihm for a qadraic B-sline. The differen inensiies are designed o illsrae he nesing of he differen degrees. If we consider only he black ex, he algorihm is idenical o he algorihm in Figre for linear B-slines. The gray ex indicaes he differen knos and conrol oins needed for qadraic B-slines. For qadraic B-slines wo ronds of averaging are reqired o sbdivide he crve. A averaging se k = for he qadraic algorihm, he local kno vales ha we inser are idenical o hose from he linear algorihm. However, even hogh he kno vale is idenical, he affine combinaions ha we se a level k = for he qadraic algorihm are no idenical o he affine combinaions in he linear algorihm de o he differen kno seqences associaed wih he conrol oins. Ths nlike he Lane-Riesenfeld algorihm where he averaging rle is simly o ake he midoin a every level of averaging no maer wha he degree of he crve, he averaging rles in or algorihm deend on he degree of he crve. Neverheless, afer wo ronds of averaging he kno seqence is exacly ha of he sbdivided crve. Figre shows or algorihm for a cbic B-sline crve wih he gray-levels designed o show he nesing of he algorihm for differen degree B-slines. Noice ha every oher edge in he yramid is dashed. For hese yramids he kno insered is already resen in one of he wo conrol oins a he boom of he yramid. Therefore, hese conrol oins are simly romoed o he nex level wiho erforming any affine combinaion. The fac ha hese conrol oins are simly coied o he nex level illsraes ha or algorihm does no redce o he Lane-Riesenfeld algorihm even when he original knos i are niformly saced and he new knos i = i+ i+. Noice hen ha or algorihm erforms only half as many mlilicaions and addiions for one rond of sbdivision as Lane-Riesenfeld sbdivision hogh he laer ses only combinaions of.
6 Non-niform Sbdivision for B-slines of Arbirary Degree 6 We can also wrie he oeraions in or algorihm comacly as a recrrence involving he conrol oins and he kno vales. Le i be he conrol oins of he B-sline crve associaed wih he knos i+ i+... i+d,whered is he degree of he crve. The oins k i a he k h level of or algorihm are hen given by 0 i = i 0 i+ = i k i = i+ k i+d+ i+k i+d+ i+(k+)/ i+ k + i+k i+(k+)/ i+d+ i+(k+)/ k (i+) k i+ = i+d+ i+k i+d+ i+k/ k i+ + i+k i+k/ i+d+ i+k/ k (i+) k is odd k is even for k =,...,d.theoins d i reresen he resl of one rond of sbdivision. Finally, noice ha or sbdivision scheme will rodce a seqence of iecewise linear crves ha converge in he limi o he non-niform B-sline crve reresened by he original conrol oins and knos rovided ha he new knos i insered a each level of sbdivision lead o a dense covering of arameer sace. Figre 6 shows an examle of sbdivision for a non-niform B-sline basis fncion of degree sing or algorihm where he kno sacing is niform on boh he lef and righ sides of he basis fncion, b he knos are wice as dense on he lef as on he righ. In his examle, we simly inser he new knos i a he midoin of each consecive air of old knos.. Conclsions and Fre Work Or algorihm is a simle, fas mehod for erforming sbdivision on non-niform B-slines of arbirary degree. Similar o he Lane-Riesenfeld algorihm, or echniqe is comosed of dobling he conrol oins followed by d non-niform averaging ses where d is he degree of he crve. Or algorihm does no redce o he Lane-Riesenfeld algorihm when he original knos are niformly saced and he new knos lie a he midoins of he old knos. However, or mehod erforms only half as many comaions as he Lane-Riesenfeld algorihm. Moreover or mehod is easier o derive han he Lane- Riesenfeld algorihm. The sandard roof of he Lane-Riesenfeld algorihm is based on he observaion ha he basis fncions for niform B-slines can be generaed by coninos convolion []. In conras, he roof of or algorihm is immediae from he dal fncional and mliaffine roeries of he blossom. Blossoming roofs of he Lane- Riesenfeld algorihm are also ossible, b hese roofs are no so simle []. In he fre, we wold like o exlore wheher or no we can consrc an algorihm ha mimics he Lane-Riesenfeld algorihm even closer. Or crren echniqe reqires ha we know he degree of he crve before sbdivision, since he degree inflences he affine combinaions sed in he local kno inserion se. Ideally, we cold erform hese averaging asses wiho knowing he degree of he crve ahead of ime, hogh crren exerimens indicae ha his ye of algorihm may no be ossible in he flly nonniform seing []. Neverheless, if we lace resricions on he original knos i or he new knos i, sch an algorihm may exis. We also believe ha here exiss an algorihm for each ariclar degree ha redces o he Lane-Riesenfeld algorihm wiho any
7 Non-niform Sbdivision for B-slines of Arbirary Degree 7 Figre 6. Sbdivision of a non-niform cbic B-sline basis fncion sing or echniqe. resricions on he knos. However, hese algorihms are secial in each degree; he rles from one degree o anoher are comleely differen and, hence, do no nes like or algorihm or he Lane-Riesenfeld algorihm. Aendix A rovides wo examles of nonniform kno inserion algorihms for cbic B-slines ha redce o he Lane-Riesenfeld algorihm for cbic B-slines when he knos are evenly saced. We wold also like o generalize or mehod o creae a qadrilaeral sbdivision scheme for non-niform B-sline srfaces similar o he way he Lane-Riesenfeld algorihm is sed o creae srface sbdivision schemes [7,0,,]. The ensor-rodc case is relaively sraighforward and does no ose a challenge. However, exraordinary verices comlicae he algorihm. One of he bigges roblems is simly encoding he kno vecors for he verices in he resence of exraordinary verices. REFERENCES. Philli Barry and Ri-Feng Zh. Anoher kno inserion algorihm for B-sline crves. Comer Aided Geomeric Design, 9():7 8, 99.. W. Boehm. Insering new knos ino B-sline crves. Comer Aided Design, ():99 0, Thomas J. Cashman, Neil A. Dodgson, and Malcolm A. Sabin. Non-niform B- Sline sbdivision sing refine and smooh. In IMA Conference on he Mahemaics of Srfaces, ages 7, E. Cohen, T. Lyche, and R. Riesenfeld. Discree B-slines and sbdivision echniqes in comer-aided geomeric design and comer grahics. Comer Grahics and Image Processing, :87, Tony DeRose, Michael Kass, and Tien Trong. Sbdivision srfaces in characer animaion. In SIGGRAPH 98: Proceedings of he h annal conference on Comer grahics and ineracive echniqes, ages 8 9, J. Lane and R. Riesenfeld. A heoreical develomen for he comer generaion and dislay of iecewise olynomial srfaces. IEEE Transacions on Paern Analysis and Machine Inelligence, : 6, Harm Prazsch. Smoohness of sbdivision srfaces a exraordinary oins. Adv. in Com. Mah., 9: 77-90, L. Ramshaw. Blossoms are olar forms. Comer Aided Geomeric Design, 6: 8, P. Sablonniere. Sline and Bezier olygons associaed wih a olynomial sline crve. Comer Aided Design, 0():7 6, 978.
8 Non-niform Sbdivision for B-slines of Arbirary Degree 8 Figre 7. A sbdivision algorihm for non-niform cbic B-slines ha redces o he Lane-Riesenfeld algorihm when he knos are niformly sace. 0. Jos Sam. On sbdivision schemes generalizing niform B-sline srfaces of arbirary degree. Comer Aided Geomeric Design, 8():8 96, 00.. E. Voga and R. Goldman. Two blossoming roofs of he Lane-Riesenfeld algorihm. Coming, 79: 6, Joe Warren and Henrik Weimer. Sbdivision Mehods for Geomeric Design: A Consrcive Aroach. Morgan Kafmann Pblishers Inc., 00.. Denis Zorin and Peer Schröder. A nified framework for rimal/dal qadrilaeral sbdivision schemes. Comer Aided Geomeric Design, 8():9, 00. A. Non-niform Sbdivision Redcing o he Lane-Riesenfeld Algorihm Or algorihm for insering knos ino non-niform B-slines of arbirary degree does no redce o he Lane-Riesenfeld algorihm when he knos are niformly saced. However, for a ariclar degree, we believe ha i is always ossible o consrc a kno inserion algorihm ha redces o he Lane-Riesenfeld algorihm when he knos are evenly saced. Figre 7 shows an examle of sch an algorihm for cbic B-slines. This algorihm reqires he inserion of sedo-knos ha are no ar of he original or final kno seqences. However, hese knos case he algorihm o redce o he Lane- Riesenfeld algorihm when he original knos i are niformly saced and he new knos i = i+ i+. The disadvanage of his cbic algorihm is ha i does no generalize o B-slines of differen degrees. Frhermore, he algorihm iself is no niqe; here exiss many differen sedo-knos and inserion orders ha will rodce he same kno seqence afer
9 Non-niform Sbdivision for B-slines of Arbirary Degree 9 Figre 8. Anoher sbdivision algorihm for non-niform cbic B-slines ha redces o he Lane-Riesenfeld algorihm when he knos are niformly sace. sbdivision and redce o he Lane-Riesenfeld algorihm for niform knos. For examle, Figre 8 illsraes anoher sbdivision algorihm for non-niform cbic B-slines ha redces o he Lane-Riesenfeld algorihm when he knos are eqally saced. Again, his algorihm relies on he inserion of sedo-knos b does no rodce ha same inermediae affine combinaions. Crrenly, i is an oen roblem wheher or no here exiss an algorihm ha redces o he Lane-Riesenfeld algorihm for niform knos and has a simle, nesed srcre relaive o he degree of he B-sline crve.
parametric 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 informationA new method for 3-dimensional roadway design using visualization techniques
Urban Transor XIII: Urban Transor and he Environmen in he 2s Cenury 23 A new mehod for 3-dimensional roadway design using visualizaion echniques G. Karri & M. K. Jha Dearmen of Civil Engineering, Morgan
More informationPetri Nets for Object-Oriented Modeling
Peri Nes for Objec-Oriened Modeling Sefan Wi Absrac Ensuring he correcness of concurren rograms is difficul since common aroaches for rogram design do no rovide aroriae mehods This aer gives a brief inroducion
More informationEECS 487: Interactive Computer Graphics
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
More informationIntroduction to Data-Driven Animation: Programming with Motion Capture Jehee Lee
Inroducion o Daa-Driven Animaion: Programming wih Moion Caure Jehee Lee Seoul Naional Universiy Daa-Driven Animaion wih Moion Caure Programming wih Moion Caure Why is i difficul? Encomass a lo of heerogeneous
More informationData Structures and Algorithms
Daa Srucures and Algorihms The maerial for his lecure is drawn, in ar, from The Pracice of Programming (Kernighan & Pike) Chaer 2 1 Goals of his Lecure Hel you learn (or refresh your memory) abou: Common
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 informationToday. 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 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 informationReconstruct scene geometry from two or more calibrated images. scene point. image plane. Reconstruct scene geometry from two or more calibrated images
Sereo and Moion The Sereo Problem Reconsrc scene geomer from wo or more calibraed images scene poin focal poin image plane Sereo The Sereo Problem Reconsrc scene geomer from wo or more calibraed images
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 informationControl of Job Arrivals with Processing Time Windows into Batch Processor Buffer
onrol of Job Arrivals wih Processing ime Windows ino Bach Processor John Benedic. AJAN 1, Aa Iyer SIVAKUMAR 1, and Sanley B. GERSHWIN 2 1 Nanyang echnological Universiy 2 Massachuses Insiue of echnology
More informationCurve Modeling (Spline) Dr. S.M. Malaek. Assistant: M. Younesi
Crve Modeling Sline Dr. S.M. Malae Assistant: M. Yonesi Crve Modeling Sline Crve Control Points Convex Hll Shae of sline crve Interolation Slines Aroximation Slines Continity Conditions Parametric & Geometric
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 informationIMAGE SAMPLING AND IMAGE QUANTIZATION
Digial image processing IMAGE SAMPLING AND IMAGE QUANTIZATION. Inrodcion. Sampling in he wo-dimensional space Basics on image sampling The concep of spaial freqencies Images of limied bandwidh Two-dimensional
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 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 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 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 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 informationSecurity aspects of the Authentication used in Quantum Cryptography
SECURITY ASPECTS OF THE AUTHENTICATION USED IN QUANTUM CRYPTOGRAPHY Securiy asecs of he Auhenicaion used in Quanum Cryograhy Jörgen Cederlöf and Jan-Åe Larsson jc@lysaor.liu.se and jalar@mai.liu.se) Maemaisa
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 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 informationFast Indexing: Support for Size-Changing Algorithms in Stackable File Systems
Fas Indexing: Sppor for Size-Changing Algorihms in Sackable File Sysems Erez Zadok SUNY a Sony Brook ezk@cs.snysb.ed Johan M. Andersen, Ion Bădlesc, and Jason Nieh Colmbia Universiy johan,ion,nieh @cs.colmbia.ed
More informationMotion estimation. Announcements. Outline. Motion estimation
Annoncemens Moion esimaion Projec # is e on ne Tesa sbmission mechanism will be annonce laer his week. graing: reor is imoran resls goo/ba iscssions on imlemenaion inerface feares ec. Digial Visal Effecs
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 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 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 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 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 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 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 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 informationNet Ne w t ork y La e y r Net Ne w t ork y La e y r Initial motivation: Net Ne w t ork y La e y r Net Ne w t ork y La e y r Net Ne w t ork
None lef! 0.0.04 IP6 Iniial moiaion: -bi address space soon o be compleel allocaed. Vin Cerf 67 ddiional moiaion: header forma helps speed processing/forarding header changes o faciliae QoS IP6 gram forma:
More informationWhy not experiment with the system itself? Ways to study a system System. Application areas. Different kinds of systems
Simulaion Wha is simulaion? Simple synonym: imiaion We are ineresed in sudying a Insead of experimening wih he iself we experimen wih a model of he Experimen wih he Acual Ways o sudy a Sysem Experimen
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 informationEfficient Computation of Parameterized Pointer Information for Interprocedural Analyses
Efficien Comuaion of Parameerized Poiner Informaion for Inerrocedural Analyses Donlin Lian and Mary Jean Harrold Collee of Comuin Georia Insiue of Technoloy Alana, GA 30332, USA {dlian,harrold}@cc.aech.edu
More informationPoint Cloud Representation of 3D Shape for Laser- Plasma Scanning 3D Display
Poin Cloud Represenaion of 3D Shape for Laser- Plasma Scanning 3D Displa Hiroo Ishikawa and Hideo Saio Keio Universi E-mail {hiroo, saio}@ozawa.ics.keio.ac.jp Absrac- In his paper, a mehod of represening
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 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 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 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 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 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 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 informationOptics and Light. Presentation
Opics and Ligh Presenaion Opics and Ligh Wha comes o mind when you hear he words opics and ligh? Wha is an opical illusion? Opical illusions can use color, ligh and paerns o creae images ha can be
More informationNumerical Modelling of Reverse Flow Phenomena in a Channel with Obstruction Geometry at the Entry
WSEAS TRANSACTIONS on FID MECHANICS M.A. Kabir M.M. K. Khan and M. G. Rasl Nmerical Modelling of Reerse Flow Phenomena in a Channel wih Obsrcion Geomer a he Enr M.A. Kabir M.M. K. Khan AND M. G. Rasl Dearmen
More informationCurves and Surfaces. CS 537 Interactive Computer Graphics Prof. David E. Breen Department of Computer Science
Crves and Srfaces CS 57 Interactive Compter Graphics Prof. David E. Breen Department of Compter Science E. Angel and D. Shreiner: Interactive Compter Graphics 6E Addison-Wesley 22 Objectives Introdce types
More information4 Error Control. 4.1 Issues with Reliable Protocols
4 Error Conrol Jus abou all communicaion sysems aemp o ensure ha he daa ges o he oher end of he link wihou errors. Since i s impossible o build an error-free physical layer (alhough some shor links can
More informationResearch Article Auto Coloring with Enhanced Character Registration
Compuer Games Technology Volume 2008, Aricle ID 35398, 7 pages doi:0.55/2008/35398 Research Aricle Auo Coloring wih Enhanced Characer Regisraion Jie Qiu, Hock Soon Seah, Feng Tian, Quan Chen, Zhongke Wu,
More informationExercise 3: Bluetooth BR/EDR
Wireless Communicaions, M. Rupf. Exercise 3: Blueooh BR/EDR Problem 1: Blueooh Daa Raes. Consider he ACL packe 3-DH5 wih a maximum user payload of 1021 byes. a) Deermine he maximum achievable daa rae in
More informationDistributed Construction of a Planar Spanner and Routing for Ad Hoc Wireless Networks
Disribed Consrcion of a Planar Spanner and Roing for Ad Hoc Wireless Neorks Xiang-Yang Li Gria Calinesc Peng-Jn Wan Absrac Seeral localied roing proocols [1] garanee he delier of he packes hen he nderling
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 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 informationDETC2004/CIE VOLUME-BASED CUT-AND-PASTE EDITING FOR EARLY DESIGN PHASES
Proceedings of DETC 04 ASME 004 Design Engineering Technical Conferences and Compuers and Informaion in Engineering Conference Sepember 8-Ocober, 004, Sal Lake Ciy, Uah USA DETC004/CIE-57676 VOLUME-BASED
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 informationNetwork management and QoS provisioning - QoS in Frame Relay. . packet switching with virtual circuit service (virtual circuits are bidirectional);
QoS in Frame Relay Frame relay characerisics are:. packe swiching wih virual circui service (virual circuis are bidirecional);. labels are called DLCI (Daa Link Connecion Idenifier);. for connecion is
More informationMORPHOLOGICAL SEGMENTATION OF IMAGE SEQUENCES
MORPHOLOGICAL SEGMENTATION OF IMAGE SEQUENCES B. MARCOTEGUI and F. MEYER Ecole des Mines de Paris, Cenre de Morphologie Mahémaique, 35, rue Sain-Honoré, F 77305 Fonainebleau Cedex, France Absrac. In image
More informationMotion Level-of-Detail: A Simplification Method on Crowd Scene
Moion Level-of-Deail: A Simplificaion Mehod on Crowd Scene Absrac Junghyun Ahn VR lab, EECS, KAIST ChocChoggi@vr.kais.ac.kr hp://vr.kais.ac.kr/~zhaoyue Recen echnological improvemen in characer animaion
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 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 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 informationIn this paper we discuss the automatic construction of. are Delaunay triangulations whose smallest angles are bounded and, in
uomaic consrucion of qualiy nonobuse boundary Delaunay riangulaions Nancy Hischfeld and ara-ecilia Rivara Deparmen of ompuer Science, Universiy of hile, casilla 2777, Saniago, HILE e-mail: nancy@dcc.uchile.cl,
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 informationNonparametric CUSUM Charts for Process Variability
Journal of Academia and Indusrial Research (JAIR) Volume 3, Issue June 4 53 REEARCH ARTICLE IN: 78-53 Nonparameric CUUM Chars for Process Variabiliy D.M. Zombade and V.B. Ghue * Dep. of aisics, Walchand
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 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 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 informationPoint Location. The Slab Method. Optimal Schemes. The Slab Method. Preprocess a planar, polygonal subdivision for point location queries.
Point Location The Slab Method Prerocess a lanar, olygonal sbdiision for oint location qeries. = (18, 11) raw a ertical line throgh each ertex. This decomoses the lane into slabs. In each slab, the ertical
More informationNew Hermite cubic interpolator for two-dimensional curve generation
New Hermite cubic interolator for two-dimensional curve generation R. Szeliski, B.Eng., M.Sc., and M.R. Ito, Ph.D. Indexing term: Comuter grahics Abstract: The roblem of generating a smooth two-dimensional
More informationPacket Scheduling in a Low-Latency Optical Interconnect with Electronic Buffers
Packe cheduling in a Low-Laency Opical Inerconnec wih Elecronic Buffers Lin Liu Zhenghao Zhang Yuanyuan Yang Dep Elecrical & Compuer Engineering Compuer cience Deparmen Dep Elecrical & Compuer Engineering
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 informationRepresenting Non-Manifold Shapes in Arbitrary Dimensions
Represening Non-Manifold Shapes in Arbirary Dimensions Leila De Floriani,2 and Annie Hui 2 DISI, Universiy of Genova, Via Dodecaneso, 35-646 Genova (Ialy). 2 Deparmen of Compuer Science, Universiy of Maryland,
More informationSOT: Compact Representation for Triangle and Tetrahedral Meshes
SOT: Compac Represenaion for Triangle and Terahedral Meshes Topraj Gurung and Jarek Rossignac School of Ineracive Compuing, College of Compuing, Georgia Insiue of Technology, Alana, GA ABSTRACT The Corner
More informationEFFICIENT SOLUTION OF SYSTEMS OF ORIENTATION CONSTRAINTS
EFFICIENT SOLUTION OF SSTEMS OF OIENTATION CONSTAINTS Joseh L. Ganley Cadence Design Systems, Inc. ganley@cadence.com ABSTACT One sbtask in constraint-drien lacement is enforcing a set of orientation constraints
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 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 informationAn Efficient Delivery Scheme for Coded Caching
201 27h Inernaional Teleraffic Congress An Efficien Delivery Scheme for Coded Caching Abinesh Ramakrishnan, Cedric Wesphal and Ahina Markopoulou Deparmen of Elecrical Engineering and Compuer Science, Universiy
More informationLess Pessimistic Worst-Case Delay Analysis for Packet-Switched Networks
Less Pessimisic Wors-Case Delay Analysis for Packe-Swiched Neworks Maias Wecksén Cenre for Research on Embedded Sysems P O Box 823 SE-31 18 Halmsad maias.wecksen@hh.se Magnus Jonsson Cenre for Research
More informationIntegro-differential splines and quadratic formulae
Inegro-differenial splines and quadraic formulae I.G. BUROVA, O. V. RODNIKOVA S. Peersburg Sae Universiy 7/9 Universiesaya nab., S.Persburg, 9934 Russia i.g.burova@spbu.ru, burovaig@mail.ru Absrac: This
More informationIROS 2015 Workshop on On-line decision-making in multi-robot coordination (DEMUR 15)
IROS 2015 Workshop on On-line decision-making in muli-robo coordinaion () OPTIMIZATION-BASED COOPERATIVE MULTI-ROBOT TARGET TRACKING WITH REASONING ABOUT OCCLUSIONS KAROL HAUSMAN a,, GREGORY KAHN b, SACHIN
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 informationChapter 4 Sequential Instructions
Chaper 4 Sequenial Insrucions The sequenial insrucions of FBs-PLC shown in his chaper are also lised in secion 3.. Please refer o Chaper, "PLC Ladder diagram and he Coding rules of Mnemonic insrucion",
More information3.2 Use Parallel Lines and
3. Use Parallel Lines and Transversals Goal Use angles formed by arallel lines and ransversals. Your Noes POSTULATE CORRESPONDING ANGLES POSTULATE If wo arallel lines are cu by a ransversal, hen he airs
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 informationOn the Spacetime Geometry of Galilean Cameras
On he Spaceime Geomery of Galilean Cameras Yaser Sheikh Roboics Insie Carnegie Mellon Uniersiy yaser@cs.cm.ed Alexei Griai Comper Vision Laboraory Uniersiy of Cenral Florida agrisay@cs.cf.ed Mbarak Shah
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 informationMIC2569. Features. General Description. Applications. Typical Application. CableCARD Power Switch
CableCARD Power Swich General Descripion is designed o supply power o OpenCable sysems and CableCARD hoss. These CableCARDs are also known as Poin of Disribuion (POD) cards. suppors boh Single and Muliple
More informationSection 2. Mirrors and Prism Systems
Secion 2 Mirrors and Prism Sysems 2-1 Plane Mirrors Plane mirrors are used o: Produce a deviaion Fold he opical pah Change he image pariy Each ray from he objec poin obeys he law of reflecion a he mirror
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 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 informationRao-Blackwellized Particle Filtering for Probing-Based 6-DOF Localization in Robotic Assembly
MITSUBISHI ELECTRIC RESEARCH LABORATORIES hp://www.merl.com Rao-Blackwellized Paricle Filering for Probing-Based 6-DOF Localizaion in Roboic Assembly Yuichi Taguchi, Tim Marks, Haruhisa Okuda TR1-8 June
More informationSMICE. SMICE is the new line of printing peripherals designed to revolutionize the point-of-sale market (p.o.s.)
SMICE s m a r n i c e s m i c e SMICE is he new line of prining peripherals designed o revolionize he poin-of-sale marke (p.o.s.) The fll range of SMICE prodcs offers innovaive, dynamic solions niqe in
More informationTargil 8 : Image warping. Forward warping. Motion Transformations and Image Warping (cont.) Automatic Image Alignment: Lucas Kanade (cont.
Hebrew Uniersi mage Processing - 006 Hebrew Uniersi mage Processing - 006 Moion Transformaions and mage Warping - conine Targil 8 : Moion Transformaions and mage Warping con. Aomaic mage Alignmen: Lcas
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 informationUX260 QUICK START GUIDE
UX260 QUICK START GUIDE Transferring Music Playing Music Blueooh Pairing Taking a Picure/ Recording a Video www.lgusa.com Geing o Know Your Phone Camera BACK SIDE Lef Sof Key Speakerphone Key Talk Key
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 informationLecture 2: Fixed-Radius Near Neighbors and Geometric Basics
structure arises in many alications of geometry. The dual structure, called a Delaunay triangulation also has many interesting roerties. Figure 3: Voronoi diagram and Delaunay triangulation. Search: Geometric
More informationA High-Speed Adaptive Multi-Module Structured Light Scanner
A High-Speed Adapive Muli-Module Srucured Ligh Scanner Andreas Griesser 1 Luc Van Gool 1,2 1 Swiss Fed.Ins.of Techn.(ETH) 2 Kaholieke Univ. Leuven D-ITET/Compuer Vision Lab ESAT/VISICS Zürich, Swizerland
More information