Gernot Hoffmann Sphere Tessellation by Icosahedron Subdivision. Contents
|
|
- Oswald Small
- 5 years ago
- Views:
Transcription
1 Grnot Hoffmann Sphr Tssllation by Icosahdron Subdivision Contnts 1. Vrtx Coordinats. Edg Subdivision 3 3. Triangl Subdivision 4 4. Edg lngths 5 5. Normal Vctors 6 6. Subdividd Icosahdrons 7 7. Txtur Mapping Principls 8 8. Txtur Mapping Exampls 9 9. Résumé Rfrncs 11 Bst Viw Acrobat 5 / Zoom 100% at 7 dpi Smooth lin art / Smooth txt, Do not smooth imags
2 1. Vrtx Coordinats An Icosahdron has 1 vrtics, 30 dgs and 0 triangls. Th vrtics 1 and 1 ar at th pols, th vrtics to 11 ar on two pntagons. Th only unknown angl is th latitud θ. As a rsult of som basic gomtry w find θ = Th vrtics ar asily found in sphr coordinats. z 1 1- s 6 5 c ψ 3 / s 4 θ x c y dps:=*pi/5; sps:=*sqr(sic(dps/)); Quadgli(sps,-1,1-sps,r1,r,i1,i,flag); sth:=r; { smallr root sin(thta) } cth:=sqrt(1-sqr(sth)); { cos(thta) } psi:=0; For k:= to 6 Do With xr[k] Do x:=cth*coc(psi); y:=cth*sic(psi); z:=sth; psi:=psi+dps; sth:=-sth; psi:=0.5*dps; For k:=7 to 11 Do With xr[k] Do x:=cth*coc(psi); y:=cth*sic(psi); z:=sth; psi:=psi+dps; With xr[ 1] Do x:=0; y:=0; z:=+1; With xr[1] Do x:=0; y:=0; z:=-1; r = 1 radius dg lngth ψ = π / 10 c s = = cos θ sinθ / = cos θsinψ = 4 cos θ sin ψ = cos θ + ( 1 sin θ) Quadratic quation for s sin ψ s s + 1 sin ψ = 0 Smallr root dlivrs θ = o
3 . Edg Subdivision An dg is dividd by th normalizd sum of two vrtx vctors, nw point on th sphr with radius 1. z x y Procdur SubDivi(x1,x: XYZ; Var x3: XYZ); Var r: Singl; With x3 Do x:=x1.x+x.x; y:=x1.y+x.y; z:=x1.z+x.z; r:=1/rootsqr(x,y,z); x:=r*x; y:=r*y; z:=r*z; Som important variabls XYZ is a coordinat rcord x,y,z PQE is a pixl and z-buffr rcord p,q, PC is a color rcord Typ Xtr=Rcord t1,t,t3: XYZ; Typ Ptr=Rcord pa1,pb1,pa,pb,pa3,pb3: Singl; Const ntr=0*4*4*4; Var lv,lx,tri : Intgr; Ra,hu : Singl; x1,x,x3,n : XYZ; p1,p,p3 : PQE; c0,c1,c,c3 : PC; Pbody,Psoft,Pgrid: Intgr; xr : Array[1.. 1] Of XYZ; Lt1,Lt : Array[1..ntr] Of ^Xtr; Par1 : Array[1..ntr] Of ^Ptr;
4 3. Triangl Subdivision A triangl 1--3 dlivrs by dg division four triangls 1-4-6, 4--5, and Th vrtx numbrs ar local in this xampl. Two triangl lists ar usd, Lt1 and Lt. St 1--3 is stord in Lt1, thn copid to Lt. Th subdividd st is stord in Lt1. This is much simplr than tru rcursiv programming Procdur IcoRcu; { Rcursiv Subdivision Old 1--3 Nw 1-4-6, 4-5-6, 4--5, } Var x1,x,x3,x4,x5,x6: XYZ; k: Intgr; For i:=1 to tri Do Lt[i]^:=Lt1[i]^; k:=0; For i:=1 to tri Do With Lt[i]^Do x1:=t1; x:=t; x3:=t3; SubDivi(x1,x,x4); SubDivi(x,x3,x5); SubDivi(x3,x1,x6); With Lt1[k]^ Do t1:=x1; t:=x4; t3:=x6; Inc(k); With Lt1[k]^ Do t1:=x4; t:=x5; t3:=x6; Inc(k); With Lt1[k]^ Do t1:=x4; t:=x; t3:=x5; Inc(k); With Lt1[k]^ Do t1:=x6; t:=x5; t3:=x3; tri:=k;
5 4. Edg Lngths An original triangl 1--3 (subdivision lvl 0) dlivrs by subdivision four triangls 1-4-6,4-- 5, and This is subdivision lvl 1. Th vrtx numbrs ar local in this xampl. 3 a α 6 β 3 angls b γ = 60 β 1 a 4 Subdivision lvl 0, 0 triangls: = α = 60 Subdivision lvl 1, 80 triangls: a = b = α = β = γ = a a b d c d c c a a Subdivision lvl, 30 triangls: a = b = c = d = = α = (8 angls) For architctur it would b intrsting to us th sam dglngths with a minor dviation from th tru sphr shap. This is not possibl. Equal dglnghts can b achivd only by a flat subdivision of th original triangls. Any projction towards th sphr surfac crats diffrnt dglngths.
6 5. Normal Vctors Bcaus th Icosahdron is mbddd into a sphr, ach vrtx vctor is also th normal vctor at this position. For Gouraud shading th normal vctor is assignd dirctly to th vrtx. For facttd shading it is ncssary to tak th man valu of thr vrtics for th triangl. Procdur IcoShow; Var i,sl: Intgr; sl:=1; For i:=1 to tri Do With Lt1[i]^ Do x1:=t1; x:=t; x3:=t3; x1.x:=ra*x1.x; x1.y:=ra*x1.y; x1.z:=ra*x1.z; x.x:=ra*x.x; x.y:=ra*x.y; x.z:=ra*x.z; x3.x:=ra*x3.x; x3.y:=ra*x3.y; x3.z:=ra*x3.z; ObjTra3D(x1,x1); { Rotat objct } ObjTra3D(x,x); ObjTra3D(x3,x3); Abbild3R(x1,p1,sl); { Map to Rastr } Abbild3R(x,p,sl); Abbild3R(x3,p3,sl); If Psoft=1 Thn { Gouraud } LicMod(x1,x1,c1,sl); { Luminanc } LicMod(x,x,c,sl); LicMod(x3,x3,c3,sl); End Els { Facttd } n.x:=x1.x+x.x+x3.x; n.y:=x1.y+x.y+x3.y; n.z:=x1.z+x.z+x3.z; LicMod(x1,n,c1,sl); c:=c1; c3:=c1; If Pbody=1 Thn FillTriS(p1,p,p3,c1,c,c3,sl); If Pgrid=1 Thn DrawSTria(p1,p,p3,c0,c0,c0,sl);
7 6. Subdividd Icosahdrons Lft sid facttd shading, right sid Gouraud shading. Grids ar Z-buffrd Lvl 1 80 triangls Lvl 30 triangls Lvl triangls Lvl triangls (p.9)
8 7. Txtur Mapping Principls A part of an imag is mappd as a txtur onto a part of th body. Th rlvant part of th txtur imag is dscribd by a t,u-fram. Th mapping ara on th body is dfind by a paramtr plan a,b-fram. Th Icosahdron dosn t hav a paramtr plan a,b so far. This has to b gnratd additionally. Th paramtr plan is ithr a st of sphr coordinats or a st of cylindr coordinats, which is calculatd for ach vrtx. An altrnativ would b a st of Mrcator cylindr coordinats. Procdur IcoPara; { Assign Paramtrs to vrtics } { a = -pi.. +pi b = -0.5*pi..+0.5*pi or } Var i,flag : Intgr; a1,a,a3,b1,b,b3,r1,r,r3 : Singl; For i:=1 to tri Do With Lt1[i]^Do atangns(t1.y,t1.x,a1,flag); atangns(t.y,t.x,a,flag); atangns(t3.y,t3.x,a3,flag); Us hr on of th sts (right sid) With Par[i]^Do pa1:=a1; pa:=a; pa3:=a3; pb1:=b1; pb:=b; pb3:=b3; Not: atangns is th sam as atan in C A. St of sphr coordinats r1:=sqrt(sqr(t1.x)+sqr(t1.y)); r:=sqrt(sqr(t.x)+sqr(t.y)); r3:=sqrt(sqr(t3.x)+sqr(t3.y)); atangns(t1.z,r1,b1,flag); atangns(t.z,r,b,flag); atangns(t3.z,r3,b3,flag); B. St of cylindr coordinats b1:=t1.z; b:=t.z; b3:=t3.z;
9 8. Txtur Mapping Exampls Th uppr imag shows a lvl 4 subdivision 510 triangls. Th sphr is rotatd by yaw and pitch. Rotation is providd bcaus th txtur is mappd to th body in body fixd coordinats. Th lowr sphr is not rotatd, th unavoidabl singularity at th pols is not visibl.
10 9. Résumé 10 Is it worth to us subdividd Icosahdrons instad of ordinary sphr coordinats? A sphr may b dividd in 10 stps in sphr coordinats. For th latitud from -90 to +90 and th longitud from 0 to 360 w gt a msh with 648 trapzoids or 196 triangls. Th lvl 3 Icosahdron subdivision rsults in 180 triangls. Th originally fiv sgmnts ar subdividd thr tims by two, which rsults in 40 angl stps of 9. Though w hav approximatly th sam numbr of triangls, th rsolution is not considrably bttr. This is a surprising rsult, bcaus th shrinking siz of th trapzoids nar to th pols in sphr coordinats lad to th assumption, that much calculation tim is wastd. Opposd to Icosahdron tssllation, th sphr coordinat tssllation can b don without storing hug coordinat tabls. Furthron, th txtur mapping is much simplr in sphr coordinats. But hr w hav on xcption: if th txtur is mappd pr triangl, a structur lik a golf ball, or qually distributd nois, thn th Icosahdron tssllation is probably bttr. In this xampl w hav mappd on txtur imag to four triangls, which is slightly mor complx than mapping ach imag to on triangl. Th imag itslf has a spcial rotational symmtry.
11 10. Rfrncs 11 Vry ffctiv is Googl sarch, kyword Icosahdron Th author did not us spcial sourcs Computr Graphics by ZEFIR, Imag Procssing by ZEBRA [ 1 ] Dav Ebrly Plnty xcllnt documnts for Gomtry and Computr Graphics. [ ] Hugo Pfortnr A scintific rsarch about optimal sphr subdivisions, optimizd for balancd luminanc in ray-tracr applications. Many rlatd links, a highly intrsting publication. Grnot Hoffmann May 05 / 00 + January 31 / 013 Wbsit Load browsr / Click hr
Systems in Three Variables. No solution No point lies in all three planes. One solution The planes intersect at one point.
3-5 Systms in Thr Variabls TEKS FOCUS VOCABULARY TEKS (3)(B) Solv systms of thr linar quations in thr variabls by using Gaussian limination, tchnology with matrics, and substitution. Rprsntation a way
More informationThe Size of the 3D Visibility Skeleton: Analysis and Application
Th Siz of th 3D Visibility Sklton: Analysis and Application Ph.D. thsis proposal Linqiao Zhang lzhang15@cs.mcgill.ca School of Computr Scinc, McGill Univrsity March 20, 2008 thsis proposal: Th Siz of th
More informationCSE 272 Assignment 1
CSE 7 Assignmnt 1 Kui-Chun Hsu Task 1: Comput th irradianc at A analytically (point light) For point light, first th nrgy rachd A was calculatd, thn th nrgy was rducd by a factor according to th angl btwn
More informationTo Do. Mesh Data Structures. Mesh Data Structures. Motivation. Outline. Advanced Computer Graphics (Fall 2010) Desirable Characteristics 1
Advancd Computr Graphics (Fall 200) CS 283, Lctur 5: Msh Data Structurs Ravi Ramamoorthi http://inst.cs.brkly.du/~cs283/fa0 To Do Assignmnt, Du Oct 7. Start rading and working on it now. Som parts you
More informationTo Do. Advanced Computer Graphics. Motivation. Mesh Data Structures. Outline. Mesh Data Structures. Desirable Characteristics 1
Advancd Computr Graphics CSE 63 [Spring 207], Lctur 7 Ravi Ramamoorthi http://www.cs.ucsd.du/~ravir To Do Assignmnt, Du Apr 28 Any last minut issus or difficultis? Starting Gomtry Procssing Assignmnt 2
More informationMidterm 2 - Solutions 1
COS 26 Gnral Computr Scinc Spring 999 Midtrm 2 - Solutions. Writ a C function int count(char s[ ]) that taks as input a \ trminatd string and outputs th numbr of charactrs in th string (not including th
More informationReminder: Affine Transformations. Viewing and Projection. Transformation Matrices in OpenGL. Shear Transformations. Specification via Shear Angle
CSCI 480 Comptr Graphics Lctr 5 Viwing and Projction Shar Transormation Camra Positioning Simpl Paralll Projctions Simpl Prspctiv Projctions [Angl, Ch. 5] Janary 30, 2013 Jrnj Barbic Univrsity o Sothrn
More informationDO NOW Geometry Regents Lomac Date. due. Similar by Transformation 6.1 J'' J''' J'''
DO NOW Gomtry Rgnts Lomac 2014-2015 Dat. du. Similar by Transformation 6.1 (DN) Nam th thr rigid transformations and sktch an xampl that illustrats ach on. Nam Pr LO: I can dscrib a similarity transformation,
More information: Mesh Processing. Chapter 6
600.657: Msh Procssing Chaptr 6 Quad-Dominant Rmshing Goal: Gnrat a rmshing of th surfac that consists mostly of quads whos dgs align with th principal curvatur dirctions. [Marinov t al. 04] [Alliz t al.
More informationTo Do. Advanced Computer Graphics. Motivation. Mesh Data Structures. Outline. Mesh Data Structures. Desirable Characteristics 1
Advancd Computr Graphics CSE 63 [Spring 208], Lctur 7 Ravi Ramamoorthi http://www.cs.ucsd.du/~ravir To Do Assignmnt, Du Apr 27 Any last minut issus or difficultis? Starting Gomtry Procssing Assignmnt 2
More informationPresentation for use with the textbook, Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, Directed Graphs BOS SFO
Prsntation for us with th txtbook, Algorithm Dsign and Applications, by M. T. Goodrich and R. Tamassia, Wily, 2015 Dirctd Graphs BOS ORD JFK SFO LAX DFW MIA 2015 Goodrich and Tamassia Dirctd Graphs 1 Digraphs
More informationRay Tracing. Wen-Chieh (Steve) Lin National Chiao-Tung University
Ra Tracing Wn-Chih (Stv Lin National Chiao-Tung Univrsit Shirl, Funamntals of Computr Graphics, Chap 15 I-Chn Lin s CG slis, Doug Jams CG slis Can W Rnr Imags Lik Ths? Raiosit imag Pictur from http://www.graphics.cornll.u/onlin/ralistic/
More informationA Brief Summary of Draw Tools in MS Word with Examples! ( Page 1 )
A Brif Summary of Draw Tools in MS Word with Exampls! ( Pag 1 ) Click Viw command at top of pag thn Click Toolbars thn Click Drawing! A chckmark appars in front of Drawing! A toolbar appars at bottom of
More informationPrinciples of Programming Languages Topic: Formal Languages II
Principls of Programming Languags Topic: Formal Languags II CS 34,LS, LTM, BR: Formal Languags II Rviw A grammar can b ambiguous i.. mor than on pars tr for sam string of trminals in a PL w want to bas
More informationType & Media Page 1. January 2014 Libby Clarke
Nam: 1 In ordr to hlp you s your progrss at th nd of this ntir xrcis, you nd to provid som vidnc of your starting point. To start, draw th a on th lft into th box to th right, dpicting th sam siz and placmnt.
More informationProblem Set 1 (Due: Friday, Sept. 29, 2017)
Elctrical and Computr Enginring Mmorial Univrsity of Nwfoundland ENGI 9876 - Advancd Data Ntworks Fall 2017 Problm St 1 (Du: Friday, Spt. 29, 2017) Qustion 1 Considr a communications path through a packt
More informationIntroduction to Data Mining
Introduction to Data Mining Lctur #15: Clustring-2 Soul National Univrsity 1 In Tis Lctur Larn t motivation and advantag of BFR, an xtnsion of K-mans to vry larg data Larn t motivation and advantag of
More information2 Mega Pixel. HD-SDI Bullet Camera. User Manual
2 Mga Pixl HD-SDI Bullt Camra Usr Manual Thank you for purchasing our product. This manual is only applicabl to SDI bullt camras. Thr may b svral tchnically incorrct placs or printing rrors in this manual.
More informationTCP Congestion Control. Congestion Avoidance
TCP Congstion Control TCP sourcs chang th snding rat by modifying th window siz: Window = min {Advrtisd window, Congstion Window} Rcivr Transmittr ( cwnd ) In othr words, snd at th rat of th slowst componnt:
More informationClustering Algorithms
Clustring Algoritms Hirarcical Clustring k -Mans Algoritms CURE Algoritm 1 Mtods of Clustring Hirarcical (Agglomrativ): Initially, ac point in clustr by itslf. Rpatdly combin t two narst clustrs into on.
More informationSummary: Semantic Analysis
Summary: Smantic Analysis Chck rrors not dtctd by lxical or syntax analysis Intrmdiat Cod Scop rrors: Variabls not dfind Multipl dclarations Typ rrors: Assignmnt of valus of diffrnt typs Invocation of
More informationRecorder Variables. Defining Variables
Rcordr Variabls Dfining Variabls Simpl Typs Complx Typs List of Rsrvd Words Using Variabls Stting Action Paramtrs Parsing Lists and Tabls Gtting Valu from Lists and Tabls Using Indxs with Lists Using Indxs
More informationMesh Data Structures. Geometry processing. In this course. Mesh gallery. Mesh data
Gomtry procssing Msh Data Structurs Msh data Gomtry Connctivity Data structur slction dpnds on Msh typ Algorithm rquirmnts 2 Msh gallry In this cours Only orintabl, triangular, manifold mshs Singl componnt,
More informationThe Network Layer: Routing Algorithms. The Network Layer: Routing & Addressing Outline
PS 6 Ntwork Programming Th Ntwork Layr: Routing lgorithms Michl Wigl partmnt of omputr Scinc lmson Univrsity mwigl@cs.clmson.du http://www.cs.clmson.du/~mwigl/courss/cpsc6 Th Ntwork Layr: Routing & ddrssing
More information" dx v(x) $ % You may also have seen this written in shorthand form as. & ' v(x) + u(x) '# % ! d
Calculus II MAT 146 Mthods of Intgration: Intgration by Parts Just as th mthod of substitution is an intgration tchniqu that rvrss th drivativ procss calld th chain rul, Intgration by parts is a mthod
More informationReimbursement Requests in WORKS
Rimbursmnt Rqusts in WORKS Important points about Rimbursmnts in Works Rimbursmnt Rqust is th procss by which UD mploys will b rimbursd for businss xpnss paid using prsonal funds. Rimbursmnt Rqust can
More informationCPSC 826 Internetworking. The Network Layer: Routing & Addressing Outline. The Network Layer: Routing Algorithms. Routing Algorithms Taxonomy
PS Intrntworking Th Ntwork Layr: Routing & ddrssing Outlin Th Ntwork Layr: Routing lgorithms Michl Wigl partmnt of omputr Scinc lmson Univrsity mwigl@cs.clmson.du Novmbr, Ntwork layr functions Routr architctur
More informationAbout Notes And Symbols
About Nots And Symbols by Batric Wildr Contnts Sht 1 Sht 2 Sht 3 Sht 4 Sht 5 Sht 6 Sht 7 Sht 8 Sht 9 Sht 10 Sht 11 Sht 12 Sht 13 Sht 14 Sht 15 Sht 16 Sht 17 Sht 18 Sht 19 Sht 20 Sht 21 Sht 22 Sht 23 Sht
More informationSpectral sensitivity and color formats
FirWir camras Spctral snsitivity and color formats At th "input" of a camra, w hav a CCD chip. It transforms photons into lctrons. Th spctral snsitivity of this transformation is an important charactristic
More informationTRIANGULATION OF NURBS SURFACES. Jamshid Samareh-Abolhassani. 1 Abstract
TRIANGULATION OF NURBS SURFACES Jamshid Samarh-Abolhassani 1 Abstract A tchniqu is prsntd for triangulation of NURBS surfacs. This tchniqu is built upon an advancing front tchniqu combind with grid point
More informationTerrain Mapping and Analysis
Trrain Mapping and Analysis Data for Trrain Mapping and Analysis Digital Trrain Modl (DEM) DEM rprsnts an array of lvation points. Th quality of DEM influncs th accuracy of trrain masurs such as slop and
More information8.3 INTEGRATION BY PARTS
8.3 Intgration By Parts Contmporary Calculus 8.3 INTEGRATION BY PARTS Intgration by parts is an intgration mthod which nabls us to find antidrivativs of som nw functions such as ln(x) and arctan(x) as
More informationPolygonal Models. Overview. Simple Data Structures. David Carr Fundamentals of Computer Graphics Spring 2004 Based on Slides by E.
INSTITUTIONEN FÖR SYSTEMTEKNIK LULEÅ TEKNISKA UNIVERSITET Polygonal Modls David Carr Fundamntals of Computr Graphics Spring 200 Basd on Slids by E. Angl Fb-3-0 SMD159, Polygonal Modls 1 L Ovrviw Simpl
More informationVignette to package samplingdatacrt
Vigntt to packag samplingdatacrt Diana Trutschl Contnts 1 Introduction 1 11 Objctiv 1 1 Diffrnt study typs 1 Multivariat normal distributd data for multilvl data 1 Fixd ffcts part Random part 9 3 Manual
More informationOn Some Maximum Area Problems I
On Som Maximum Ara Problms I 1. Introdution Whn th lngths of th thr sids of a triangl ar givn as I 1, I and I 3, thn its ara A is uniquly dtrmind, and A=s(s-I 1 )(s-i )(s-i 3 ), whr sis th smi-primtr t{i
More informationDynamic Spatial Partitioning for Real-Time Visibility Determination
Dynamic Spatial Partitioning for Ral-Tim Visibility Dtrmination Joshua Shagam Josph J. Pfiffr, Jr. Nw Mxico Stat Univrsity Abstract Th static spatial partitioning mchanisms usd in currnt intractiv systms,
More informationObjectives. Two Ways to Implement Lists. Lists. Chapter 24 Implementing Lists, Stacks, Queues, and Priority Queues
Chaptr 24 Implmnting Lists, Stacks, Quus, and Priority Quus CS2: Data Structurs and Algorithms Colorado Stat Univrsity Original slids by Danil Liang Modifid slids by Chris Wilcox Objctivs q To dsign common
More informationRFC Java Class Library (BC-FES-AIT)
RFC Java Class Library (BC-FES-AIT) HELP.BCFESDEG Rlas 4.6C SAP AG Copyright Copyright 2001 SAP AG. All Rcht vorbhaltn. Witrgab und Vrvilfältigung disr Publikation odr von Tiln daraus sind, zu wlchm Zwck
More informationA New Algorithm for Solving Shortest Path Problem on a Network with Imprecise Edge Weight
Availabl at http://pvamudu/aam Appl Appl Math ISSN: 193-9466 Vol 6, Issu (Dcmbr 011), pp 60 619 Applications and Applid Mathmatics: An Intrnational Journal (AAM) A Nw Algorithm for Solving Shortst Path
More informationEfficient Obstacle-Avoiding Rectilinear Steiner Tree Construction
Efficint Obstacl-Avoiding Rctilinar Stinr Tr Construction Chung-Wi Lin, Szu-Yu Chn, Chi-Fng Li, Yao-Wn Chang, and Chia-Lin Yang Graduat Institut of Elctronics Enginring Dpartmnt of Elctrical Enginring
More informationIntersection-free Dual Contouring on Uniform Grids: An Approach Based on Convex/Concave Analysis
Intrsction-fr Dual Contouring on Uniform Grids: An Approach Basd on Convx/Concav Analysis Charli C. L. Wang Dpartmnt of Mchanical and Automation Enginring, Th Chins Univrsity of Hong Kong E-mail: cwang@ma.cuhk.du.hk
More information1. Trace the array for Bubble sort 34, 8, 64, 51, 32, 21. And fill in the following table
1. Trac th array for Bubbl sort 34, 8, 64, 51, 3, 1. And fill in th following tabl bubbl(intgr Array x, Intgr n) Stp 1: Intgr hold, j, pass; Stp : Boolan switchd = TRUE; Stp 3: for pass = 0 to (n - 1 &&
More informationS (surface mount) Issue date Manufacturer package code
1. Packag summary Tabl 1. Packag summary plastic, dual in-lin compatibl thrmal nhancd vry thin quad flat packag; 16 trminals; 0.5 mm pitch; 3.5 mm x 2.5 mm x 0.85 mm body 30 January 2017 Packag information
More informationModeling Surfaces of Arbitrary Topology using Manifolds 1
Modling Surfacs of Arbitrary Topology using Manifolds 1 Cindy M. Grimm John F. Hughs cmg@cs.brown.du (401) 863-7693 jfh@cs.brown.du (401) 863-7638 Th Scinc and Tchnology Cntr for Computr Graphics and Scintific
More informationSpace Subdivision Algorithms for Ray Tracing
Spac Subdivision Algorithms for Ray Tracing by David MacDonald A thsis prsntd to th Univrsity of Watrloo in fulfillmnt of th thsis rquirmnt for th dgr of Mastr of Mathmatics in Computr Scinc Watrloo, Ontario,
More informationEXTENSION OF RCC TOPOLOGICAL RELATIONS FOR 3D COMPLEX OBJECTS COMPONENTS EXTRACTED FROM 3D LIDAR POINT CLOUDS
Th Intrnational rchivs of th Photogrammtry, mot Snsing and Spatial Information Scincs, Volum XLI-, 016 XXIII ISPS Congrss, 1 19 July 016, Pragu, Czch public EXTENSION OF CC TOPOLOGICL ELTIONS FO D COMPLEX
More informationView-dependent refinement of multiresolution meshes with subdivision connectivity
Viw-dpndnt rfinmnt of multirsolution mshs with subdivision connctivity Danil I. Azuma 1 Danil N. Wood 1 Brian Curlss 1 Tom Duchamp 1 David H. Salsin 1,2 Wrnr Stutzl 1 1 Univrsity of Washington 2 Microsoft
More informationThe semantic WEB Roles of XML & RDF
Th smantic WEB Rols of XML & RDF STEFAN DECKER AND SERGEY MELNIK FRANK VAN HARMELEN, DIETER FENSEL, AND MICHEL KLEIN JEEN BROEKSTRA MICHAEL ERDMANN IAN HORROCKS Prsntd by: Iniyai Thiruvalluvan CSCI586
More information2018 How to Apply. Application Guide. BrandAdvantage
2018 How to Apply Application Guid BrandAdvantag Contnts Accssing th Grant Sit... 3 Wlcom pag... 3 Logging in To Pub Charity... 4 Rgistration for Nw Applicants ( rgistr now )... 5 Organisation Rgistration...
More informationGraphing Calculator Activities
Graphing Calculator Activitis Graphing Calculator Activitis Copyright 009, IPG Publishing IPG Publishing 86 Erin Bay Edn Prairi, innsota 47 phon: (6) 80-9090 www.iplaymathgams.com ISBN 978--948--6 IPG
More informationFSP Synthesis of an off-set five bar-slider mechanism with variable topology
FSP Synthsis of an off-st fiv bar-slidr mchanism with variabl topology Umsh. M. Daivagna 1*, Shrinivas. S. Balli 2 1 Dpartmnt of Mchanical Enginring, S.T.J.Institut of Tchnology, Ranbnnur, India 2 Dpt.
More informationClustering Algorithms
Clustring Algoritms Applications Hirarcical Clustring k -Mans Algoritms CURE Algoritm 1 T Problm of Clustring Givn a st of points, wit a notion of distanc btwn points, group t points into som numbr of
More informationDynamic modelling of multi-physical domain system by bond graph approach and its control using flatness based controller with MATLAB Simulink
Dnamic modlling of multi-phsical domain sstm b bond graph approach and its control using flatnss basd controllr with MATLAB Simulink Sauma Ranjan Sahoo Rsarch Scholar Robotics Lab Dr. Shital S. Chiddarwar
More informationA Vision-based Navigation System of Mobile Tracking Robot
A Vision-basd Navigation Systm of Mobil Tracking Robot Ji Wu Vac1av Snasl Dpt. Computr Scinc FCS VSB - Tchnical Univrsity of Ostrava Ostrava Czch Rpublic dfrmat2008 @hotmail.com vaclav. snasl @vsb.cz Ajith
More informationMotivation. Synthetic OOD concepts and reuse Lecture 4: Separation of concerns. Problem. Solution. Deleting composites that share parts. Or is it?
Synthtic OOD concpts and rus Lctur 4: Sparation of concrns Topics: Complx concrn: Mmory managmnt Exampl: Complx oprations on composit structurs Problm: Mmory laks Solution: Rfrnc counting Motivation Suppos
More informationCS246: Mining Massive Datasets Jure Leskovec, Stanford University.
CS246: Mining Massiv Datasts Jur Lskovc, Stanford Univrsity ttp://cs246.stanford.du 11/26/2010 Jur Lskovc, Stanford C246: Mining Massiv Datasts 2 Givn a st of points, wit a notion of distanc btwn points,
More informationLinked Data meet Sensor Networks
Digital Entrpris Rsarch Institut www.dri.i Linkd Data mt Snsor Ntworks Myriam Lggiri DERI NUI Galway, Irland Copyright 2008 Digital Entrpris Rsarch Institut. All rights rsrvd. Linkd Data mt Snsor Ntworks
More informationKeywords-- Digital FIR filter, Differential Evolution algorithm, Magnitude response, Pass band ripples and Stop band ripples.
Volum 5, Issu 6, Jun 2015 ISSN: 2277 128X Intrnational Journal of Advancd Rsarch in Computr Scinc and Softwar Enginring Rsarch Papr Availabl onlin at: www.iarcss.com High Pass Digital FIR Filtr Dsign Using
More informationRay Tracing. Ray Tracing. Ray Tracing. ray object. ray object = 0. Utah School of Computing Spring Computer Graphics CS5600
Utah School of omputing Spring 20 Wk Ra Tracing S5600 omputr Graphics From Rich Risnfl Spring 203 Ra Tracing lassical gomtric optics tchniqu Etrml vrsatil Historicall viw as pnsiv Goo for spcial ffcts
More informationGraph Theory & Applications. Boundaries Using Graphs. Graph Search. Find the route that minimizes. cost
Graph Thory & Appliations Bounaris Using Graphs 3 4 3 4 5 Fin th rout that minimizs osts Fin th ritial path in a projt Fin th optimal borr aroun a rgion Fin loop an no quations or analog iruit analysis
More informationExtending z/tpf using IBM API Management (APIM)
Extnding using API Managmnt (APIM) Mark Gambino, TPF Dvlopmnt Lab March 23, 2015 TPFUG Dallas, TX Th Big Pictur Goal Mobil Applications Cloud APIs Cloud-basd Srvics On-Prmis Entrpris APIs E n t r p r I
More informationGreedy Algorithms. Interval Scheduling. Greedy Algorithm. Optimality. Greedy Algorithm (cntd) Greed is good. Greed is right. Greed works.
Algorithm Grdy Algorithm 5- Grdy Algorithm Grd i good. Grd i right. Grd work. Wall Strt Data Structur and Algorithm Andri Bulatov Algorithm Grdy Algorithm 5- Algorithm Grdy Algorithm 5- Intrval Schduling
More informationAcceleration of the Smith-Waterman Algorithm using Single and Multiple Graphics Processors
Acclration of th Smith-Watrman Algorithm using Singl and Multipl Graphics Procssors Ali Khah-Sad, Stphn Pool and J. Blair Prot Abstract Finding rgions of similarity btwn two vry long data strams is a computationally
More informationMaxwell s unification: From Last Time. Energy of light. Modern Physics. Unusual experimental results. The photoelectric effect
From Last Tim Enrgy and powr in an EM wav Maxwll s unification: 1873 Intimat connction btwn lctricity and magntism Exprimntally vrifid by Hlmholtz and othrs, 1888 Polarization of an EM wav: oscillation
More informationDesign Methodologies and Tools
Dsign Mthodologis and Tools Dsign styls Full-custom dsign Standard-cll dsign Programmabl logic Gat arrays and fild-programmabl gat arrays (FPGAs) Sa of gats Systm-on-a-chip (mbddd cors) Dsign tools 1 Full-Custom
More informationLAB1: DMVPN Theory. DMVPN Theory. Disclaimer. Pag e
LAB1: DMVPN Thory Disclaimr This Configuration Guid is dsignd to assist mmbrs to nhanc thir skills in rspctiv tchnology ara. Whil vry ffort has bn mad to nsur that all matrial is as complt and accurat
More informationReview of Different Histogram Equalization Based Contrast Enhancement Techniques
Intrnational Journal of Advancd Rsarch in Computr and Communication Enginring Vol. 3, Issu 7, July 24 ISSN (Onlin) : 2278-2 Rviw of Diffrnt Histogram Equalization Basd Contrast Enhancmnt Tchniqus Er. Shfali
More informationthe following minimization problem, termed as the rectilinear polygon cover problem: \Cover
TWO GEOMETRIC OPTIMIZATION PROBLEMS BHASKAR DASGUPTA Dpartmnt of Computr Scinc Univrsity of Minnsota Minnapolis, MN 55455-0159 mail: dasgupta@cs.umn.du and VWANI ROYCHOWDHURY School of Elctrical Enginring
More informationIntersection-free Contouring on An Octree Grid
Intrsction-fr Contouring on An Octr Grid Tao Ju Washington Univrsity in St. Louis On Brookings Driv St. Louis, MO 0, USA taoju@cs.wustl.du Tushar Udshi Zyvx Corporation North Plano Road Richardson, Txas
More informationAn Architecture for Hierarchical Collision Detection
An Architctur for Hirarchical Collision Dtction Gabril Zachmann Computr Graphics, Informatik II Univrsity of Bonn mail: zach@cs.uni-bonn.d Güntr Knittl WSI/GRIS Univrsity of Tübingn mail: knittl@gris.uni-tubingn.d
More informationInternet Technology 3/21/2016
Intrnt Tchnolog //6 Roting algorithm goal st hop rotr = sorc rotr last hop rotr = dstination rotr rotr Intrnt Tchnolog 8. Roting sitch rotr LAN Pal Kranoski Rtgrs Unirsit Spring 6 LAN Roting algorithm:
More informationXML Publisher with connected query: A Primer. Session #30459 March 19, 2012
XML Publishr with connctd qury: A Primr Sssion #30459 March 19, 2012 Agnda/ Contnts Introduction Ovrviw of XMLP Gtting Startd Bst practics for building a basic XMLP rport Connctd Qury Basics Building a
More informationAN EVALUATION MODEL FOR THE CHAINS OF DISTRIBUTED MULTIMEDIA INDEXING TOOLS RESPECTING USER PREFERENCES
AN EVALUATION MODEL FOR THE CHAINS OF DISTRIBUTED MULTIMEDIA INDEXING TOOLS RESPECTING USER PREFERENCES 1 Bassm HAIDAR, 2 Bilal CHEBARO, 3 Hassan WEHBI 1 Asstt Prof., Dpartmnt of Computr Scincs, Faculty
More informationNon Fourier Encoding For Accelerated MRI. Arjun Arunachalam Assistant Professor Electrical engineering dept IIT-Bombay
Non Fourir Encoding For Acclratd MRI Arjun Arunachalam Assistant Profssor Elctrical nginring dpt IIT-Bombay Outlin of th Prsntation An introduction to Magntic Rsonanc Imaging (MRI Th nd for spd in MRI
More informationDVR Series. Digital Video Recorder PDR 6160 / 6080 / 6040
PDR 6160 / 6080 / 6040 Nois Rduc on Filtr Liv Viwing 480/400 fps Graphic Usr Intrfac Channl Edi ng by Mous Pictur in Pictur R/W Supportd Download Up to 2TB/4TB Intrfac W/Full Accss DVR Sris Digital Vido
More informationAppearance-Based Virtual View Generation of Temporally-Varying Events from Multi-Camera Images
Apparanc-Basd Virtual Viw Gnration of mporally-varying Evnts from Multi-Camra Imags in th 3D Room Hido Saito, Shigyuki Baba Makoto Kimura, Sundar Vdula, ako Kanad April 29, 1999 CMU-CS-99-127 School of
More informationShift. Reduce. Review: Shift-Reduce Parsing. Bottom-up parsing uses two actions: Bottom-Up Parsing II. ABC xyz ABCx yz. Lecture 8.
Rviw: Shift-Rduc Parsing Bottom-up parsing uss two actions: Bottom-Up Parsing II Lctur 8 Shift ABC xyz ABCx yz Rduc Cbxy ijk CbA ijk Prof. Aikn CS 13 Lctur 8 1 Prof. Aikn CS 13 Lctur 8 2 Rcall: h Stack
More informationLand restrictions/easements
Land rstrictions/asmnts rwgian Mapping Authority grd.mardal@statkart.no rwgian Mapping Authority Jun 2009 Pag 1 of 9 Tabl of contnts 1.1 Application schma...3 1.2...5 1.2.1... 5 1.2.2 Boundary... 5 1.2.3
More informationBuilding a Scanner, Part I
COMP 506 Ric Univrsity Spring 2018 Building a Scannr, Part I sourc cod IR Front End Optimizr Back End IR targt cod Copyright 2018, Kith D. Coopr & Linda Torczon, all rights rsrvd. Studnts nrolld in Comp
More informationI - Pre Board Examination
Cod No: S-080 () Total Pags: 06 KENDRIYA VIDYALAYA SANGATHAN,GUWHATI REGION I - Pr Board Examination - 04-5 Subjct Informatics Practics (Thory) Class - XII Tim: 3 hours Maximum Marks : 70 Instruction :
More informationUnderstanding Patterns of TCP Connection Usage with Statistical Clustering
Th UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Undrstanding Pattrns of TCP Connction Usag with Statistical Clustring Félix Hrnándz-Campos Kvin Jffay Don Smith Dpartmnt of Computr Scinc Andrw Nobl Dpartmnt
More informationFor each question, indicate whether the statement is true or false by circling T or F, respectively.
True/False For each question, indicate whether the statement is true or false by circling T or F, respectively. 1. (T/F) Rasterization occurs before vertex transformation in the graphics pipeline. 2. (T/F)
More informationThis module calculates the motor speed based on a rotor position measurement when the direction information is available.
SPEED_FRQ Spd Calulator Basd on Rotor Angl With Dirtion Information Dsription This modul alulats th motor spd basd on a rotor position masurmnt whn th dirtion information is availabl. thta_l dir_qep SPEED_FRQ
More informationRevit Architecture ctu
h pt r2: Chaptr 2 Rvit Architctur ctu BasicsChaptr2: Bfor you bgin to us Rvit Architctur, you nd to bcom rc familiar with th intrfac, th typs of objcts you will b using to crat your dsigns, P sa and basic
More informationLesson Focus: Finding Equivalent Fractions
Lsson Plans: Wk of 1-26-15 M o n Bindrs: /Math;; complt on own, thn chck togthr Basic Fact Practic Topic #10 Lsson #5 Lsson Focus: Finding Equivalnt Fractions *Intractiv Larning/Guidd Practic-togthr in
More informationSPECIFIC CRITERIA FOR THE GENERAL MOTORS GLOBAL TRADING PARTNER LABEL TEMPLATE:
SPCIFIC CRITRIA FOR TH GNRAL MOTORS GLOBAL TRADING PARTNR LABL TMPLAT: TH TMPLAT IDNTIFIS HOW AND WHR DATA IS TO B PLACD ON TH LABL WHN IT IS RQUIRD AS PART OF A GM BUSINSS RQUIRMNT FONT SIZS AR SPCIFID
More informationPerformance Analysis of IEEE MAC Protocol with Different ACK Polices
Prformanc Analysis of IEEE 82.15.3 MAC Protocol with Diffrnt Polics S. Mhta and K.S. Kwak Wirlss Communications Rsarch Cntr, Inha Univrsity, Kora suryanand.m@gmail.com Abstract. h wirlss prsonal ara ntwork
More informationVolume Rendering Via Data-Parallel Primitives
Eurographics Sympium on Paralll Graphics and Visualization (215) C. Dachsbachr, P. Navrátil (Editors) Volum Rndring Via Data-Paralll Primitivs M. Larsn 1, S. Labasan 1, P. Navrátil 2, J.S. Mrdith 3, and
More informationVideo Representation. Luminance and Chrominance. Television - NTSC
Vido Rprsntation Chaptr 2: Rprsntation of Multimdia Data Audio Tchnology mags and Graphics Vido Tchnology Chaptr 3: Multimdia Systms Communication Aspcts and Srvics Chaptr 4: Multimdia Systms Storag Aspcts
More informationForward and Inverse Kinematic Analysis of Robotic Manipulators
Forward and Invrs Kinmatic Analysis of Robotic Manipulators Tarun Pratap Singh 1, Dr. P. Sursh 2, Dr. Swt Chandan 3 1 M.TECH Scholar, School Of Mchanical Enginring, GALGOTIAS UNIVERSITY, GREATER NOIDA,
More informationWorkbook for Designing Distributed Control Applications using Rockwell Automation s HOLOBLOC Prototyping Software John Fischer and Thomas O.
Workbook for Dsigning Distributd Control Applications using Rockwll Automation s HOLOBLOC Prototyping Softwar John Fischr and Thomas O. Bouchr Working Papr No. 05-017 Introduction A nw paradigm for crating
More informationPaper Template and Style Guide for the Vapor Intrusion, Remediation, and Site Closure Conference
Papr Tmplat and Styl Guid for th Vapor Intrusion, Rmdiation, and Sit Closur Confrnc This Tmplat and Styl Guid dtail th documnt formatting standards and xpctd contnt for a full lngth papr manuscript. Your
More informationClustering Belief Functions using Extended Agglomerative Algorithm
IJ Imag Graphics and Signal Procssing 0 - Publishd Onlin Fbruary 0 in MECS (http://wwwmcs-prssorg/ ing Blif Functions using Extndd Agglomrativ Algorithm Ying Png Postgraduat Collg Acadmy of Equipmnt Command
More informationDynamic Light Trail Routing and Protection Issues in WDM Optical Networks
This full txt papr was pr rviwd at th dirction of IEEE Communications Socity subjct mattr xprts for publication in th IEEE GLOBECOM 2005 procdings. Dynamic Light Trail Routing and Protction Issus in WDM
More informationKENDRIYA VIDYALAYA SANGATHAN, CHENNAI REGION CLASS XII COMMON PRE-BOARD EXAMINATION
KENDRIYA VIDYALAYA SANGATHAN, CHENNAI REGION CLASS XII COMMON PRE-BOARD EXAMINATION 03-4 Sub : Informatics Practics (065) Tim allowd : 3 hours Maximum Marks : 70 Instruction : (i) All qustions ar compulsory
More informationAn Auto-tuned Method for Solving Large Tridiagonal Systems on the GPU
An Auto-tund Mthod for Solving Larg Tridiagonal Systms on th GPU Andrw Davidson Univrsity of California, Davis aaldavidson@ucdavis.du Yao Zhang Univrsity of California, Davis yaozhang@ucdavis.du John D.
More informationHEAD DETECTION AND TRACKING SYSTEM
HEAD DETECTION AND TRACKING SYSTEM Akshay Prabhu 1, Nagacharan G Tamhankar 2,Ashutosh Tiwari 3, Rajsh N(Assistant Profssor) 4 1,2,3,4 Dpartmnt of Information Scinc and Enginring,Th National Institut of
More informationSPECKLE NOISE REDUCTION IN SAR IMAGING USING 2-D LATTICE FILTERS BASED SUBBAND DECOMPOSITION
7th Europan Signal Procssing Confrnc EUSIPCO 9 Glasgow Scotland August 4-8 9 SPECKLE REDUCTION IN SAR IMAGING USING -D LATTICE FILTERS ASED SUAND DECOMPOSITION Göhan Karasaal N.. Kaplan I. Err Informatics
More informationOutline. Tasks for Exercise Six. Exercise Six Goals. Task One: Kinetic Energy Table. Nested for Loops. Laboratory VI Program Control Using Loops
Ercis 6 -- Loopig March 9, 6 Laboratory VI Program Cotrol Usig Loops Larry Cartto Computr Scic 6 Computig i Egirig ad Scic Outli Ercis si goals Outli tasks for rcis si Itroduc ida of std loops ad tabl
More informationPattern Analysis by Active Learning Method Classifier
Pattrn Analysis by Activ Larning Mthod Classifir Mohsn Firouzi *,, Sad Baghri Shouraki and Iman Esmaili Pan Afrakoti Graduat School of Systmic Nuroscincs, Ludwig Maximilian Univrsity of Munich, Munich,
More information