To Do. Mesh Data Structures. Mesh Data Structures. Motivation. Outline. Advanced Computer Graphics (Fall 2010) Desirable Characteristics 1
|
|
- Ginger Paul
- 6 years ago
- Views:
Transcription
1 Advancd Computr Graphics (Fall 200) CS 283, Lctur 5: Msh Data Structurs Ravi Ramamoorthi To Do Assignmnt, Du Oct 7. Start rading and working on it now. Som parts you can do now. Som parts aftr nxt wk Any difficultis (finding partnrs tc.) with assignmnt? Motivation A polygon msh is a collction of triangls W want to do oprations on ths triangls E.g. walk across th msh for simplification Display for rndring Computational gomtry Bst rprsntations (msh data structurs)? Compactnss Gnrality Simplicity for computations Efficincy Dsirabl Charactristics Gnrality from most gnral to last Polygon soup Only triangls 2-manifold 2 triangls pr dg Orintabl consistnt CW / CCW winding Closd no boundary Compact storag Msh Data Structurs Msh Data Structurs Dsirabl charactristics 2 Efficint support for oprations: Givn fac, find its vrtics Givn vrtx, find facs touching it Givn fac, find nighboring facs Givn vrtx, find nighboring vrtics Givn dg, find vrtics and facs it touchs Ths ar adjacncy oprations important in msh simplification (homwork), many othr applications Indpndnt facs Indxd fac st Adjacncy lists Wingd-dg Half-dg Outlin Ovrviw of msh dcimation and simplification
2 Indpndnt Facs Facs list vrtx coordinats Rdundant vrtics No topology information Indxd Fac St Facs list vrtx rfrncs shard vrtics Commonly usd (.g. OFF fil format itslf) Augmntd vrsions simpl for msh procssing F Fac Tabl : (x 0,y 0,z 0 ), (x,y,z ), (x 2,y 2,z 2 ) F : (x 3,y 3,z 3 ), (x 4,y 4,z 4 ), (x 5,y 5,z 5 ) : (x 6,y 6,z 6 ), (x 7,y 7,z 7 ), (x 8,y 8,z 8 ) F Vrtx Tabl v 0 : (x 0,y 0,z 0 ) v : (x,y,z ) : (x 2,y 2,z 2 ) v 3 : (x 3,y 3,z 3 ) : (x 4,y 4,z 4 ) Fac Tabl : 0,, 2 F :, 4, 2 :, 3, 4 v 0 v v 3 Not CCW ordring Indxd Fac St Storag fficincy? Which oprations supportd in O() tim? F v 0 v v 3 Vrtx Tabl Fac Tabl v 0 : (x 0,y 0,z 0 ) : 0,, 2 v : (x,y,z ) F :, 4, 2 : (x 2,y 2,z 2 ) :, 3, 4 v 3 : (x 3,y 3,z 3 ) : (x 4,y 4,z 4 ) Not CCW ordring Efficint Algorithm Dsign Can somtims dsign algorithms to compnsat for oprations not supportd by data structurs Exampl: pr-vrtx normals Avrag normal of facs touching ach vrtx With indxd fac st, vrtx fac is O(n) Naiv algorithm for all vrtics: O(n 2 ) Can you think of an O(n) algorithm? Efficint Algorithm Dsign Can somtims dsign algorithms to compnsat for oprations not supportd by data structurs Exampl: pr-vrtx normals Avrag normal of facs touching ach vrtx With indxd fac st, vrtx fac is O(n) Naiv algorithm for all vrtics: O(n 2 ) Can you think of an O(n) algorithm? Usful to augmnt with vrtx fac adjacncy For all vrtics, find adjacnt facs as wll Can b implmntd whil simply looping ovr facs Indpndnt facs Indxd fac st Adjacncy lists Wingd-dg Half-dg Outlin Ovrviw of msh dcimation and simplification 2
3 Full Adjacncy Lists Full adjacncy: Issus Stor all vrtx, fac, and dg adjacncis v 0 0 v 3 v 3 Edg Adjacncy Tabl 0 : v 0, v ;, ;, 2,, : v, ;,F ; 5, 0, 2, 6 Fac Adjacncy Tabl : v 0,v, ; F,, ;; 0, 2, 0 F : v,, ;,F 0, ; 6,, 5 : v,v 3, ;,F, ;; 4, 5, 3 Vrtx Adjacncy Tabl v 0 : v, ; ; 0, 2 v : v 3,,,v 0 ;,F, ; 3, 5,, 0 Garland and Hckbrt claim thy do this Easy to find stuff Issu is storag And updating vrything onc you do somthing lik an dg collaps for msh simplification I rcommnd you implmnt somthing simplr (lik indxd fac st plus vrtx to fac adjacncy) Partial Adjacncy Lists Partial Adjacncy Lists Stor som adjacncis, us to driv othrs Many possibilitis Edg Adjacncy Tabl 0 : v 0, v ;, ;, 2,, : v, ;,F ; 5, 0, 2, 6 Som combinations only mak sns for closd manifolds Edg Adjacncy Tabl 0 : v 0, v ;, ;, 2,, : v, ;,F ; 5, 0, 2, v 0 0 v 3 v 3 Fac Adjacncy Tabl : v 0,v, ; F,, ; 0, 2, 0 F : v,, ;,F 0, ; 6,, 5 : v,v 3, ;,F, ; 4, 5, 3 Vrtx Adjacncy Tabl v 0 : v, ; ; 0, 2 v : v 3,,,v 0 ;,F, ; 3, 5,, v 0 0 v 3 v 3 Fac Adjacncy Tabl : v 0,v, ; F,, ; 0, 2, 0 F : v,, ;,F 0, ; 6,, 5 : v,v 3, ;,F, ; 4, 5, 3 Vrtx Adjacncy Tabl v 0 : v, ; ; 0, 2 v : v 3,,,v 0 ;,F, ; 3, 5,, 0 Indpndnt facs Indxd fac st Adjacncy lists Wingd-dg Half-dg Outlin Ovrviw of msh dcimation and simplification Wingd, Half Edg Rprsntations Ida is to associat information with dgs Compact Storag Many oprations fficint Allow on to walk around msh Usually gnral for arbitrary polygons (not triangls) But implmntations can b complx with spcial cass rlativ to simpl indxd fac st++ or partial adjacncy tabl 3
4 Wingd Edg Wingd Edg Most data stord at dgs Vrtics, facs point to on dg ach v v 0 0 v 3 v 3 Edg Adjacncy Tabl 0 : v 0, v ;, ;, 2,, : v, ;,F ; 5, 0, 2, 6 Fac Adjacncy Tabl : v 0,v, ; F,, ; 0, 2, 0 F : v,, ;,F 0, ; 6,, 5 : v,v 3, ;,F, ; 4, 5, 3 Vrtx Adjacncy Tabl v 0 : v, ; ; 0, 2 v : v 3,,,v 0 ;,F, ; 3, 5,, 0 Each dg stors 2 vrtics, 2 facs, 4 dgs fixd siz Enough information to compltly walk around facs or vrtics Think how to implmnt Walking around vrtx Finding nighborhood of fac Othr ops for simplification forw,lft F lft back,lft v nd v bgin forw,right F right back,right Half Edg Outlin Instad of singl dg, 2 dirctd half dgs Maks som oprations mor fficint Walk around fac vry asily (ach fac nd only stor on pointr) h nxt F lft h inv Indpndnt facs Indxd fac st Adjacncy lists Wingd-dg Half-dg v bgin Ovrviw of msh dcimation and simplification Msh Dcimation Msh Dcimation Triangls : 4,855 27,970 20,922 2,939 8,385 4,766 Rduc numbr of polygons Lss storag Fastr rndring Simplr manipulation Dsirabl proprtis Gnrality Efficincy Producs good approximation Division, Viwpoint, Cohn Michlanglo s s St. Matthw Original modl: ~400M polygons 4
5 Primitiv Oprations Simplify modl a bit at a tim by rmoving a fw facs Rpatd to simplify whol msh Typs of oprations Vrtx clustr Vrtx rmov Edg collaps (main opration usd in assignmnt) Vrtx Clustr Mthod Mrg vrtics basd on proximity Triangls with rpatd vrtics can collaps to dgs or points Proprtis Gnral and robust Can b unattractiv if rsults in topology chang Vrtx Rmov Mthod Rmov vrtx and adjacnt facs Fill hol with nw triangls (rduction of 2) Proprtis Rquirs manifold surfac, prsrvs topology Typically mor attractiv Filling hol wll not always asy Edg Collaps Mthod Mrg two dg vrtics to on Dlt dgnrat triangls Proprtis Spcial cas of vrtx clustr Allows smooth transition Can chang topology Msh Dcimation/Simplification Typical: grdy algorithm Masur rror of possibl simpl oprations (primarily dg collapss) Plac oprations in quu according to rror Prform oprations in quu succssivly (dpnding on how much you want to simplify modl) Aftr ach opration, r-valuat rror mtrics Gomtric Error Mtrics Motivation Promot accurat 3D shap prsrvation Prsrv scrn-spac silhoutts and pixl covrag Typs Vrtx-Vrtx Distanc Vrtx-Plan Distanc Point-Surfac Distanc Surfac-Surfac Distanc 5
6 Vrtx-Vrtx Distanc E = max( v3 v, v3 v2 ) Appropriat during topology changs Rossignac and Borrl 93 Lubk and Erikson 97 Loos for topology-prsrving collapss Vrtx-Plan Distanc Stor st of plans with ach vrtx Error basd on distanc from vrtx to plans Whn vrtics ar mrgd, mrg sts Ronfard and Rossignac 96 Stor plan sts, comput max distanc Error Quadrics Garland and Hckbrt 96 Stor quadric form, comput sum of squard distancs v 3 d c d a v a b d b c Point-Surfac Distanc For ach original vrtx, find closst point on simplifid surfac Comput sum of squard distancs Surfac-Surfac Distanc Comput or approximat maximum distanc btwn input and simplifid surfacs Tolranc Volums - Guézic 96 Simplification Envlops - Cohn/Varshny 96 Hausdorff Distanc - Klin 96 Mapping Distanc - Bajaj/Schikor 96, Cohn t al. 97 Gomtric Error Obsrvations Vrtx-vrtx and vrtx-plan distanc Fast Low rror in practic, but not guarantd by mtric Surfac-surfac distanc Rquird for guarantd rror bounds Edg swap Msh Simplification Advancd Considrations Typ of input msh? Modifis topology? Continuous LOD? Spd vs. quality? vrtx-vrtx surfac-surfac 6
7 Viw-Dpndnt Simplification Simplify dynamically according to viwpoint Visibility Silhoutts Lighting Apparanc Prsrving 488 tris 975 tris,95 tris 3,905 tris Hopp 7,809 tris Caltch & Stanford Graphics Labs and Jonathan Cohn Summary Many msh data structurs Compact storag vs as, fficincy of us How fast and asy ar ky oprations Msh simplification Rduc siz of msh in fficint quality-prsrving way Basd on dg collapss mainly Choos appropriat msh data structur Efficint to updat, dg-collapss ar local Fairly modrn idas (last 0-5 yars) Think about som of it yourslf, s paprs givn out W will covr simplification, quadric mtrics nxt wk 7
To 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 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 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 informationSystems 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 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 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 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 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 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 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 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 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 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 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 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 informationGernot Hoffmann Sphere Tessellation by Icosahedron Subdivision. Contents
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
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 informationRegister Allocation. Register Allocation
Rgistr Allocation Jingk Li Portlan Stat Univrsity Jingk Li (Portlan Stat Univrsity) CS322 Rgistr Allocation 1 / 28 Rgistr Allocation Assign an unboun numbr of tmporaris to a fix numbr of rgistrs. Exampl:
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 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 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 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 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 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 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 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 informationMesh Simplification. Mesh Simplification. Mesh Simplification Goals. Mesh Simplification Motivation. Vertex Clustering. Mesh Simplification Overview
Mesh Simplification Mesh Simplification Adam Finkelstein Princeton University COS 56, Fall 008 Slides from: Funkhouser Division, Viewpoint, Cohen Mesh Simplification Motivation Interactive visualization
More informationClustering. Shannon Quinn. (with thanks to J. Leskovec, A. Rajaraman, and J. Ullman of Stanford University)
Clustring Sannon Quinn (wit tanks to J. Lskovc, A. Rajaraman, and J. Ullman of Stanford Univrsity) Hig Dimnsional Data Givn a cloud of data points w want to undrstand its structur of Massiv Datasts, ttp://www.mmds.org
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 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 informationi e ai E ig e v / gh E la ES h E A X h ES va / A SX il E A X a S
isto C o C or Co r op ra p a py ag yr g ri g g gh ht S S S V V K r V K r M K v M r v M rn v MW n W S r W Sa r W K af r: W K f : a H a M r T H r M rn w T H r Mo ns w T i o S ww c ig on a w c g nd af ww
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 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 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 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 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 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 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 informationMinimum Spanning Trees
MT Origin Minimum panning Trs Givn. Undirctd graph G with positiv dg wights (connctd). Goal. Find a min wight st of dgs that conncts all of th vrtics. 4 24 6 23 18 9 wightd graph API cycls and cuts advancd
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 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 informationProbabilistic inference
robabilistic infrnc Suppos th agnt has to mak a dcision about th valu of an unobsrvd qury variabl X givn som obsrvd vidnc E = artially obsrvabl, stochastic, pisodic nvironmnt Eampls: X = {spam, not spam},
More informationInstallation Saving. Enhanced Physical Durability Enhanced Performance Warranty The IRR Comparison
Contnts Tchnology Nwly Dvlopd Cllo Tchnology Cllo Tchnology : Improvd Absorption of Light Doubl-sidd Cll Structur Cllo Tchnology : Lss Powr Gnration Loss Extrmly Low LID Clls 3 3 4 4 4 Advantag Installation
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 informationComment (justification for change) by the MB
Editor's disposition s CD2 19763-12 as at 2013-11-03 Srial Annx (.g. 3.1) Figur/ Tabl/t (.g. Tabl 1) 001 CA 00 All All - G Canada disapprovs th draft for th rasons blow. 002 GB 01 Gnral d numbring has
More informationImage-Error-Based Level of Detail for Landscape Visualization
Vision, Modling, and Visualization (2010) Imag-Error-Basd Lvl of Dtail for Landscap Visualization M. Clasn 1 and S. Prohaska 1 1 Zus Institut Brlin, Grmany Abstract W prsnt a quasi-continuous lvl of dtail
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 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 informationTillförlitlig dimensionering mot utmattning UTMIS Vårmöte 2018 på Högskolan i Skövde
Tillförlitlig dimnsionring mot utmattning UTMIS Vårmöt 2018 på Högskolan i Skövd Rami Mansour & Mårtn Olsson KTH Hållfasthtslära mart@kth.s ramimans@kth.s Introduction Ovrviw of rliabl dsign Traditional
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 informationMesh Refinement based on Euler Encoding
Msh Rfinmnt basd on Eulr Encoding L-Jng Shiu Unirsity of Florida sl-jng@cis.ufl.du Jörg Ptrs Unirsity of Florida jorg@cis.ufl.du Abstract A squnc of msh manipulations that prsrs th Eulr inariant is calld
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 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 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 informationCS246: Mining Massive Datasets Jure Leskovec, Stanford University
CS246: Mining Massiv Datasts Jur Lskovc, Stanford Univrsity ttp://cs246.stanford.du 1/22/18 Jur Lskovc, Stanford CS246: Mining Massiv Datasts 2 Hig dim. data Grap data Infinit data Macin larning Apps Locality
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 informationAnnouncements. q This week s schedule. q Next week. q Grading. n Wednesday holiday. n Thursday class from am
Announcmnts This wk s schdul n Wdnsday holiday n Thursday class from 9.00-0.30am Nxt wk n Monday and Tusday rgular class n Wdnsday Last uiz for th cours Grading n Quiz 5, 6 and Lab 6 ar du. Applications
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 informationBig Data Analytics CSCI 4030
Hig dim. data Grap data Infinit data Macin larning Apps Locality snsitiv asing PagRank, SimRank Filtring data strams SVM Rcommn dr systms Clustring Community Dtction Wb advrtising Dcision Trs Association
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 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 informationMinimum Spanning Trees
MST Origin Minimum Spanning Trs Givn. Undirctd graph G with positiv dg wights (connctd). Goal. Find a min wight st of dgs that conncts all of th vrtics. 4 24 6 23 18 9 wightd graph API cycls and cuts Kruskal
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 informationPreview. Digital Image Processing Unit 7: Image Restoration. Unit Outline. Preview (cont.)
--6 Digital Procssing Unit 7: Rstoration Prviw Goal of imag rstoration Improv an imag in som prdfind sns Diffrnc with imag nhancmnt? Faturs rstoration v.s imag nhancmnt Objctiv procss v.s. subjctiv procss
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 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 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 informationPacing Guide for Third Grade Version 2011
GLE 0306.. Undrstand th plac valu of whol numbrs to tn-thousands plac including xpandd notation for all arithmtic oprations. 0306.. Rprsnt whol numbrs up to 0,000 using various modls (such as bastn blocs,
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 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 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 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 informationFrom Last Time. Origin of Malus law. Circular and elliptical polarization. Energy of light. The photoelectric effect. Exam 3 is Tuesday Nov.
From Last Tim Enrgy and powr in an EM wav Exam 3 is Tusday Nov. 25 5:30-7 pm, 2103 Ch (hr) Studnts w / schduld acadmic conflict plas stay aftr class Tus. Nov. 18 to arrang altrnat tim. Covrs: all matrial
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 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 informationLec 20 Error and Loss Control I: Network Coding & Coding for Storage
CS/EE 5590 / ENG 40 Spcial Topics 7804, 785, 7803 Lc 20 Error and Loss Control I: Ntwork Coding & Coding for Storag Zhu Li Cours Wb: http://l.wb.umkc.du/lizhu/taching/206sp.vido-communication/main.html
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 informationMultihop MIMO Relay Networks with ARQ
Multihop MIMO Rlay Ntworks with ARQ Yao Xi Dniz Gündüz Andra Goldsmith Dpartmnt of Elctrical Enginring Stanford Univrsity Stanford CA Dpartmnt of Elctrical Enginring Princton Univrsity Princton NJ Email:
More informationCISC 360 Fa2009. Overview. Computational Example. Real-World Pipelines: Car Washes. Michela Taufer. Pipelined
CISC 360 a2009 Ovrviw ichla Taufr Powrpoint Lctur Nots for Computr Systms: Prorammr's Prspctiv,. ryant and. O'Hallaron, Prntic Hall, CS:PP 2003 2 CISC 360 aʼ08 al-orld Piplins: Car ashs Computational xampl
More informationNASPI Work Group meeting April 24-26, 2018 Albuquerque, NM
NASPI Work Group mting April 24-26, 2018 Albuqurqu, NM Pavl Kovalnko Viktor Litvinov from Data to Action Prmium Information Srvics from Data to Action Dsign, Dvlop and Dploy - digital transformation solutions
More informationBetween Testing and Formal Verification
Btwn Tsting and Formal Vrification Jan Tobias Mühlbrg jantobias.muhlbrg@cs.kuluvn.b imc-distrint, KU Luvn, Clstijnnlaan 200A, B-3001 Blgium ScAppDv, Luvn, March 2017 1 /19 Jan Tobias Mühlbrg Btwn Tsting
More informationEvolutionary Clustering and Analysis of Bibliographic Networks
Evolutionary Clustring and Analysis of Bibliographic Ntworks Manish Gupta Univrsity of Illinois at Urbana-Champaign gupta58@illinois.du Charu C. Aggarwal IBM T. J. Watson Rsarch Cntr charu@us.ibm.com Jiawi
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 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 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 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 informationAn Agent-Based Architecture for Service Discovery and Negotiation in Wireless Networks
An Agnt-Basd Architctur for Srvic Discovry and Ngotiation in Wirlss Ntworks Abstract Erich Birchr and Torstn Braun Univrsity of Brn, Nubrückstrass 10, 3012 Brn, Switzrland Email: braun@iam.unib.ch This
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 informationLec 20 Error and Loss Control II: Network Coding & Coding for Storage
Multimdia Communication Lc 20 Error and Loss Control II: Ntwork Coding & Coding for Storag Zhu Li Cours Wb: http://l.wb.umkc.du/lizhu/ Z. Li, Multimdia Communciation, Spring 207 p. Outlin RCap Lctur 9
More informationrunning at 133 MHz bus. A Pentium III 1.26GHz with 512K cache running at 133 MHz bus is an available option. Fits Your Needs
3715 Industrial PCs 15.0" LCD Flat Panl Display DS-371500(E) Xycom Automation's nwst gnration of Industrial PCs is dsignd and tstd for th tough nvironmnts rquird for plant floor us. Our standard PC configurations
More informationVoltage Detector, High-Precision. Features. ! 3 reset output options:
M MICROCTRONIC-MARIN SA Voltag tctor, High-Prcision scription Th is an ultra-low currnt voltag dtctor availabl in a larg varity of configurations and vry small packags for maximum flxibility in all nd-applications
More informationVoltage Detector, High-Precision. Features. Name RESET
M MICROCTRONIC-MARIN SA oltag tctor, High-Prcision scription Th is an ultra-low currnt voltag dtctor availabl in a larg varity of configurations and vry small packags for maximum flxibility in all nd-applications
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 informationFuzzy Intersection and Difference Model for Topological Relations
IFS-EUSFLT 009 Fuzzy Intrsction and Diffrnc Modl for Topological Rlations hd LOODY Flornc SEDES Jordi INGLD 3 Univrsité Paul Sabatir (UPS) Toulous, 8 Rout d Narbonn, F-306-CEDEX 9, Franc Institut d Rchrchn
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 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 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 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 informationHow to fix your 260Z or 280Z clock.
Sujt Fixing th Kanto Siki lok Author E. Bttio How to fix your 260Z or 280Z lok. I first wrot this up aout two yars ago. This is th sond vrsion of this produr. It is not vry muh diffrnt to my first ffort
More information