Representing Non-Manifold Shapes in Arbitrary Dimensions

Size: px
Start display at page:

Download "Representing Non-Manifold Shapes in Arbitrary Dimensions"

Transcription

1 Represening Non-Manifold Shapes in Arbirary Dimensions Leila De Floriani,2 and Annie Hui 2 DISI, Universiy of Genova, Via Dodecaneso, Genova (Ialy). 2 Deparmen of Compuer Science, Universiy of Maryland, College Park, MD (USA). deflo@disi.unige.i, huiannie@cs.umd.edu Absrac In his paper, we describe and analyze several represenaions for complex shapes, i.e., muli-dimensional, nonmanifold objecs wih pars of mixed dimensionaliy, based on simplicial complexes. We review our work on compac and scalable represenaions for 2D and 3D simplicial complexes embedded in 3D Euclidean space. We propose a dimension-independen represenaion for simplicial complexes in which all he simplexes are uniquely and explicily encoded. Finally, we describe a decomposiion approach o he represenaion of non-manifold objecs in arbirary dimensions based on heir decomposiion ino nearly manifold componens. Keywords: shape modeling, non-manifold shapes, geomeric daa srucures. Inroducion We consider he problem of represening and manipulaing non-manifold and non-regular objecs in arbirary dimensions described by simplicial complexes. A manifold objec is a subse of he Euclidean space for which he neighborhood of each poin is homeomorphic o an open ball or o an open half-ball. Objecs, ha do no fulfill his propery a one or more poins, are called non-manifold objecs, and if hey also conain pars of differen dimensionaliies are called non-regular. Cell and simplicial complexes are widely used o represen muli-dimensional geomeric objecs in geomeric and solid modeling, in finie elemen analysis and in visualizaion. In paricular, simplicial complexes have received grea aenion, since heir combinaorial properies make hem easier o encode and manipulae. In he lieraure, represenaions have been proposed for 2D simplicial and cell complexes describing he boundary of 3D non-manifold and non-regular objecs [2, 3, 9, 20], bu such daa srucures do no scale well wih he degree of non-manifoldness (i.e., he number of geomeric singulariies) of he complex, hus becoming inefficien when dealing wih objecs wih few non-manifold singulariies. Represenaions developed for cell or simplicial complexes in arbirary dimensions, (e.g., [, 4, 7]), are resriced o a subclass of complexes, namely manifold or pseudo-manifold complexes. Here, we presen firs represenaions specific for 2D and 3D simplicial complexes embedded in he 3D Euclidean space, and hen we describe a new dimension-independen represenaion for simplicial complexes ha we are currenly developing. Anoher approach o represen non-manifold shapes consiss of decomposing he shape ino manifold componens. Some approaches have been proposed in he lieraure for uniformly-dimensional non-manifold shapes [8, 0,, 8]. We review here a sound decomposiion which produces a unique descripion of a non-manifold muli-dimensional objec as a combinaion of nearly manifold componens. This is no only he basis for a compac, dimension-independen, daa srucure for shapes described by simplicial complexes, bu i also provides a basis for non-manifold feaure recogniion and for compuing opological invarians of such shapes. The remainder of his paper is organized as follows. In Secion 2, we summarize some background noions. In Secion 3, we presen he Triangle-Segmen (TS) daa srucure for describing 2D simplicial complexes, while in Secion 4, we describe he Non-Manifold Indexed Daa Srucure wih Adjacencies (NMIA) for describing 3D simplicial complexes. In Secion 5, we presen a new dimensionindependen daa srucure for simplicial complexes. In Secion 6, we describe a decomposiion-based approach for represening non-manifold objecs. Finally, in Secion 7, we draw some concluding remarks. 2 Background In his Secion, we review some basic noions abou Euclidean simplicial complexes in arbirary dimensions, and abou opological relaions. A Euclidean simplex σ of dimension k (or a k-simplex) is he convex hull of k + linearly independen poins in he n-dimensional Euclidean space E n, 0 k n. Any Euclidean p-simplex σ, wih 0 p k, generaed by a subse of he verices of σ, is called a p-face (or, simply, a face) of σ. A finie collecion Σ of Euclidean simplexes forms a (Euclidean) simplicial complex if and only if (i), for each simplex σ Σ, all faces of σ belong o Σ, and (ii), for each pair of simplexes σ and σ, eiher σ σ = or σ σ is a face of boh σ and σ. If d is he maximum of he dimensions of he simplexes in Σ, we call Σ a d-dimensional simplicial complex, or a simplicial d-complex. The carrier of a Euclidean simplicial d-complex Σ embedded in E n, wih 0 d n, is he subse of E n defined by he union,

2 as poin ses, of all he simplexes in Σ. The boundary of a simplex σ is he se of all faces of σ in Σ, differen from σ iself. The sar of a simplex σ is he se of simplexes in Σ ha have σ as a face. The link of a simplex σ is he se of all he faces of he simplexes in he sar of σ which are no inciden in σ. Any simplex σ such ha he sar of σ conains only σ is called a op simplex. Le Σ be a simplicial d-complex and le σ Σ, wih 0 p d. We define he following opological relaions on he simplexes of Σ: For 0 q p, boundary relaion R p,q (σ) consiss of he se of q-simplexes in he se of faces of σ. For p + q d, co-boundary relaion R p,q (σ) consiss of he se of q-simplexes in he sar of σ. For p > 0, adjacency relaion R p,p (σ) is he se of p- simplexes in Σ ha are (p )-adjacen o σ (i.e., hey share a (p )-face wih σ). Adjacency relaion R 0,0 (σ), where σ is a verex, consiss of he se of verices σ such ha {σ, σ } is an -simplex of Σ. 3 A Represenaion for 2D Simplicial Complexes The Triangle-Segmen (TS) daa srucure [6] describes a 2D simplicial complex embedded in he 3D Euclidean space by encoding all verices, and op simplexes. The op simplexes are riangles and wire-edges, i.e., edges no bounding any riangle. For each verex v, he TS daa srucure sores parial relaion R 0,2(v), which encodes one riangle for each conneced componen of he sar of v ha consiss of riangles, and parial relaion R 0,(v), resriced o wire-edges, which encodes he all wire-edges inciden in v. For each riangle, he following wo relaions are sored: boundary relaion R 2,0 (), which encodes he indexes o he verices of, and parial relaion R 2,2() ha, for each edge e of, encodes he riangle(s) ha are immediaely preceding and succeeding in couner-clockwise order around edge e. In Figure, we show an example of he riangles in parial relaion R 2,2(). In he example of Figure, relaion R 2,2( ) a non-manifold edge e consiss of he riangles immediaely preceding and following along edge e in counerclockwise order, namely, 2 and 4. There is no riangle a he oher wo edges of. 4 e Figure : Encoding parial relaion R 2,2 a a non-manifold edge in he TS daa srucure In he TS daa srucure, edges are no encoded explicily, wih he excepion of wire-edges. The TS is a nonmanifold exension of he 2D version of he Indexed daa 2 3 srucure wih Adjacencies. The Indexed daa srucure wih Adjacencies (IA)[7] can represen d-dimensional manifold complexes and i sores, for each d-simplex σ, relaions R d,0, i.e., he indexes of he verices of σ, and R d,d, i.e., he d-simplexes adjacen o σ along a (d )-face, and for each verex v, parial relaion R0,d, which consiss of one d-simplex inciden a v. When applied o a manifold complex, he TS exhibis an overhead of only one bye per verex compared wih encoding i hrough he IA daa srucure. We have shown in [5] ha edge-based daa srucures, like he Loop Edge-use (LE) [5], and he Direced Edge (DE) [2] daa srucures, require a leas wice he sorage cos of he TS. A specializaion of he Parial Eniy daa srucure o 2D simplicial complexes requires four imes he space of he TS [5]. All opological relaions can be rerieved in opimal ime (i.e., in ime linear in he number of simplexes involved in he relaion) from he TS daa srucure as shown in [6]. In [6], algorihms are also presened for performing verexpair conracion (i.e., collapsing wo verices ino a new verex) and verex spli (i.e., is inverse ransformaion) on a simplicial complex encoded in he TS daa srucure. 4 A Represenaion for 3D Simplicial Complexes The Non-Manifold Indexed daa srucure wih Adjacencies (NMIA) [3] describes a hree-dimensional simplicial complex embedded he 3D Euclidean space, by encoding is verices, and all is op simplexes. We call a op 2-simplex a dangling face, and a op -simplex a wire-edge. The NMIA daa srucure sores boundary relaions R i,0, i =, 2, 3, for each op simplex (erahedron, dangling-face, and wireedge), adjacency relaion R 3,3 (), which encodes, for each erahedron, he four face-adjacen erahedra of, and parial relaions o describe non-manifold siuaions a nonmanifold verices and edges. Similarly o he TS daa srucure, for each verex v, he NMIA daa srucure sores parial relaions R 0,(v), which encodes he wire-edges inciden a v, R 0,2(v), which encodes one dangling-face for each wo-dimensional conneced componen of he sar of v, R 0,3(v), which encodes one erahedron for each hree-dimensional conneced componen of he sar of v. Noe ha in he manifold case, we would encode only R 0,3(v), which consiss of jus one erahedron a v. Similarly o he TS daa srucure, he NMIA daa srucure encodes non-manifold siuaions a edges implicily, since hese laer are no explicily described in he srucure. Thus, for each non-manifold edge e of a dangling face f, i encodes he op simplexes preceding and following f around e (in Figure 2, a edge e of dangling-face df, i encodes 4 and ). Similarly, for each non-manifold edge e of a erahedron, he NMIA srucure encodes he op simplexes preceding and following around e, when ha op simplex is no adjacen o along a face (for example, in Figure 2, a edge e of erahedron, i encodes 4, bu no 2 ). The NMIA daa srucure is a non-manifold exension

3 4 3 e 2 Figure 2: Encoding simplexes a a non-manifold edge in he NMIA daa srucure of he 3D insance of he IA daa srucure. I scales well o he manifold case, since i exhibis only an overhead of 6 byes per verex wih respec o he IA. All opological relaions can be rerieved in opimal ime from he NMIA daa srucure, wih he excepion of R,3 and R 0,3 relaions, since, for rerieving he erahedra inciden a a nonmanifold edge e, he dangling-faces inciden a e need o be raversed as well. Algorihms for performing edge collapse and is inverse, verex-spli, on he NMIA daa srucure are described in [3]. 5 A Dimension-Independen Represenaion for Simplicial Complexes A very general and dimension-independen daa srucure for cell complexes is he Incidence Graph (IG) [9], which can be specialized o simplicial complexes. I encodes all he simplexes of a simplicial d-complex Σ, and he immediae boundary, and immediae co-boundary relaions of each simplex. Namely, i sores, for each p-simplex σ, where 0 < p d, boundary relaions R p,p (σ), and, for each q- simplex σ, where 0 q <d, co-boundary relaions R q,q+ (σ). Alhough simple o manipulae, he incidence graph is a verbose daa srucure. Thus, we have defined a new dimension-independen daa srucure for simplicial complexes, called he Incidence Simplicial (IS) Daa Srucure, which sores all simplexes of he complex plus he same boundary relaions R p,p as he IG, bu parial co-boundary relaions R p,p+ insead of he full co-boundary relaions. For each p-simplex σ, R p,p+(σ) encodes jus one (p+)-simplex for each conneced componen in he sar of σ. Figure 3 shows he difference beween he IG and he IS daa srucures for 2D simplicial complexes. In he IG, he complee co-boundary relaion R 0, (v) is encoded, which consiss of all seven edges inciden a v. In he IS, only he parial co-boundary relaion R 0,(v) is encoded, and i consiss of only hree edges, since here are hree conneced componens in he link of v. We can easily see ha he IS daa srucure is more compac han he IG, especially when here are few non-manifold singulariies. If here are m (p+)-simplexes in he sar of a simplex σ, organized ino q conneced componens, he IG encodes all m (p+)-simplexes, while he IS encodes only one (p+)-simplex for each conneced componen, and hus q (p+)-simplexes. In general, q is much smaller han m (in he manifold case, for insance q =, while m may be arbirarily large). The rerieval algorihms for boundary relaions are he same in IG and IS. They are based on he ransiive closure df e 2 e 3 e v e 5 e 6 e 7 (a) e 4 e 2 e 4 Figure 3: Comparison beween IG and IS daa srucure for 2D simplicial complexes: (a) in he IG, relaion R 0 (v) = {e, e 2, e 3, e 4, e 5, e 6, e 7 } is encoded. (b) in he IS daa srucure, parial relaion R 0(v) = {e 2, e 4, e 7 } is encoded. of he R p,p encoded in boh daa srucure. The rerieval of co-boundary relaion R p,q, wih q > p is again he ransiive closure of co-boundary relaions expressible as a series of R p,p+. In he IG hese laer are sored, while in he IS hey have o be rerieved. Noe ha R d,d is encoded in he IS as well, since R d,d is he same as R d,d. The IS daa srucure scales very well o manifold cases. I exhibis an overhead of one bye and one bi per verex for manifold 2-complexes, and of four byes and four bis per verex for manifold 3-complexes. When applied o a 2D simplicial complex, he IS has an overhead of approximaely 2n compared wih he TS, where n is he number of edges in he complex. We have seen ha he sorage cos of he IS daa srucure is abou.4 he cos of he TS daa srucure in boh he manifold and non-manifold cases. 6 A Decomposiion Approach o Non-manifold Modeling A decomposiion of a non-manifold shape ino simpler pars can be obained by spliing he shape a hose elemens (verices, edges, faces, ec.) where singulariies occur. In order o be effecive, he decomposiion process should remove as many singulariies as possible, wihou inroducing arificial, or arbirary, cus hrough manifold pars. Under hese assumpions, a decomposiion ino manifold componens is possible, in general, only for wo-dimensional complexes. In hree or higher dimensions, a decomposiion ino manifold componens may need o inroduce arificial cus hrough he objec. In six or higher dimensions, a decomposiion ino manifold componens is no feasible in general, since he class of d-manifolds has been proven o be no decidable for d 6 [6]. In [7], we have defined a decomposiion which is unique, since i does no make any arbirary choice in deciding where he objec has o be decomposed, and naural, since i removes singulariies by spliing he complex a non-manifold simplexes only. We have called such a decomposiion he sandard decomposiion of he original complex, and shown ha he componens of such decomposiion, ha we called Iniial Quasi-Manifolds (IQMs), admi a local characerizaion in erms of combinaorial properies around each verex. A d-dimensional IQM is a simplicial d-complex Σ in which all op simplexes have dimension d and such ha he sar of each verex of Σ is (d )-conneced, i.e., can be raversed by moving beween adjacen d-simplexes hrough e 7 v (b)

4 heir common (d )-face. Up o dimension wo, he class of iniial quasi-manifolds coincides wih ha of manifolds. In general, in hree or higher dimensions, an IQM is no always a manifold (and no even a pseudo-manifold). However, in dimension d 3, if an IQM is embeddable in R d, i mus be a pseudo-manifold complex (i.e., a (d )-conneced complex in which every (d )-simplex is on he boundary of one, or wo d-simplexes). Based on he above heory, we have developed an algorihm for compuing a sandard decomposiion of a simplicial complex ino IQM componens. Figure 4(b) shows an example of a decomposiion of he complex depiced in Figure 4(a) ino hree iniial quasi-manifold componens. The connecion among componens is described hrough he verices bounding he k-simplexes, which are shared by more han one componen. A verex v of Σ, which is shared by several IQM componens, is called a spli verex. The copy of spli verex v in a componen C i, o which verex v belongs, is denoed as v i and i is called a verex copy. In he example shown in Figure 4, verex v is spli ino verices v, v 2 and v 3 in he decomposiion. A sandard decomposiion can be encoded also wih oher daa srucures, for insance, by using an IS represenaion for each IQM componen. Being unique, a sandard decomposiion can be he basis for searching in daa bases of 3D and higher-dimensional shapes. Moreover, i can be successfully used for exracing form feaures of differen dimensionaliies from nonmanifold objecs as well as for compuing opological invarians. In [7], a daa srucure for a simplicial complex based on is sandard decomposiion has been proposed. Any h- dimensional IQM componen can be described by an IA daa srucure, since he sar of each verex in an IQM can be raversed by using relaions R h,h plus R0,h, which encodes one h-simplex for each verex. The relaions among he componens in he decomposiion are represened as a hypergraph H. The nodes in H correspond o IQM componens and each hyperarc corresponds o a spli verex v, and i connecs all componens C i sharing v. In he hypergraph shown in Figure 4(c), a hyperarc associaes v wih he hree componens C, C 2 and C 3 hrough he hree verex copies of v shown in Figure 4(b). For every verex copy v i corresponding o a spli verex v, he daa srucure encodes references o he componen conaining v i, and o he hyperarc corresponding o v. The hypergraph suppors a verexbased raversal among componens conneced hrough he same hyperarc. Given a verex copy v i from any componen C i, we can follow he reference o is hyperarc and find all oher verex copies v j conneced wih v, as well as all oher componens sharing v. The IQM daa srucure encodes only he op simplexes and he verices. Boh he IQM and he IS daa srucures can encode d-dimensional simplicial complexes. They boh can suppor he rerieval of all boundary relaions, and of co-boundary relaion R d,d and R 0,q in opimal ime, i.e. in ime linear in he number of simplexes involved. The oher co-boundary relaions R p,q (σ), 0 < p < q can be no rerieved from he IQM daa srucure in opimal ime since he rerieval algorihms on he laer involves rerieving R 0,q for each verex of σ. The sar of σ is a subse of he union of he sars of all he verices of σ. We have shown in [5] ha he IQM daa srucure is slighly larger han he TS daa and he NMIA daa srucures for 2D and 3D complexes, respecively, bu i has he same sorage cos for manifold complexes. we w df v (a) df 2 w C C 2 w we w w 2 v w 2 (b) C 2 C 3 v 2 v v 3 C (c) v v 2 v 3 df df 2 Figure 4: A 3D complex (a); is IQM decomposiion, and associaed decomposiion graph 7 Concluding Remarks We have presened a review and an analysis of dimensionindependen and dimension-specific represenaions for nonmanifold shapes, ha we have developed or are currenly developing. Now we are working on an implemenaion of he IS daa srucure in arbirary dimensions and on opological simplificaion operaors, for applicaion o he idealizaion of finie elemen meshes generaed from CAD models. Such dimension-independen daa srucure can also find applicaions in modeling of shapes in four-dimensional space described by ime-varying erahedral meshes. A common issue in represening and manipulaing nonmanifold objecs is he availabiliy of large-size simplicial represenaions for describing such objecs, whose complexiy can easily exceed he capabiliy of compuaional ools for analyzing hem (for insance, in finie elemen simulaions). In hese cases, adapively simplified meshes, i.e., simplicial complexes in which he level of he deail varies in differen par of he objec hey describe, are ofen required. On he oher hand, accurae mesh simplificaion algorihms are oo ime consuming o be performed on-line. Thus, a muli-resoluion model, which encodes he modificaions performed by a simplificaion algorihm in a compac represenaion, is an effecive soluion. Dimensionindependen non-manifold represenaions can be inegraed wih a muli-resoluion framework, giving rise o a powerful ool for modeling non-manifold objecs a variable resoluions [4]. We have also discussed a general approach o modeling non-manifold muli-dimensional shapes based on uniquely decomposing hem ino nearly manifold pars. Such decomposiion serves boh as he basis for a compac, dimension- C 3

5 independen represenaion of simplicial complexes, and as signaures of non-manifold properies, which is very useful for reasoning on non-manifold shapes. Our curren work is on developing efficien algorihms for updaing a sandard decomposiion when a opological local operaor, such as verex pair conracion, is applied o he underlying complex. Moreover, we are using he decomposiion as he basis for non-manifold feaure recogniion and for compuing opological invarians of non-manifold shapes. 8 Acknowledgemen This work has been parially suppored by he European Nework of Excellence AIM@SHAPE under conrac number REFERENCES [] E. Brisson. Represening geomeric srucures in D dimensions: opology and order. In Proceedings 5h ACM Symposium on Compuaional Geomery, pages ACM Press, 989. [2] S. Campagna, L. Kobbel, and H.-P. Seidel. Direced edges - a scalable represenaion for riangle meshes. Journal of Graphics Tools, 3(4): 2, 998. [3] L. De Floriani and A. Hui. Updae operaions on 3D simplicial decomposiions of non-manifold objecs. In D. Fellner, edior, 9h ACM Symposium on Solid Modeling and Applicaions, pages 69 80, Genova (Ialy), 9 June ACM Press. [4] L. De Floriani and A. Hui. A dimension-independen represenaion for muli-resoluion simplicial complexes submied for publicaion. [5] L. De Floriani and A. Hui. Daa srucures for simplicial complexes: an analysis and a comparison. In M. Desbrun and H. Pomann, ediors, Third Eurographics Symposium on Geomery Processing, pages 9 28, Vienna, Ausria, July 4-6, [6] L. De Floriani, P. Magillo, E. Puppo, and D. Sobrero. A muli-resoluion opological represenaion for nonmanifold meshes. Compuer-Aided Design Journal, 36(2):4 59, February [7] L. De Floriani, M. M. Mesmoudi, F. Morando, and E. Puppo. Non-manifold decomposiions in arbirary dimensions. CVGIP: Graphical Models, 65(/3):2 22, [8] H. Desaulnier and N. Sewar. An exension of manifold boundary represenaion o r-ses. ACM Transacions on Graphics, ():40 60, 992. [9] H. Edelsbrunner. Algorihms in Combinaorial Geomery. Springer Verlag, Berlin, 987. [0] B. Falcidieno and O. Rao. Two-manifold celldecomposiion of R-ses. In A. Kilgour and L. Kjelldahl, ediors, Proceedings Compuer Graphics Forum, volume, pages , Sepember 992. [] A. Gueziec, G. Taubin, F. Lazarus, and W. Horn. Convering ses of polygons o manifold surfaces by cuing and siching. In Conference absracs and applicaions: SIGGRAPH 98, Compuer Graphics, pages ACM Press, 998. [2] E. L. Gursoz, Y. Choi, and F. B. Prinz. Verex-based represenaion of non-manifold boundaries. In M. J. Wozny, J. U. Turner, and K. Preiss, ediors, Geomeric Modeling for Produc Engineering, pages Elsevier Science Publishers B. V., Norh Holland, 990. [3] S. H. Lee and K. Lee. Parial-eniy srucure: a fas and compac non-manifold boundary represenaion based on parial opological eniies. In Proceedings Sixh ACM Symposium on Solid Modeling and Applicaions, pages 59 70, Ann Arbor, Michigan, June 200. ACM Press. [4] P. Lienhard. Topological models for boundary represenaion: a comparison wih n-dimensional generalized maps. Compuer Aided Design, 23():59 82, 99. [5] S. McMains. Geomeric Algorihms and Daa Represenaion for Solid Freeform Fabricaion. PhD hesis, Universiy of California a Berkeley, [6] A. Nabuovsky. Geomery of he space of riangulaions of a compac manifold. Commun. Mah. Phys., 8: , 996. [7] A. Paoluzzi, F. Bernardini, C. Caani, and V. Ferrucci. Dimension-independen modeling wih simplicial complexes. ACM Transacions on Graphics, 2():56 02, January 993. [8] J. Rossignac and D. Cardoze. Machmaker: manifold BReps for non-manifold R-ses. In W. F. Bronsvoor and D. C. Anderson, ediors, Proceedings Fifh Symposium on Solid Modeling and Applicaions, pages 3 4. ACM Press, 9 June 999. [9] K. Weiler. The radial-edge daa srucure: a opological represenaion for non-manifold geomeric boundary modeling. In H. W. McLaughlin J. L. Encarnacao, M. J. Wozny, edior, Geomeric Modeling for CAD Applicaions, pages Elsevier Science Publishers B. V. (Norh Holland), Amserdam, 988. [20] Y. Yamaguchi and F. Kimura. Non-manifold opology based on coupling eniies. IEEE Compuer Graphics and Applicaions, 5():42 50, January 995.

SOT: Compact Representation for Triangle and Tetrahedral Meshes

SOT: 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 information

A Matching Algorithm for Content-Based Image Retrieval

A 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 information

IA : An Adjacency-Based Representation for Non-Manifold Simplicial Shapes in Arbitrary Dimensions

IA : An Adjacency-Based Representation for Non-Manifold Simplicial Shapes in Arbitrary Dimensions IA : An Adjacency-Based Representation for Non-Manifold Simplicial Shapes in Arbitrary Dimensions David Canino a, Leila De Floriani a, Kenneth Weiss b a Department of Computer Science, University of Genova,

More information

CAMERA CALIBRATION BY REGISTRATION STEREO RECONSTRUCTION TO 3D MODEL

CAMERA 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 information

Implementing Ray Casting in Tetrahedral Meshes with Programmable Graphics Hardware (Technical Report)

Implementing 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 information

STRING DESCRIPTIONS OF DATA FOR DISPLAY*

STRING DESCRIPTIONS OF DATA FOR DISPLAY* SLAC-PUB-383 January 1968 STRING DESCRIPTIONS OF DATA FOR DISPLAY* J. E. George and W. F. Miller Compuer Science Deparmen and Sanford Linear Acceleraor Cener Sanford Universiy Sanford, California Absrac

More information

EECS 487: Interactive Computer Graphics

EECS 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 information

Image Content Representation

Image 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 information

4. Minimax and planning problems

4. 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 information

Coded Caching with Multiple File Requests

Coded 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 information

Spline Curves. Color Interpolation. Normal Interpolation. Last Time? Today. glshademodel (GL_SMOOTH); Adjacency Data Structures. Mesh Simplification

Spline 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 information

Computer representations of piecewise

Computer representations of piecewise Edior: Gabriel Taubin Inroducion o Geomeric Processing hrough Opimizaion Gabriel Taubin Brown Universiy Compuer represenaions o piecewise smooh suraces have become vial echnologies in areas ranging rom

More information

Constant-Work-Space Algorithms for Shortest Paths in Trees and Simple Polygons

Constant-Work-Space Algorithms for Shortest Paths in Trees and Simple Polygons Journal of Graph Algorihms and Applicaions hp://jgaa.info/ vol. 15, no. 5, pp. 569 586 (2011) Consan-Work-Space Algorihms for Shores Pahs in Trees and Simple Polygons Tesuo Asano 1 Wolfgang Mulzer 2 Yajun

More information

Dimension-Independent Data Structures for Arbitrary Simplicial Complexes

Dimension-Independent Data Structures for Arbitrary Simplicial Complexes Dimension-Independent Data Structures for Arbitrary Simplicial Complexes David Canino (canino.david@gmail.com) The Incidence Simplicial (IS) data structure The Generalized Indexed data structure with Adjacencies

More information

Sam 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.

Sam 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 information

STEREO PLANE MATCHING TECHNIQUE

STEREO 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 information

Lecture 18: Mix net Voting Systems

Lecture 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 information

Precise Voronoi Cell Extraction of Free-form Rational Planar Closed Curves

Precise Voronoi Cell Extraction of Free-form Rational Planar Closed Curves Precise Voronoi Cell Exracion of Free-form Raional Planar Closed Curves Iddo Hanniel, Ramanahan Muhuganapahy, Gershon Elber Deparmen of Compuer Science Technion, Israel Insiue of Technology Haifa 32000,

More information

Curves & Surfaces. Last Time? Today. Readings for Today (pick one) Limitations of Polygonal Meshes. Today. Adjacency Data Structures

Curves & 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 information

A non-stationary uniform tension controlled interpolating 4-point scheme reproducing conics

A 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 information

NURBS rendering in OpenSG Plus

NURBS 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 information

Shortest Path Algorithms. Lecture I: Shortest Path Algorithms. Example. Graphs and Matrices. Setting: Dr Kieran T. Herley.

Shortest 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 information

MORPHOLOGICAL SEGMENTATION OF IMAGE SEQUENCES

MORPHOLOGICAL 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 information

BI-TEMPORAL INDEXING

BI-TEMPORAL INDEXING BI-TEMPORAL INDEXING Mirella M. Moro Uniersidade Federal do Rio Grande do Sul Poro Alegre, RS, Brazil hp://www.inf.ufrgs.br/~mirella/ Vassilis J. Tsoras Uniersiy of California, Rierside Rierside, CA 92521,

More information

Learning in Games via Opponent Strategy Estimation and Policy Search

Learning 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 information

Simultaneous Precise Solutions to the Visibility Problem of Sculptured Models

Simultaneous Precise Solutions to the Visibility Problem of Sculptured Models Simulaneous Precise Soluions o he Visibiliy Problem of Sculpured Models Joon-Kyung Seong 1, Gershon Elber 2, and Elaine Cohen 1 1 Universiy of Uah, Sal Lake Ciy, UT84112, USA, seong@cs.uah.edu, cohen@cs.uah.edu

More information

Video Content Description Using Fuzzy Spatio-Temporal Relations

Video Content Description Using Fuzzy Spatio-Temporal Relations Proceedings of he 4s Hawaii Inernaional Conference on Sysem Sciences - 008 Video Conen Descripion Using Fuzzy Spaio-Temporal Relaions rchana M. Rajurkar *, R.C. Joshi and Sananu Chaudhary 3 Dep of Compuer

More information

PART 1 REFERENCE INFORMATION CONTROL DATA 6400 SYSTEMS CENTRAL PROCESSOR MONITOR

PART 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 information

A Formalization of Ray Casting Optimization Techniques

A Formalization of Ray Casting Optimization Techniques A Formalizaion of Ray Casing Opimizaion Techniques J. Revelles, C. Ureña Dp. Lenguajes y Sisemas Informáicos, E.T.S.I. Informáica, Universiy of Granada, Spain e-mail: [jrevelle,almagro]@ugr.es URL: hp://giig.ugr.es

More information

4.1 3D GEOMETRIC TRANSFORMATIONS

4.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 information

Evaluation and Improvement of Region-based Motion Segmentation

Evaluation and Improvement of Region-based Motion Segmentation Evaluaion and Improvemen of Region-based Moion Segmenaion Mark Ross Universiy Koblenz-Landau, Insiue of Compuaional Visualisics, Universiässraße 1, 56070 Koblenz, Germany Email: ross@uni-koblenz.de Absrac

More information

BOUNDARY REPRESENTATION MODELLING WITH LOCAL TOLERANCES

BOUNDARY REPRESENTATION MODELLING WITH LOCAL TOLERANCES BOUNDARY REPRESENTATON MODELLNG WTH LOCAL TOLERANCES David J. Jackson Parasolid Business Uni EDS Unigraphics Parker s House 6 Regen!Sree! Cambridge England ABSTRACT Convenional boundary represenaion (b-rep)

More information

Assignment 2. Due Monday Feb. 12, 10:00pm.

Assignment 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 information

Image segmentation. Motivation. Objective. Definitions. A classification of segmentation techniques. Assumptions for thresholding

Image segmentation. Motivation. Objective. Definitions. A classification of segmentation techniques. Assumptions for thresholding Moivaion Image segmenaion Which pixels belong o he same objec in an image/video sequence? (spaial segmenaion) Which frames belong o he same video sho? (emporal segmenaion) Which frames belong o he same

More information

A Routing Algorithm for Flip-Chip Design

A 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 information

Design Alternatives for a Thin Lens Spatial Integrator Array

Design Alternatives for a Thin Lens Spatial Integrator Array Egyp. J. Solids, Vol. (7), No. (), (004) 75 Design Alernaives for a Thin Lens Spaial Inegraor Array Hala Kamal *, Daniel V azquez and Javier Alda and E. Bernabeu Opics Deparmen. Universiy Compluense of

More information

Gauss-Jordan Algorithm

Gauss-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 information

Optimal Crane Scheduling

Optimal 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 information

Simple Network Management Based on PHP and SNMP

Simple Network Management Based on PHP and SNMP Simple Nework Managemen Based on PHP and SNMP Krasimir Trichkov, Elisavea Trichkova bsrac: This paper aims o presen simple mehod for nework managemen based on SNMP - managemen of Cisco rouer. The paper

More information

An Adaptive Spatial Depth Filter for 3D Rendering IP

An Adaptive Spatial Depth Filter for 3D Rendering IP JOURNAL OF SEMICONDUCTOR TECHNOLOGY AND SCIENCE, VOL.3, NO. 4, DECEMBER, 23 175 An Adapive Spaial Deph Filer for 3D Rendering IP Chang-Hyo Yu and Lee-Sup Kim Absrac In his paper, we presen a new mehod

More information

DETC2004/CIE VOLUME-BASED CUT-AND-PASTE EDITING FOR EARLY DESIGN PHASES

DETC2004/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 information

AML710 CAD LECTURE 11 SPACE CURVES. Space Curves Intrinsic properties Synthetic curves

AML710 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 information

Landmarks: A New Model for Similarity-Based Pattern Querying in Time Series Databases

Landmarks: A New Model for Similarity-Based Pattern Querying in Time Series Databases Lmarks: A New Model for Similariy-Based Paern Querying in Time Series Daabases Chang-Shing Perng Haixun Wang Sylvia R. Zhang D. So Parker perng@cs.ucla.edu hxwang@cs.ucla.edu Sylvia Zhang@cle.com so@cs.ucla.edu

More information

source managemen, naming, proecion, and service provisions. This paper concenraes on he basic processor scheduling aspecs of resource managemen. 2 The

source managemen, naming, proecion, and service provisions. This paper concenraes on he basic processor scheduling aspecs of resource managemen. 2 The Virual Compuers A New Paradigm for Disribued Operaing Sysems Banu Ozden y Aaron J. Goldberg Avi Silberschaz z 600 Mounain Ave. AT&T Bell Laboraories Murray Hill, NJ 07974 Absrac The virual compuers (VC)

More information

Video-Based Face Recognition Using Probabilistic Appearance Manifolds

Video-Based Face Recognition Using Probabilistic Appearance Manifolds Video-Based Face Recogniion Using Probabilisic Appearance Manifolds Kuang-Chih Lee Jeffrey Ho Ming-Hsuan Yang David Kriegman klee10@uiuc.edu jho@cs.ucsd.edu myang@honda-ri.com kriegman@cs.ucsd.edu Compuer

More information

Network management and QoS provisioning - QoS in Frame Relay. . packet switching with virtual circuit service (virtual circuits are bidirectional);

Network 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 information

Scheduling. Scheduling. EDA421/DIT171 - Parallel and Distributed Real-Time Systems, Chalmers/GU, 2011/2012 Lecture #4 Updated March 16, 2012

Scheduling. Scheduling. EDA421/DIT171 - Parallel and Distributed Real-Time Systems, Chalmers/GU, 2011/2012 Lecture #4 Updated March 16, 2012 EDA421/DIT171 - Parallel and Disribued Real-Time Sysems, Chalmers/GU, 2011/2012 Lecure #4 Updaed March 16, 2012 Aemps o mee applicaion consrains should be done in a proacive way hrough scheduling. Schedule

More information

Restorable Dynamic Quality of Service Routing

Restorable Dynamic Quality of Service Routing QOS ROUTING Resorable Dynamic Qualiy of Service Rouing Murali Kodialam and T. V. Lakshman, Lucen Technologies ABSTRACT The focus of qualiy-of-service rouing has been on he rouing of a single pah saisfying

More information

A METHOD OF MODELING DEFORMATION OF AN OBJECT EMPLOYING SURROUNDING VIDEO CAMERAS

A METHOD OF MODELING DEFORMATION OF AN OBJECT EMPLOYING SURROUNDING VIDEO CAMERAS A METHOD OF MODELING DEFORMATION OF AN OBJECT EMLOYING SURROUNDING IDEO CAMERAS Joo Kooi TAN, Seiji ISHIKAWA Deparmen of Mechanical and Conrol Engineering Kushu Insiue of Technolog, Japan ehelan@is.cnl.kuech.ac.jp,

More information

Chapter Six Chapter Six

Chapter 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 information

Accurate Simplification of Multi-Chart Textured Models

Accurate Simplification of Multi-Chart Textured Models DOI: 10.1111/j.1467-8659.2010.01652.x COMPUTER GRAPHICS forum Volume 29 (2010), number 6 pp. 1842 1853 Accurae Simplificaion of Muli-Char Texured Models N. Coll and T. Paradinas Insiu d Informaica i Aplicacions,

More information

Nonparametric CUSUM Charts for Process Variability

Nonparametric 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

Data Structures and Algorithms. The material for this lecture is drawn, in part, from The Practice of Programming (Kernighan & Pike) Chapter 2

Data 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 information

Feature-Preserving Reconstruction of Singular Surfaces

Feature-Preserving Reconstruction of Singular Surfaces Eurographics Symposium on Geomery Processing 2012 Eian Grinspun and Niloy Mira (Gues Ediors) Volume 31 (2012), Number 5 Feaure-Preserving Reconsrucion of Singular Surfaces T. K. Dey 1 and X. Ge 1 and Q.

More information

Today. Curves & Surfaces. Can We Disguise the Facets? Limitations of Polygonal Meshes. Better, but not always good enough

Today. Curves & Surfaces. Can We Disguise the Facets? Limitations of Polygonal Meshes. Better, but not always good enough Today Curves & Surfaces Moivaion Limiaions of Polygonal Models Some Modeling Tools & Definiions Curves Surfaces / Paches Subdivision Surfaces Limiaions of Polygonal Meshes Can We Disguise he Faces? Planar

More information

NRMI: Natural and Efficient Middleware

NRMI: Natural and Efficient Middleware NRMI: Naural and Efficien Middleware Eli Tilevich and Yannis Smaragdakis Cener for Experimenal Research in Compuer Sysems (CERCS), College of Compuing, Georgia Tech {ilevich, yannis}@cc.gaech.edu Absrac

More information

A time-space consistency solution for hardware-in-the-loop simulation system

A 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 information

CENG 477 Introduction to Computer Graphics. Modeling Transformations

CENG 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 information

1 œ DRUM SET KEY. 8 Odd Meter Clave Conor Guilfoyle. Cowbell (neck) Cymbal. Hi-hat. Floor tom (shell) Clave block. Cowbell (mouth) Hi tom.

1 œ 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 information

Motion Level-of-Detail: A Simplification Method on Crowd Scene

Motion 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 information

IAJIT First Online Publication

IAJIT First Online Publication An Improved Feaure Exracion and Combinaion of Muliple Classifiers for Query-by- ming Naha Phiwma and Parinya Sanguansa 2 Deparmen of Compuer Science, Suan Dusi Rajabha Universiy, Thailand 2 Faculy of Engineering

More information

COSC 3213: Computer Networks I Chapter 6 Handout # 7

COSC 3213: Computer Networks I Chapter 6 Handout # 7 COSC 3213: Compuer Neworks I Chaper 6 Handou # 7 Insrucor: Dr. Marvin Mandelbaum Deparmen of Compuer Science York Universiy F05 Secion A Medium Access Conrol (MAC) Topics: 1. Muliple Access Communicaions:

More information

Interactive Cuts through 3-Dimensional Soft Tissue

Interactive Cuts through 3-Dimensional Soft Tissue Insiue of Scienific Compuing Eidgenossische Technische Hochschule Zurich Ecole polyechnique federale de Zurich Poliecnico federale di Zurigo Swiss Federal Insiue of Technology Zurich Compuer Graphics Research

More information

CS 152 Computer Architecture and Engineering. Lecture 7 - Memory Hierarchy-II

CS 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 information

An Efficient Delivery Scheme for Coded Caching

An 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 information

In this paper we discuss the automatic construction of. are Delaunay triangulations whose smallest angles are bounded and, in

In 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 information

Outline. EECS Components and Design Techniques for Digital Systems. Lec 06 Using FSMs Review: Typical Controller: state

Outline. EECS Components and Design Techniques for Digital Systems. Lec 06 Using FSMs Review: Typical Controller: state Ouline EECS 5 - Componens and Design Techniques for Digial Sysems Lec 6 Using FSMs 9-3-7 Review FSMs Mapping o FPGAs Typical uses of FSMs Synchronous Seq. Circuis safe composiion Timing FSMs in verilog

More information

REDUCTIONS BBM ALGORITHMS DEPT. OF COMPUTER ENGINEERING ERKUT ERDEM. Bird s-eye view. May. 12, Reduction.

REDUCTIONS BBM ALGORITHMS DEPT. OF COMPUTER ENGINEERING ERKUT ERDEM. Bird s-eye view. May. 12, Reduction. BBM 0 - ALGORITHMS DEPT. OF COMPUTER ENGINEERING ERKUT ERDEM REDUCTIONS May., 0 Bird s-eye view Desideraa. Classify problems according o compuaional requiremens. complexiy order of growh examples linear

More information

The University of Sheffield Department of Computer Science. Indexing XML Databases: Classifications, Problems Identification and a New Approach

The University of Sheffield Department of Computer Science. Indexing XML Databases: Classifications, Problems Identification and a New Approach The Universiy of Sheffield Deparmen of Compuer Science Indexing XML Daabases: Classificaions, Problems Idenificaion and a New Approach Research Memorandum CS-7-5 Mohammed Al-Badawi Compuer Science Dep

More information

Visualizing Complex Notions of Time

Visualizing Complex Notions of Time Visualizing Complex Noions of Time Rober Kosara, Silvia Miksch Insiue of Sofware Technology, Vienna Universiy of Technology, Vienna, Ausria Absrac Time plays an imporan role in medicine. Condiions are

More information

On Continuity of Complex Fuzzy Functions

On Continuity of Complex Fuzzy Functions Mahemaical Theory and Modeling www.iise.org On Coninuiy of Complex Fuzzy Funcions Pishiwan O. Sabir Deparmen of Mahemaics Faculy of Science and Science Educaion Universiy of Sulaimani Iraq pishiwan.sabir@gmail.com

More information

MATH Differential Equations September 15, 2008 Project 1, Fall 2008 Due: September 24, 2008

MATH 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 information

Distributed Task Negotiation in Modular Robots

Distributed Task Negotiation in Modular Robots Disribued Task Negoiaion in Modular Robos Behnam Salemi, eer Will, and Wei-Min Shen USC Informaion Sciences Insiue and Compuer Science Deparmen Marina del Rey, USA, {salemi, will, shen}@isi.edu Inroducion

More information

Querying Moving Objects in SECONDO

Querying Moving Objects in SECONDO Querying Moving Objecs in SECONDO Vicor Teixeira de Almeida, Ralf Harmu Güing, and Thomas Behr LG Daenbanksyseme für neue Anwendungen Fachbereich Informaik, Fernuniversiä Hagen D-58084 Hagen, Germany {vicor.almeida,

More information

Quantitative macro models feature an infinite number of periods A more realistic (?) view of time

Quantitative 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 information

Last Time: Curves & Surfaces. Today. Questions? Limitations of Polygonal Meshes. Can We Disguise the Facets?

Last 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 information

A Review on Block Matching Motion Estimation and Automata Theory based Approaches for Fractal Coding

A Review on Block Matching Motion Estimation and Automata Theory based Approaches for Fractal Coding Regular Issue A Review on Block Maching Moion Esimaion and Auomaa Theory based Approaches for Fracal Coding Shailesh D Kamble 1, Nileshsingh V Thakur 2, and Preei R Bajaj 3 1 Compuer Science & Engineering,

More information

COMP26120: Algorithms and Imperative Programming

COMP26120: 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 information

A NEW APPROACH FOR 3D MODELS TRANSMISSION

A NEW APPROACH FOR 3D MODELS TRANSMISSION A NEW APPROACH FOR 3D MODELS TRANSMISSION A. Guarnieri a, F. Piroi a, M. Ponin a, A. Veore a a CIRGEO, Inerdep. Research Cener of Carography, Phoogrammery, Remoe Sensing and GIS Universiy of Padova, Agripolis

More information

A GRAPHICS PROCESSING UNIT IMPLEMENTATION OF THE PARTICLE FILTER

A GRAPHICS PROCESSING UNIT IMPLEMENTATION OF THE PARTICLE FILTER A GRAPHICS PROCESSING UNIT IMPLEMENTATION OF THE PARTICLE FILTER ABSTRACT Modern graphics cards for compuers, and especially heir graphics processing unis (GPUs), are designed for fas rendering of graphics.

More information

FIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS

FIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS FIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS Mohammed A. Aseeri and M. I. Sobhy Deparmen of Elecronics, The Universiy of Ken a Canerbury Canerbury, Ken, CT2

More information

Rule-Based Multi-Query Optimization

Rule-Based Multi-Query Optimization Rule-Based Muli-Query Opimizaion Mingsheng Hong Dep. of Compuer cience Cornell Universiy mshong@cs.cornell.edu Johannes Gehrke Dep. of Compuer cience Cornell Universiy johannes@cs.cornell.edu Mirek Riedewald

More information

A GRAPHICS PROCESSING UNIT IMPLEMENTATION OF THE PARTICLE FILTER

A GRAPHICS PROCESSING UNIT IMPLEMENTATION OF THE PARTICLE FILTER A GRAPHICS PROCESSING UNIT IMPLEMENTATION OF THE PARTICLE FILTER Gusaf Hendeby, Jeroen D. Hol, Rickard Karlsson, Fredrik Gusafsson Deparmen of Elecrical Engineering Auomaic Conrol Linköping Universiy,

More information

Analysis of Various Types of Bugs in the Object Oriented Java Script Language Coding

Analysis of Various Types of Bugs in the Object Oriented Java Script Language Coding Indian Journal of Science and Technology, Vol 8(21), DOI: 10.17485/ijs/2015/v8i21/69958, Sepember 2015 ISSN (Prin) : 0974-6846 ISSN (Online) : 0974-5645 Analysis of Various Types of Bugs in he Objec Oriened

More information

LHP: An end-to-end reliable transport protocol over wireless data networks

LHP: An end-to-end reliable transport protocol over wireless data networks LHP: An end-o-end reliable ranspor proocol over wireless daa neworks Xia Gao, Suhas N. Diggavi, S. Muhukrishnan Absrac The nex generaion wireless neworks are posied o suppor large scale daa applicaions.

More information

LAMP: 3D Layered, Adaptive-resolution and Multiperspective Panorama - a New Scene Representation

LAMP: 3D Layered, Adaptive-resolution and Multiperspective Panorama - a New Scene Representation Submission o Special Issue of CVIU on Model-based and Image-based 3D Scene Represenaion for Ineracive Visualizaion LAMP: 3D Layered, Adapive-resoluion and Muliperspecive Panorama - a New Scene Represenaion

More information

Chapter 4 Sequential Instructions

Chapter 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 information

Why Waste a Perfectly Good Abstraction?

Why Waste a Perfectly Good Abstraction? Why Wase a Perfecly Good Absracion? Arie Gurfinkel and Marsha Chechik Deparmen of Compuer Science, Universiy of Torono, Torono, ON M5S 3G4, Canada. Email: arie,chechik@cs.orono.edu Absrac. Sofware model-checking

More information

Fully Dynamic Algorithm for Top-k Densest Subgraphs

Fully Dynamic Algorithm for Top-k Densest Subgraphs Fully Dynamic Algorihm for Top-k Denses Subgraphs Muhammad Anis Uddin Nasir 1, Arisides Gionis 2, Gianmarco De Francisci Morales 3 Sarunas Girdzijauskas 4 Royal Insiue of Technology, Sweden Aalo Universiy,

More information

Chapter 8 LOCATION SERVICES

Chapter 8 LOCATION SERVICES Disribued Compuing Group Chaper 8 LOCATION SERVICES Mobile Compuing Winer 2005 / 2006 Overview Mobile IP Moivaion Daa ransfer Encapsulaion Locaion Services & Rouing Classificaion of locaion services Home

More information

The Impact of Product Development on the Lifecycle of Defects

The Impact of Product Development on the Lifecycle of Defects The Impac of Produc Developmen on he Lifecycle of Rudolf Ramler Sofware Compeence Cener Hagenberg Sofware Park 21 A-4232 Hagenberg, Ausria +43 7236 3343 872 rudolf.ramler@scch.a ABSTRACT This paper invesigaes

More information

Tracking Appearances with Occlusions

Tracking Appearances with Occlusions Tracking ppearances wih Occlusions Ying Wu, Ting Yu, Gang Hua Deparmen of Elecrical & Compuer Engineering Norhwesern Universiy 2145 Sheridan oad, Evanson, IL 60208 {yingwu,ingyu,ganghua}@ece.nwu.edu bsrac

More information

Learning nonlinear appearance manifolds for robot localization

Learning nonlinear appearance manifolds for robot localization Learning nonlinear appearance manifolds for robo localizaion Jihun Hamm, Yuanqing Lin, and Daniel. D. Lee GRAS Lab, Deparmen of Elecrical and Sysems Engineering Universiy of ennsylvania, hiladelphia, A

More information

A Tool for Multi-Hour ATM Network Design considering Mixed Peer-to-Peer and Client-Server based Services

A Tool for Multi-Hour ATM Network Design considering Mixed Peer-to-Peer and Client-Server based Services A Tool for Muli-Hour ATM Nework Design considering Mied Peer-o-Peer and Clien-Server based Services Conac Auhor Name: Luis Cardoso Company / Organizaion: Porugal Telecom Inovação Complee Mailing Address:

More information

Effects needed for Realism. Ray Tracing. Ray Tracing: History. Outline. Foundations of Computer Graphics (Fall 2012)

Effects needed for Realism. Ray Tracing. Ray Tracing: History. Outline. Foundations of Computer Graphics (Fall 2012) Foundaions of ompuer Graphics (Fall 2012) S 184, Lecure 16: Ray Tracing hp://ins.eecs.berkeley.edu/~cs184 Effecs needed for Realism (Sof) Shadows Reflecions (Mirrors and Glossy) Transparency (Waer, Glass)

More information

A Dimension-Independent Data Structure for Simplicial Complexes

A Dimension-Independent Data Structure for Simplicial Complexes A Dimension-Independent Data Structure for Simplicial Complexes Leila De Floriani 1, Annie Hui 2, Daniele Panozzo 1, and Daid Canino 1 1 Department of Computer Science, Uniersity of Genoa, Italy deflo@disi.unige.it,

More information

A High-Speed Adaptive Multi-Module Structured Light Scanner

A 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

User Adjustable Process Scheduling Mechanism for a Multiprocessor Embedded System

User Adjustable Process Scheduling Mechanism for a Multiprocessor Embedded System Proceedings of he 6h WSEAS Inernaional Conference on Applied Compuer Science, Tenerife, Canary Islands, Spain, December 16-18, 2006 346 User Adjusable Process Scheduling Mechanism for a Muliprocessor Embedded

More information

A New Semantic Cache Management Method in Mobile Databases

A New Semantic Cache Management Method in Mobile Databases Journal o Compuer Science 1 (3): 351-354, 25 ISSN 1549-3636 Science Publicaions, 25 A New Semanic Cache Managemen Mehod in Mobile Daabases Shengei Shi, Jianzhong Li and Chaokun Wang School o Compuer Science

More information

Audio Engineering Society. Convention Paper. Presented at the 119th Convention 2005 October 7 10 New York, New York USA

Audio Engineering Society. Convention Paper. Presented at the 119th Convention 2005 October 7 10 New York, New York USA Audio Engineering Sociey Convenion Paper Presened a he 119h Convenion 2005 Ocober 7 10 New Yor, New Yor USA This convenion paper has been reproduced from he auhor's advance manuscrip, wihou ediing, correcions,

More information