p 1 p 2 p 3 S u( ) θ

Size: px
Start display at page:

Download "p 1 p 2 p 3 S u( ) θ"

Transcription

1 Preprint of a paper pblished in inimal Srfaces, Geometric Analysis and Symplectic Geometry Adv. Std. Pre ath, 34 (2002) SOLUTION TO THE SHADOW PROBLE IN 3-SPACE OHAAD GHOI Abstract. If a convex srface, sch as an egg shell, is illminated from any given direction, then the corresponding shadow cast on the srface forms a connected sbset. The shadow problem, first stdied by H. Wente in 1978, asks whether a converse of this phenomenon is tre as well. In this report it is shown that the answer is yes provided that each shadow is simply connected; otherwise, the answer is no. Frther, the motivations behind this problem, and some ramifications of its soltion for stdying constant mean crvatre srfaces in 3-space (soap bbbles) are discssed. 1. Introdction Let ρ R 3 be a smooth convex srface, i.e., the bondary of a convex body; let n:! S 2 denote the otward nit normal vectorfield, which we also refer to as the Gass map, of ; and let 2 S 2 be a nit vector. Sppose that is illminated by parallel rays of light flowing in the direction of, see Figre 1. Then, the shadow p n(p) Figre 1. The shadow cast on a srface, when illminated by light rays parallel to corresponds to points p in where the inner prodct between and the nit normal n(p) is positive. cast on, i.e., the set of points in not reached by the rays of light, is given by (1.1) S := f p 2 j hn(p);i>0g; 1991 athematics Sbject Classification. Primary 53A05, 53A02; Secondary 52A15, 53C45. Last Typeset September 9,

2 2 OHAAD GHOI where h ; i denotes the standard inner prodct in R 3. It is intitively clear, and not too difficlt to show [6], that if is convex, then, for every 2 S 2, S is a connected sbset of. It is natral to ask whether the connectedness of the shadows characterizes convex srfaces, i.e., whether the converse of the above phenomenon holds as well. ore precisely, let be a closed (i.e., compact and connected) srface immersed in R 3. Sppose that is oriented, so that the Gass map is globally well-defined. Then, for every nit vector 2 S 2, let the corresponding shadow, S, be defined as in (1.1). Sppose that for every, S is a connected sbset of. Does it then follow that is convex? In 1978, motivated by problems concerning the stability of constant mean crvatre srfaces, H. Wente appears to have been the first person to have stdied the above qestion [18], see Section 4, which has since become known as the shadow problem (a.k.a. the illmination conjectre). Recently, the athor has proved that this problem has a positive soltion provided that the shadows are simply connected: Theorem 1.1. Let be an oriented compact srface immersed in R 3. Sppose that for every 2 S 2, the corresponding shadow, S, is simply connected. Then is convex. In particlar, is embedded and homeomorphic to S 2. A proof of the above theorem is otlined in Section 2. Frthermore, in Section 3, we will show that the additional condition in Theorem 1.1 (the word simply) is in fact necessary, as there exist embedded closed srfaces of gens one all of whose shadows are connected. Some ramifications for stdying constant mean crvatre srfaces will be discssed in Section 4. Note 1.2. If is assmed to be simply connected, then the assmption, in Theorem 1.1, that the shadows be `simply connected' may be weakened to `connected' [6]. Note 1.3. The compactness assmption in Theorem 1.1 cannot be removed. Sppose, for instance, that is a hyperbolic paraboloid, sch as the one given by the graph of the eqation z = xy. Then all the shadows of are simply connected, even thogh is not a convex srface. To see this, let H denote the (open) hemisphere in S 2 determined by the nit vector, i.e., let H := fx 2 S 2 j hx; i > 0g. A direct comptation shows that the Gass map of, n, is a homeomorphism into H (0;0;1) (the Northern hemisphere). Frther, note that S = n 1 (H ) = n 1 (H H (0;0;1)). Ths, since H H (0;0;1) is simply connected, it follows that S is simply connected as well. 2. Otline of the Proof The proof is by contradiction, and is organized into three steps described below. The first two steps employ techniqes from orse theory [14], and the third step, which is the main part of the proof, introdces a topological invariant for shadows by permting the critical points of height fnctions. For a fll treatment of all the details, we refer the reader to [10] or [6].

3 SOLUTION TO THE SHADOW PROBLE IN 3-SPACE Critical points of height fnctions. Sppose that satisfies the hypothesis of Theorem 1.1, bt is not convex. Then there exists a nit vector v 2 S 2 sch that the corresponding height fnction h v :! R, defined by h v (p) := hp; vi; has at least three nondegenerate critical points, see Figre 2. This follows from basics p 2 p 3 v Μ p 1 Figre 2. If a closed srface,, immersed in R 3, is not convex, then there exists a direction, v, sch that the corresponding height fnction, h v, is a orse fnction with at least three critical points. of the theory of tight immersions [4] going back to the works of Chern and Lashof [5]: let #C(h ) denote the nmber of critical points of a orse height fnction h, and let K be the Gass crvatre of ; then one has the following formla 1 2 Z Z #C(h ) d = S 2 jk(x)j dx: Note that the integral on the left is well-defined, becase for almost every 2 S 2, h is a orse fnction (this is an easy application of Sard's theorem), and conseqently #C(h ) is finite. The integral on the right is known as the total absolte crvatre, which is bonded below by 4ß, becase the Gass map is srjective. R jk(x)jdx attains its minimm only when is convex [5, Thm 3]. Ths, assming that is not convex, R jk(x)jdx > 4ß. Conseqently, by the above formla, there has to exist a orse fnction, h v, with more than two critical points Reglarity of the bondary of shadows. Let v? := f 2 S 2 j h; vi = 0g. Using Sard's theorem, it can be shown that, after a pertrbation of v, we can assme that there exists a vector 0 2 v?, sch that the bondary of the corresponding 0, is a reglar sbmanifold of. This is a conseqence of the fact that, for almost every 2 S is reglar, which, briefly, may be proved as follows: define the shadow fnction f :! R by f (p) := hn(p);i; and observe ρ f 1 (0). Frther, let UT denote the nit tangent bndle of, i.e., UT := f(p; t p ) j p 2 ; t p 2 T p ; and kt p k = 1g. Define fi : UT! S 2

4 4 OHAAD GHOI and ß : UT!, by fi(p; t p ) := t p and ß(p; t p ) := p respectively. UT? y ß! fi S 2 Then f 1 (0) = ß(fi 1 ()). Let be a reglar vale of fi. Then fi 1 () is a reglar crve in UT. Frther, it is not too difficlt to show that ß is an embedding on fi 1 (). Hence, by Sard's theorem, for almost every, f 1 (0), and is a reglar crve (for more reslts of this type and an introdction to stdying geometry of the shadow bondaries on illminated srfaces see [11]). After a rotation of the coordinate axis, and for the sake of convenience, we assme from now on that v = (0; 0; 1) and 0 = (1; 0; 0). Frther, we parameterize v? by ( ) := (cos ; sin ; 0), 2 [0; 2ß] Indced permtations on the critical points. Let p i, i = 1; 2; 3, denote three critical points of h v. For every 2 [0; 2ß], we define a permtation ff( ) 2 Sym(p 1 ;p 2 ;p 3 ), the symmetric grop of three elements, as follows. Fix 2 [0; 2ß]. Note that p i ( ); frthermore, since p i is a nondegenerate critical point of the height fnction h v, it follows ( ) is reglar in a neighborhood of p i, see Figre 3. This together with the simply-connectedness of S ( ) n(p) p p S S 2 S Figre 3. If p is a reglar critical point of the height fnction h v, then n(p) = ±v, and for every 2 S 2 orthogonal to n(p) the bondary of the corresponding is reglar in a neighborhood of p; becase, n is a local diffeomorphism at p, is the pll-back via n of a great circle in S 2. implies that there exists a simple closed crve T in the closre of S ( ) sch that: (i) T is composed of three smooth arcs which end at p i, (ii) each arc ( ) transversally, and (iii) the interior of each arc lies in S ( ). We say that sch a crve is a standard triangle for S ( ), see Figre 4. Since S ( ) is simply connected, T bonds a niqe region in S ( ). This region inherits an orientation from (recall that is, by assmption, oriented), which in trn indces a preferred sense of direction on T. The indced direction on T determines a permtations for p i in a natral way; for instance, sppose that as we move along T away from p 1 we enconter p 2

5 SOLUTION TO THE SHADOW PROBLE IN 3-SPACE 5 p 1 Τ p 2 p 3 S ( ) θ Μ Figre 4. Each shadow, S ( ), contains a standard triangle. Note that the bondary of the shadow is a reglar crve in a neighborhood of the critical points p i. before reaching p 3, then we say that the indced permtation is the cycle (p 1 p 2 p 3 ). Finally, note that the indced permtation on p i does not depend on the choice of the standard triangle; becase, if T 0 is any other standard triangle in S ( ), then T 0 and T are homotopic in S ( ) by the simply-connectedness of S ( ). So we conclde that each shadow S ( ) determines a niqe permtation on fp 1 ;p 2 ;p 3 g, which we denote by ff( ). We claim that the map ff : [0; 2ß]! Sym(p 1 ;p 2 ;p 3 ) which we defined above is constant. To this end, since [0; 2ß] is connected, it sffices to show that ff is locally constant. This follows from the fact that whenever and 0 are sfficiently close, then S ( ) and S ( 0 ) have a standard triangle in common, see Figre 5. The proof p 1 Τ p 2 p 3 S ( θ + ε ) Μ Figre 5. For every there exists an ffl > 0 sch that the shadows S ( ) and S ( +ffl) have a standard triangle in common. This shows that the indced permtation on fp 1 ;p 2 ;p 3 g is locally constant. of this is based on the compactness of T, the assmption that T ( ) only at p i and does so transversally, and the observation that in a neighborhood of p ( ) depends continosly on.

6 6 OHAAD GHOI On the other hand, it is not difficlt to show that ff(0) 6= ff(ß). To see this, recall (0) is reglar by constrction. This implies (ß) (0). Frther, since S (0) is, by assmption, simply (0) is connected. In (0) is a simple closed crve passing throgh p i. Sppose (0) is given the orientation indced by S (0), and note that the corresponding permtation indced on p i coincides with ff(0), becase all standard triangles in S (0) are homotopic (0). Similarly, ( ) is oriented by S (ß), then this gives rise to a permtation of p i which is identical with ff(ß). S (0) and S (ß) indce opposite orientations ( ). Hence ff(0) = ff(ß), which prodces the desired contradiction and completes the proof. 3. A Conterexample In this section we show that Theorem 1.1 does not remain valid if the condition that the shadows be `simply connected' is replaced by `connected'. ore specifically, we show that there exists a smooth embedded srface of gens one all of whose shadows are connected. This srface is given by bilding a tbe arond a closed crve withot any pairs of parallel tangent lines. An explicit example of sch a crve, formlated by Ralph Howard, is given by fl(t) := (x(t);y(t);z(t)), where (3.1) x(t) := cos(t) 1 20 cos(4t) cos(2t); y(t) := + sin(t) sin(2t) sin(4t); z(t) := sin(3t) 2 cos(3t) sin(3t); 15 t 2 [0; 2ß]. Figre 6 shows the pictres of a small tbe bilt arond the above crve. Let denote the trace of fl. Since is a reglar sbmanifold, it follows from the Figre 6. Three different views of a nonconvex srface all of whose shadows are connected. This srface is constrcted by bilding a tbe arond a crve with no pair of parallel tangents.

7 SOLUTION TO THE SHADOW PROBLE IN 3-SPACE 7 tblar neighborhood theorem that there exists an r > 0 sch that := fx 2 R 3 j dist(x; ) = rg is a smooth srface, where dist(x; ) := inf y2 kx yk. We claim that, since has no pair of parallel tangent lines, each shadow of is a connected sbset. Before proving this, however, we describe a general procedre for constrcting. Let T ρ S 2 be a smooth simple closed crve sch that (i) the origin is contained in the interior of the convex hll of T, (0; 0; 0) 2 int conv T, and (ii) T does not contain any pair of antipodal points. Althogh it is not immediately clear that sch crves exist, they are not difficlt to constrct. Figre 7 shows an example, which is perhaps, qalitatively speaking, the simplest. Let T (s), s 2 R, denote a periodic Figre 7. A simple closed crve on the sphere which contains the origin in the interior of its convex and is disjoint from its antipodal reflection. An appropriate integration of the above yields a space crve with no parallel tangents. parameterization of T by arclength. So, assming T has total length L, we have T (s + L) = T (s). Since (0; 0; 0) 2 int conv T, there exists a (density) fnction v(s) with period L sch that R L 0 v(s)t (s) ds = 0; or, intitively speaking, it is possible to distribte mass along T so that the center of gravity of the reslting object coincides with the origin. Now set fl(t) := Z t 0 v(s)t (s) ds: Then fl(t + L) = fl(t). Frther, fl 0 (t)=kfl 0 (t)k = T (t). Ths fl is a closed crve whose tangential spherical image coincides with T. In particlar, fl has no parallel tangent lines. Hence (the trace of fl) is the desired crve. Next we show that, given by a small tbe arond, has connected shadows. To see this, let ß :! be the obvios projection, i.e., the nearest point map. For every x 2, let F x := ß 1 (x) be the corresponding fiber. Note that (i) each fiber, F x, is a circle, (ii) the image of each fiber nder the Gass map, n(f x ), is the great circle in S 2 which lies in the plane perpendiclar to T (x), and (iii) n is one-to-one on each F x. Let 2 S 2, and let S be the corresponding shadow cast on. Recall that S = n 1 (H ), where H := fx 2 S 2 j hx; i > 0g is an open hemisphere, see Figre 8. Ths, for each fiber, F x, we have only two possibilities:

8 8 OHAAD GHOI F x n( F x ) x T(x) T(x) Γ Figre 8. Unless T (x) and are parallel, the fiber F x of the tbe arond intersects the shadow S along an open semicircle. either F x intersects S in an open half-circle, or F x is disjoint from S. Bt, by constrction of, the latter occrs for at most for one x 2. Hence, it follows that each shadow, S, is either homeomorphic to a disk or an annls. In particlar, S is connected for every 2 S 2. Note 3.1. It is an elementary and well-known fact that if is a closed crve, then its tangential spherical image (a.k.a. tangent indicatrix or tantrix), contains the origin in the interior of its convex hll. Here we showed that a converse of this phenomenon holds as well. This observation is also known, and has been attribted to Löwner; bt it is not clear if it had ever been pblished by him. See [12] for detailed proofs and historical comments. A proof may also be fond in [8, p. 168] Note 3.2. It is possible to constrct a simple closed crve withot parallel tangents which lies on a cylinder with a convex base. In fact, the eqations (3.1) give one sch example. So a loop withot parallel tangents may lie on the bondary of a convex body. Interestingly enogh, however, no sch crve may be constrcted on an ellipsoid. This follows from recent reslts of Joel Weiner [21] or Brce Solomon [17] who showed that the tantrix of a spherical crve, if embedded, divides the sphere into eqal areas. Conseqently, any loop on a sphere has to have a pair of parallel tangents. Frther, ellipsoids mst have this property as well, becase they are eqivalent to the sphere p to a linear transformation. It wold be interesting to know if ellipsoids are the only closed srfaces which admit no loops withot parallel tangent Applications 4.1. Stable Constant ean Crvatre Srfaces. In this section we discss the original motivation for stdying the shadow problem, and indicate how one can obtain a classical isoperimetric reslt sing Theorem 1.1. Let be an oriented, closed, and stable constant mean crvatre (CC) srface immersed in R 3. Stable means that is a critical srface for the area fnctional 1 Note added in proof: since this paper was first written, the athor and Brce Solomon have proved that the property of having no loops withot parallel tangent lines (skew loops), does indeed characterize ellipsoids amongst all closed srfaces immersed in 3-space [7].

9 SOLUTION TO THE SHADOW PROBLE IN 3-SPACE 9 sbject to a volme constraint. In 1978, when the shadow problem seems to have first originated, it was not yet known that is necessarily a (rond) sphere. otivated by this qestion, one might make the following observation:, mch like a sphere, has connected shadows. This is based on a variation argment, described below, which the athor first learned from Henry Wente [18]. For all 2 S 2, the shadow fnction f :! R, f (p) := hn(p);i, is a Jacobi field on, i.e., for the pertrbation p 7! p + tf (p)n(p); the first variation of volme and the first and second variation of area are all zero; becase, the variations corresponds to a rigid motion of in the direction. Consider the nodal regions of f on. These are the sets where f is either positive or negative, and correspond, therefore, to the shadows S and S, respectively. Sppose, towards a contradiction, that S is not connected, then there are at least three nodal regions A i, i = 1; 2; 3. Conseqently, one can form three fnctions f i by setting f i := f on A i and f i := 0 elsewhere. One can then take a sitable linear combination P 3 i=1 if i, to obtain a fnction for which the first variation of volme is zero bt the second variation of area is negative, contradicting the stability assmption. Hence, we conclde that all shadows of are connected. Sppose now that is simply connected, then, see Note 1.2, the connectedness of the shadows of imply that each shadow is simply connected. Hence, by Theorem 1.1, it follows that is convex. In particlar, is embedded. Conseqently, by applying the maximm principle together with the reflection techniqe introdced by Aleksandrov [1], it follows that is a sphere. The above reslt is well-known, and may be regarded as a weak version of a theorem of Hopf [9, p. 138], or a theorem of Barbosa and do Carmo [2]. Hopf showed, withot assming stability, that any closed CC srface of gens zero mst be a sphere, and Barbosa and do Carmo proved that a closed oriented srface of higher gens mst also be a sphere provided it is stable (for an elementary proof of this reslt, see [19]). Finally, Wente showed that the stability assmption in higher gens is not sperflos [20] by constrcting a CC tors in R 3 ; ths, settling a famos and long standing qestion of Hopf [9, Pg. 131]. In closing this section, we shold also point ot that a nmber of reslts concerning the connection between the nmber of components of nodal regions of the shadow fnction (the vision nmber) and the stability index of complete minimal srfaces in R 3 have been obtained by Jaigyong Choe [3] Convexity of the level sets of H-graphs. Recently, shadows on illminated srfaces have been stdied within the context of another problem involving constant mean crvatre. This problem, nlike those mentioned in the previos sbsection, is still open. Let Ω ρ R 2 be a convex domain, and f 2 C 2 (Ω) C 0 (Ω) be a soltion to the following bondary vale problem: grad f Div( p ) = 2H on Ω; and f = k grad fk 2

10 10 OHAAD GHOI Let denote the graph of f. Then has constant mean crvatre H. Intitively, one may think of as the membrane of least area, spanned which traps a given volme above the xy-plane. It has been a well-known and long standing problem [13] to show that the level sets of, and those given by eqations of similar type, are convex. Recently, John ccan [15] has obtained a nmber of reslts on this problem. In particlar, he has shown that for every nit vector ( ) := (cos ; sin ; 0), the set X ( ) := fx 2 Ω j hgrad f(x);( )i = 0g is a connected reglar crve, assming has strictly positive crvatre. This implies that the shadow S ( ) is a simply connected sbset of, becase X ( ) is the projection ( ) into the xy-plane. One is then led to consider the following qestion [16]: does the simply-connectedness of the shadows S ( ) imply that the level sets of are convex? The answer is negative, see Figre 9. At present it is not clear what Figre 9. A graph with zero bondary vales over a convex domain which has nonconvex level sets, even thogh the shadows S ( ) are simply connected. S ( ) is simply connected becase the graph has a niqe critical point. shadow property, if any, wold characterize the convexity of level sets. Acknowledgments The athor is indebted to Ralph Howard for a good deal of help and advice throghot this project. Frther, the athor wishes to thank John ccan for bringing the shadow problem to the athor's attention, Henry Wente for his informative comments and encoragement, and Brce Solomon for his interest in aspects of this work. References [1] A. D. Aleksandrov,Uniqeness theorems for srfaces in the large. I, Amer. ath. Soc. Transl, (2) 21 (1962), [2] J. L. Barbosa &. do Carmo, Stability of hypersrfaces with constant mean crvatre, ath. Z. 185 (1984), no. 3, [3] J. Choe, Index, vision nmber and stability of complete minimal srfaces, Arch. Rational ech. Anal. 109 (1990), no. 3, [4] T. Cecil, & S. S. Chern, Tight and tat sbmanifolds, Cambridge University Press, Cambridge, 1997.

11 SOLUTION TO THE SHADOW PROBLE IN 3-SPACE 11 [5] S. S. Chern, & R. K. Lashof, On the total crvatre of immersed manifolds, Amer. J. ath. 79 (1957), ; On the total crvatre of immersed manifolds. II, ichigan ath. J. 5 (1958), [6]. Ghomi, Shadows and convexity of srfaces, preprint available at [7]. Ghomi, and B. Solomon, Skew loops and qadric srfaces, preprint available at [8]. Gromov, Partial differential relations, Ergebnisse der athematik nd ihrer Grenzgebiete (3) [Reslts in athematics and Related Areas (3)], 9. Springer-Verlag, Berlin-New York, [9] H. Hopf, Differential geometry in the large, Springer-Verlag, Berlin-New York, [10] R. Howard, ohammad Ghomi's Soltion to the Shadow Problem, Lectre Notes, available at [11] The Geometry of Shadow Bondaries on Srfaces in Space, Lectre Notes, available at [12] Characterization of Tantrix Crves, Lectre Notes, available at [13] B. Kawohl, Rearrangements and convexity of level sets in PDE, Springer-Verlag, Berlin-New York, [14] J. ilnor, orse theory, Princeton University Press, Princeton, N.J.,1963. [15] J. ccan, Contina of H-graphs: convexity and isoperimetric stability, Calc. Var. Partial Differential Eqations 9 (1999), no. 4, [16] Personal , Jne 23, [17] B. Solomon, Tantrices of spherical crves, Amer. ath. onthly 103 (1996), no. 1, [18] H. C. Wente, Personal , Janary 9, [19] A note on the stability theorem of J. L. Barbosa and. Do Carmo for closed srfaces of constant mean crvatre, Pacific J. ath. 147 (1991), no. 2, [20] Conterexample to a conjectre of H. Hopf, Pacific J. ath. 121 (1986), no. 1, [21] J. Weiner, Flat tori in S 3 and their Gass maps, Proc. London ath. Soc. (3) 62 (1991), no. 1, Department of athematics, University of Soth Carolina, Colmbia, SC address: ghomi@math.sc.ed URL:

Introduction to Computational Manifolds and Applications

Introduction to Computational Manifolds and Applications IMPA - Institto de Matemática Pra e Aplicada, Rio de Janeiro, RJ, Brazil Introdction to Comptational Manifolds and Applications Part 1 - Constrctions Prof. Marcelo Ferreira Siqeira mfsiqeira@dimap.frn.br

More information

Triangle-Free Planar Graphs as Segments Intersection Graphs

Triangle-Free Planar Graphs as Segments Intersection Graphs Triangle-ree Planar Graphs as Segments Intersection Graphs N. de Castro 1,.J.Cobos 1, J.C. Dana 1,A.Márqez 1, and M. Noy 2 1 Departamento de Matemática Aplicada I Universidad de Sevilla, Spain {natalia,cobos,dana,almar}@cica.es

More information

FINITE ELEMENT APPROXIMATION OF CONVECTION DIFFUSION PROBLEMS USING GRADED MESHES

FINITE ELEMENT APPROXIMATION OF CONVECTION DIFFUSION PROBLEMS USING GRADED MESHES FINITE ELEMENT APPROXIMATION OF CONVECTION DIFFUSION PROBLEMS USING GRADED MESHES RICARDO G. DURÁN AND ARIEL L. LOMBARDI Abstract. We consider the nmerical approximation of a model convection-diffsion

More information

arxiv: v1 [cs.cg] 27 Nov 2015

arxiv: v1 [cs.cg] 27 Nov 2015 On Visibility Representations of Non-planar Graphs Therese Biedl 1, Giseppe Liotta 2, Fabrizio Montecchiani 2 David R. Cheriton School of Compter Science, University of Waterloo, Canada biedl@waterloo.ca

More information

COMPOSITION OF STABLE SET POLYHEDRA

COMPOSITION OF STABLE SET POLYHEDRA COMPOSITION OF STABLE SET POLYHEDRA Benjamin McClosky and Illya V. Hicks Department of Comptational and Applied Mathematics Rice University November 30, 2007 Abstract Barahona and Mahjob fond a defining

More information

On the Computational Complexity and Effectiveness of N-hub Shortest-Path Routing

On the Computational Complexity and Effectiveness of N-hub Shortest-Path Routing 1 On the Comptational Complexity and Effectiveness of N-hb Shortest-Path Roting Reven Cohen Gabi Nakibli Dept. of Compter Sciences Technion Israel Abstract In this paper we stdy the comptational complexity

More information

Evaluating Influence Diagrams

Evaluating Influence Diagrams Evalating Inflence Diagrams Where we ve been and where we re going Mark Crowley Department of Compter Science University of British Colmbia crowley@cs.bc.ca Agst 31, 2004 Abstract In this paper we will

More information

h-vectors of PS ear-decomposable graphs

h-vectors of PS ear-decomposable graphs h-vectors of PS ear-decomposable graphs Nima Imani 2, Lee Johnson 1, Mckenzie Keeling-Garcia 1, Steven Klee 1 and Casey Pinckney 1 1 Seattle University Department of Mathematics, 901 12th Avene, Seattle,

More information

A sufficient condition for spiral cone beam long object imaging via backprojection

A sufficient condition for spiral cone beam long object imaging via backprojection A sfficient condition for spiral cone beam long object imaging via backprojection K. C. Tam Siemens Corporate Research, Inc., Princeton, NJ, USA Abstract The response of a point object in cone beam spiral

More information

arxiv: v3 [math.co] 7 Sep 2018

arxiv: v3 [math.co] 7 Sep 2018 Cts in matchings of 3-connected cbic graphs Kolja Knaer Petr Valicov arxiv:1712.06143v3 [math.co] 7 Sep 2018 September 10, 2018 Abstract We discss conjectres on Hamiltonicity in cbic graphs (Tait, Barnette,

More information

CS 4204 Computer Graphics

CS 4204 Computer Graphics CS 424 Compter Graphics Crves and Srfaces Yong Cao Virginia Tech Reference: Ed Angle, Interactive Compter Graphics, University of New Mexico, class notes Crve and Srface Modeling Objectives Introdce types

More information

Topological Drawings of Complete Bipartite Graphs

Topological Drawings of Complete Bipartite Graphs Topological Drawings of Complete Bipartite Graphs Jean Cardinal Stefan Felsner y Febrary 017 Abstract Topological drawings are natral representations of graphs in the plane, where vertices are represented

More information

REPLICATION IN BANDWIDTH-SYMMETRIC BITTORRENT NETWORKS. M. Meulpolder, D.H.J. Epema, H.J. Sips

REPLICATION IN BANDWIDTH-SYMMETRIC BITTORRENT NETWORKS. M. Meulpolder, D.H.J. Epema, H.J. Sips REPLICATION IN BANDWIDTH-SYMMETRIC BITTORRENT NETWORKS M. Melpolder, D.H.J. Epema, H.J. Sips Parallel and Distribted Systems Grop Department of Compter Science, Delft University of Technology, the Netherlands

More information

Blended Deformable Models

Blended Deformable Models Blended Deformable Models (In IEEE Trans. Pattern Analysis and Machine Intelligence, April 996, 8:4, pp. 443-448) Doglas DeCarlo and Dimitri Metaxas Department of Compter & Information Science University

More information

Constrained Routing Between Non-Visible Vertices

Constrained Routing Between Non-Visible Vertices Constrained Roting Between Non-Visible Vertices Prosenjit Bose 1, Matias Korman 2, André van Renssen 3,4, and Sander Verdonschot 1 1 School of Compter Science, Carleton University, Ottawa, Canada. jit@scs.carleton.ca,

More information

Picking and Curves Week 6

Picking and Curves Week 6 CS 48/68 INTERACTIVE COMPUTER GRAPHICS Picking and Crves Week 6 David Breen Department of Compter Science Drexel University Based on material from Ed Angel, University of New Mexico Objectives Picking

More information

Alliances and Bisection Width for Planar Graphs

Alliances and Bisection Width for Planar Graphs Alliances and Bisection Width for Planar Graphs Martin Olsen 1 and Morten Revsbæk 1 AU Herning Aarhs University, Denmark. martino@hih.a.dk MADAGO, Department of Compter Science Aarhs University, Denmark.

More information

Minimal Edge Addition for Network Controllability

Minimal Edge Addition for Network Controllability This article has been accepted for pblication in a ftre isse of this jornal, bt has not been flly edited. Content may change prior to final pblication. Citation information: DOI 10.1109/TCNS.2018.2814841,

More information

The Intersection of Two Ringed Surfaces and Some Related Problems

The Intersection of Two Ringed Surfaces and Some Related Problems Graphical Models 63, 8 44 001) doi:10.1006/gmod.001.0553, available online at http://www.idealibrary.com on The Intersection of Two Ringed Srfaces and Some Related Problems Hee-Seok Heo and Sng Je Hong

More information

Augmenting the edge connectivity of planar straight line graphs to three

Augmenting the edge connectivity of planar straight line graphs to three Agmenting the edge connectivity of planar straight line graphs to three Marwan Al-Jbeh Mashhood Ishaqe Kristóf Rédei Diane L. Sovaine Csaba D. Tóth Pavel Valtr Abstract We characterize the planar straight

More information

An Adaptive Strategy for Maximizing Throughput in MAC layer Wireless Multicast

An Adaptive Strategy for Maximizing Throughput in MAC layer Wireless Multicast University of Pennsylvania ScholarlyCommons Departmental Papers (ESE) Department of Electrical & Systems Engineering May 24 An Adaptive Strategy for Maximizing Throghpt in MAC layer Wireless Mlticast Prasanna

More information

EECS 487: Interactive Computer Graphics f

EECS 487: Interactive Computer Graphics f Interpolating Key Vales EECS 487: Interactive Compter Graphics f Keys Lectre 33: Keyframe interpolation and splines Cbic splines The key vales of each variable may occr at different frames The interpolation

More information

Tutte Embeddings of Planar Graphs

Tutte Embeddings of Planar Graphs Spectral Graph Theory and its Applications Lectre 21 Ttte Embeddings o Planar Graphs Lectrer: Daniel A. Spielman November 30, 2004 21.1 Ttte s Theorem We sally think o graphs as being speciied by vertices

More information

Nash Convergence of Gradient Dynamics in General-Sum Games. Michael Kearns.

Nash Convergence of Gradient Dynamics in General-Sum Games. Michael Kearns. Convergence of Gradient Dynamics in General-Sm Games Satinder Singh AT&T Labs Florham Park, NJ 7932 bavejaresearch.att.com Michael Kearns AT&T Labs Florham Park, NJ 7932 mkearnsresearch.att.com Yishay

More information

Computer-Aided Mechanical Design Using Configuration Spaces

Computer-Aided Mechanical Design Using Configuration Spaces Compter-Aided Mechanical Design Using Configration Spaces Leo Joskowicz Institte of Compter Science The Hebrew University Jersalem 91904, Israel E-mail: josko@cs.hji.ac.il Elisha Sacks (corresponding athor)

More information

Fault Tolerance in Hypercubes

Fault Tolerance in Hypercubes Falt Tolerance in Hypercbes Shobana Balakrishnan, Füsn Özgüner, and Baback A. Izadi Department of Electrical Engineering, The Ohio State University, Colmbs, OH 40, USA Abstract: This paper describes different

More information

The Domination and Competition Graphs of a Tournament. University of Colorado at Denver, Denver, CO K. Brooks Reid 3

The Domination and Competition Graphs of a Tournament. University of Colorado at Denver, Denver, CO K. Brooks Reid 3 The omination and Competition Graphs of a Tornament avid C. Fisher, J. Richard Lndgren 1, Sarah K. Merz University of Colorado at enver, enver, CO 817 K. rooks Reid California State University, San Marcos,

More information

Last lecture: finishing up Chapter 22

Last lecture: finishing up Chapter 22 Last lectre: finishing p Chapter 22 Hygens principle consider each point on a wavefront to be sorce of secondary spherical wavelets that propagate at the speed of the wave at a later time t, new wavefront

More information

Towards Tight Bounds on Theta-Graphs

Towards Tight Bounds on Theta-Graphs Toards Tight Bonds on Theta-Graphs arxiv:10.633v1 [cs.cg] Apr 01 Prosenjit Bose Jean-Lo De Carfel Pat Morin André van Renssen Sander Verdonschot Abstract We present improved pper and loer bonds on the

More information

A GENERIC MODEL OF A BASE-ISOLATED BUILDING

A GENERIC MODEL OF A BASE-ISOLATED BUILDING Chapter 5 A GENERIC MODEL OF A BASE-ISOLATED BUILDING This chapter draws together the work o Chapters 3 and 4 and describes the assembly o a generic model o a base-isolated bilding. The irst section describes

More information

Maximum Weight Independent Sets in an Infinite Plane

Maximum Weight Independent Sets in an Infinite Plane Maximm Weight Independent Sets in an Infinite Plane Jarno Nosiainen, Jorma Virtamo, Pasi Lassila jarno.nosiainen@tkk.fi, jorma.virtamo@tkk.fi, pasi.lassila@tkk.fi Department of Commnications and Networking

More information

arxiv: v1 [cs.cg] 26 Sep 2018

arxiv: v1 [cs.cg] 26 Sep 2018 Convex partial transversals of planar regions arxiv:1809.10078v1 [cs.cg] 26 Sep 2018 Vahideh Keikha Department of Mathematics and Compter Science, University of Sistan and Balchestan, Zahedan, Iran va.keikha@gmail.com

More information

Statistical Methods in functional MRI. Standard Analysis. Data Processing Pipeline. Multiple Comparisons Problem. Multiple Comparisons Problem

Statistical Methods in functional MRI. Standard Analysis. Data Processing Pipeline. Multiple Comparisons Problem. Multiple Comparisons Problem Statistical Methods in fnctional MRI Lectre 7: Mltiple Comparisons 04/3/13 Martin Lindqist Department of Biostatistics Johns Hopkins University Data Processing Pipeline Standard Analysis Data Acqisition

More information

Today. B-splines. B-splines. B-splines. Computergrafik. Curves NURBS Surfaces. Bilinear patch Bicubic Bézier patch Advanced surface modeling

Today. B-splines. B-splines. B-splines. Computergrafik. Curves NURBS Surfaces. Bilinear patch Bicubic Bézier patch Advanced surface modeling Comptergrafik Matthias Zwicker Uniersität Bern Herbst 29 Cres Srfaces Parametric srfaces Bicbic Bézier patch Adanced srface modeling Piecewise Bézier cres Each segment spans for control points Each segment

More information

On total regularity of the join of two interval valued fuzzy graphs

On total regularity of the join of two interval valued fuzzy graphs International Jornal of Scientific and Research Pblications, Volme 6, Isse 12, December 2016 45 On total reglarity of the join of two interval valed fzzy graphs Soriar Sebastian 1 and Ann Mary Philip 2

More information

arxiv: v1 [cs.cg] 1 Feb 2016

arxiv: v1 [cs.cg] 1 Feb 2016 The Price of Order Prosenjit Bose Pat Morin André van Renssen, arxiv:160.00399v1 [cs.cg] 1 Feb 016 Abstract We present tight bonds on the spanning ratio of a large family of ordered θ-graphs. A θ-graph

More information

On Plane Constrained Bounded-Degree Spanners

On Plane Constrained Bounded-Degree Spanners Algorithmica manscript No. (ill be inserted by the editor) 1 On Plane Constrained Bonded-Degree Spanners 2 3 Prosenjit Bose Rolf Fagerberg André an Renssen Sander Verdonschot 4 5 Receied: date / Accepted:

More information

Real-time mean-shift based tracker for thermal vision systems

Real-time mean-shift based tracker for thermal vision systems 9 th International Conference on Qantitative InfraRed Thermography Jly -5, 008, Krakow - Poland Real-time mean-shift based tracker for thermal vision systems G. Bieszczad* T. Sosnowski** * Military University

More information

Summer 2017 MATH Suggested Solution to Exercise Find the tangent hyperplane passing the given point P on each of the graphs: (a)

Summer 2017 MATH Suggested Solution to Exercise Find the tangent hyperplane passing the given point P on each of the graphs: (a) Smmer 2017 MATH2010 1 Sggested Soltion to Exercise 6 1 Find the tangent hyperplane passing the given point P on each of the graphs: (a) z = x 2 y 2 ; y = z log x z P (2, 3, 5), P (1, 1, 1), (c) w = sin(x

More information

Bias of Higher Order Predictive Interpolation for Sub-pixel Registration

Bias of Higher Order Predictive Interpolation for Sub-pixel Registration Bias of Higher Order Predictive Interpolation for Sb-pixel Registration Donald G Bailey Institte of Information Sciences and Technology Massey University Palmerston North, New Zealand D.G.Bailey@massey.ac.nz

More information

Tu P7 15 First-arrival Traveltime Tomography with Modified Total Variation Regularization

Tu P7 15 First-arrival Traveltime Tomography with Modified Total Variation Regularization T P7 15 First-arrival Traveltime Tomography with Modified Total Variation Reglarization W. Jiang* (University of Science and Technology of China) & J. Zhang (University of Science and Technology of China)

More information

Representing a Cubic Graph as the Intersection Graph of Axis-parallel Boxes in Three Dimensions

Representing a Cubic Graph as the Intersection Graph of Axis-parallel Boxes in Three Dimensions Representing a Cbic Graph as the Intersection Graph of Axis-parallel Boxes in Three Dimensions ABSTRACT Abhijin Adiga Network Dynamics and Simlation Science Laboratory Virginia Bioinformatics Institte,

More information

EUCLIDEAN SKELETONS USING CLOSEST POINTS. Songting Luo. Leonidas J. Guibas. Hong-Kai Zhao. (Communicated by the associate editor name)

EUCLIDEAN SKELETONS USING CLOSEST POINTS. Songting Luo. Leonidas J. Guibas. Hong-Kai Zhao. (Communicated by the associate editor name) Volme X, No. 0X, 200X, X XX Web site: http://www.aimsciences.org EUCLIDEAN SKELETONS USING CLOSEST POINTS Songting Lo Department of Mathematics, University of California, Irvine Irvine, CA 92697-3875,

More information

Lecture 10. Diffraction. incident

Lecture 10. Diffraction. incident 1 Introdction Lectre 1 Diffraction It is qite often the case that no line-of-sight path exists between a cell phone and a basestation. In other words there are no basestations that the cstomer can see

More information

Application of Gaussian Curvature Method in Development of Hull Plate Surface

Application of Gaussian Curvature Method in Development of Hull Plate Surface Marine Engineering Frontiers (MEF) Volme 2, 204 Application of Gassian Crvatre Method in Development of Hll Plate Srface Xili Zh, Yjn Li 2 Dept. of Infor., Dalian Univ., Dalian 6622, China 2 Dept. of Naval

More information

METAMODEL FOR SOFTWARE SOLUTIONS IN COMPUTED TOMOGRAPHY

METAMODEL FOR SOFTWARE SOLUTIONS IN COMPUTED TOMOGRAPHY VOL. 10, NO 22, DECEBER, 2015 ISSN 1819-6608 ETAODEL FOR SOFTWARE SOLUTIONS IN COPUTED TOOGRAPHY Vitaliy ezhyev Faclty of Compter Systems and Software Engineering, Universiti alaysia Pahang, Gambang, alaysia

More information

Maximal Cliques in Unit Disk Graphs: Polynomial Approximation

Maximal Cliques in Unit Disk Graphs: Polynomial Approximation Maximal Cliqes in Unit Disk Graphs: Polynomial Approximation Rajarshi Gpta, Jean Walrand, Oliier Goldschmidt 2 Department of Electrical Engineering and Compter Science Uniersity of California, Berkeley,

More information

p-norm MINIMIZATION OVER INTERSECTIONS OF CONVEX SETS İlker Bayram

p-norm MINIMIZATION OVER INTERSECTIONS OF CONVEX SETS İlker Bayram p-norm MINIMIZATION OVER INTERSECTIONS OF CONVEX SETS İlker Bayram Istanbl Technical University, Department of Electronics and Telecommnications Engineering, Istanbl, Trkey ABSTRACT We consider the imization

More information

Pavlin and Daniel D. Corkill. Department of Computer and Information Science University of Massachusetts Amherst, Massachusetts 01003

Pavlin and Daniel D. Corkill. Department of Computer and Information Science University of Massachusetts Amherst, Massachusetts 01003 From: AAAI-84 Proceedings. Copyright 1984, AAAI (www.aaai.org). All rights reserved. SELECTIVE ABSTRACTION OF AI SYSTEM ACTIVITY Jasmina Pavlin and Daniel D. Corkill Department of Compter and Information

More information

StaCo: Stackelberg-based Coverage Approach in Robotic Swarms

StaCo: Stackelberg-based Coverage Approach in Robotic Swarms Maastricht University Department of Knowledge Engineering Technical Report No.:... : Stackelberg-based Coverage Approach in Robotic Swarms Kateřina Staňková, Bijan Ranjbar-Sahraei, Gerhard Weiss, Karl

More information

Reconstructing Generalized Staircase Polygons with Uniform Step Length

Reconstructing Generalized Staircase Polygons with Uniform Step Length Jornal of Graph Algorithms and Applications http://jgaa.info/ ol. 22, no. 3, pp. 431 459 (2018) DOI: 10.7155/jgaa.00466 Reconstrcting Generalized Staircase Polygons with Uniform Step Length Nodari Sitchinaa

More information

On Plane Constrained Bounded-Degree Spanners

On Plane Constrained Bounded-Degree Spanners On Plane Constrained Bonded-Degree Spanners Prosenjit Bose 1, Rolf Fagerberg 2, André an Renssen 1, Sander Verdonschot 1 1 School of Compter Science, Carleton Uniersity, Ottaa, Canada. Email: jit@scs.carleton.ca,

More information

Image Denoising Algorithms

Image Denoising Algorithms Image Denoising Algorithms Xiang Hao School of Compting, University of Utah, USA, hao@cs.tah.ed Abstract. This is a report of an assignment of the class Mathematics of Imaging. In this assignment, we first

More information

Fast Ray Tetrahedron Intersection using Plücker Coordinates

Fast Ray Tetrahedron Intersection using Plücker Coordinates Fast Ray Tetrahedron Intersection sing Plücker Coordinates Nikos Platis and Theoharis Theoharis Department of Informatics & Telecommnications University of Athens Panepistemiopolis, GR 157 84 Ilissia,

More information

A choice relation framework for supporting category-partition test case generation

A choice relation framework for supporting category-partition test case generation Title A choice relation framework for spporting category-partition test case generation Athor(s) Chen, TY; Poon, PL; Tse, TH Citation Ieee Transactions On Software Engineering, 2003, v. 29 n. 7, p. 577-593

More information

Chapter 7 TOPOLOGY CONTROL

Chapter 7 TOPOLOGY CONTROL Chapter TOPOLOGY CONTROL Oeriew Topology Control Gabriel Graph et al. XTC Interference SINR & Schedling Complexity Distribted Compting Grop Mobile Compting Winter 00 / 00 Distribted Compting Grop MOBILE

More information

Optimal Sampling in Compressed Sensing

Optimal Sampling in Compressed Sensing Optimal Sampling in Compressed Sensing Joyita Dtta Introdction Compressed sensing allows s to recover objects reasonably well from highly ndersampled data, in spite of violating the Nyqist criterion. In

More information

CLASSIFICATION OF SURFACES

CLASSIFICATION OF SURFACES CLASSIFICATION OF SURFACES JUSTIN HUANG Abstract. We will classify compact, connected surfaces into three classes: the sphere, the connected sum of tori, and the connected sum of projective planes. Contents

More information

Curves and Surfaces. CS 537 Interactive Computer Graphics Prof. David E. Breen Department of Computer Science

Curves and Surfaces. CS 537 Interactive Computer Graphics Prof. David E. Breen Department of Computer Science Crves and Srfaces CS 57 Interactive Compter Graphics Prof. David E. Breen Department of Compter Science E. Angel and D. Shreiner: Interactive Compter Graphics 6E Addison-Wesley 22 Objectives Introdce types

More information

ABSOLUTE DEFORMATION PROFILE MEASUREMENT IN TUNNELS USING RELATIVE CONVERGENCE MEASUREMENTS

ABSOLUTE DEFORMATION PROFILE MEASUREMENT IN TUNNELS USING RELATIVE CONVERGENCE MEASUREMENTS Proceedings th FIG Symposim on Deformation Measrements Santorini Greece 00. ABSOUTE DEFORMATION PROFIE MEASUREMENT IN TUNNES USING REATIVE CONVERGENCE MEASUREMENTS Mahdi Moosai and Saeid Khazaei Mining

More information

Don t just read it; fight it! Ask your own questions, look for your own examples, discover your own proofs. Is the hypothesis necessary?

Don t just read it; fight it! Ask your own questions, look for your own examples, discover your own proofs. Is the hypothesis necessary? Don t just read it; fight it! Ask your own questions, look for your own examples, discover your own proofs. Is the hypothesis necessary? Is the converse true? What happens in the classical special case?

More information

Discretized Approximations for POMDP with Average Cost

Discretized Approximations for POMDP with Average Cost Discretized Approximations for POMDP with Average Cost Hizhen Y Lab for Information and Decisions EECS Dept., MIT Cambridge, MA 0239 Dimitri P. Bertsekas Lab for Information and Decisions EECS Dept., MIT

More information

PARAMETER OPTIMIZATION FOR TAKAGI-SUGENO FUZZY MODELS LESSONS LEARNT

PARAMETER OPTIMIZATION FOR TAKAGI-SUGENO FUZZY MODELS LESSONS LEARNT PAAMETE OPTIMIZATION FO TAKAGI-SUGENO FUZZY MODELS LESSONS LEANT Manfred Männle Inst. for Compter Design and Falt Tolerance Univ. of Karlsrhe, 768 Karlsrhe, Germany maennle@compter.org Brokat Technologies

More information

Mathematica(l) Roller Coasters

Mathematica(l) Roller Coasters Mathematica(l) Roller Coasters Selwyn Hollis Department of Mathematics Armstrong Atlantic State University Savannah, GA 31419 shollis@armstrong.ed à Introdction Mathematica animations that simlate roller

More information

Curve Modeling (Spline) Dr. S.M. Malaek. Assistant: M. Younesi

Curve Modeling (Spline) Dr. S.M. Malaek. Assistant: M. Younesi Crve Modeling Sline Dr. S.M. Malae Assistant: M. Yonesi Crve Modeling Sline Crve Control Points Convex Hll Shae of sline crve Interolation Slines Aroximation Slines Continity Conditions Parametric & Geometric

More information

Cohesive Subgraph Mining on Attributed Graph

Cohesive Subgraph Mining on Attributed Graph Cohesive Sbgraph Mining on Attribted Graph Fan Zhang, Ying Zhang, L Qin, Wenjie Zhang, Xemin Lin QCIS, University of Technology, Sydney, University of New Soth Wales fanzhang.cs@gmail.com, {Ying.Zhang,

More information

On shortest-path all-optical networks without wavelength conversion requirements

On shortest-path all-optical networks without wavelength conversion requirements Research Collection Working Paper On shortest-path all-optical networks withot waelength conersion reqirements Athor(s): Erlebach, Thomas; Stefanakos, Stamatis Pblication Date: 2002 Permanent Link: https://doi.org/10.3929/ethz-a-004446054

More information

Data/Metadata Data and Data Transformations

Data/Metadata Data and Data Transformations A Framework for Classifying Scientic Metadata Helena Galhardas, Eric Simon and Anthony Tomasic INRIA Domaine de Volcea - Rocqencort 7853 Le Chesnay France email: First-Name.Last-Name@inria.fr Abstract

More information

Continuity Smooth Path Planning Using Cubic Polynomial Interpolation with Membership Function

Continuity Smooth Path Planning Using Cubic Polynomial Interpolation with Membership Function J Electr Eng Technol Vol., No.?: 74-?, 5 http://dx.doi.org/.537/jeet.5..?.74 ISSN(Print) 975- ISSN(Online) 93-743 Continity Smooth Path Planning Using Cbic Polomial Interpolation with Membership Fnction

More information

Appearance Based Tracking with Background Subtraction

Appearance Based Tracking with Background Subtraction The 8th International Conference on Compter Science & Edcation (ICCSE 213) April 26-28, 213. Colombo, Sri Lanka SD1.4 Appearance Based Tracking with Backgrond Sbtraction Dileepa Joseph Jayamanne Electronic

More information

Stereopsis Raul Queiroz Feitosa

Stereopsis Raul Queiroz Feitosa Stereopsis Ral Qeiroz Feitosa 5/24/2017 Stereopsis 1 Objetie This chapter introdces the basic techniqes for a 3 dimensional scene reconstrction based on a set of projections of indiidal points on two calibrated

More information

DIRECT AND PROGRESSIVE RECONSTRUCTION OF DUAL PHOTOGRAPHY IMAGES

DIRECT AND PROGRESSIVE RECONSTRUCTION OF DUAL PHOTOGRAPHY IMAGES DIRECT AND PROGRESSIVE RECONSTRUCTION OF DUAL PHOTOGRAPHY IMAGES Binh-Son Ha 1 Imari Sato 2 Kok-Lim Low 1 1 National University of Singapore 2 National Institte of Informatics, Tokyo, Japan ABSTRACT Dal

More information

TOWARD AN UNCERTAINTY PRINCIPLE FOR WEIGHTED GRAPHS

TOWARD AN UNCERTAINTY PRINCIPLE FOR WEIGHTED GRAPHS TOWARD AN UNCERTAINTY PRINCIPLE FOR WEIGHTED GRAPHS Bastien Pasdelop, Réda Alami, Vincent Gripon Telecom Bretagne UMR CNRS Lab-STICC name.srname@telecom-bretagne.e Michael Rabbat McGill University ECE

More information

751 Problem Set I JWR. Due Sep 28, 2004

751 Problem Set I JWR. Due Sep 28, 2004 751 Problem Set I JWR Due Sep 28, 2004 Exercise 1. For any space X define an equivalence relation by x y iff here is a path γ : I X with γ(0) = x and γ(1) = y. The equivalence classes are called the path

More information

Page # CISC360. Integers Sep 11, Encoding Integers Unsigned. Encoding Example (Cont.) Topics. Twoʼs Complement. Sign Bit

Page # CISC360. Integers Sep 11, Encoding Integers Unsigned. Encoding Example (Cont.) Topics. Twoʼs Complement. Sign Bit Topics CISC3 Integers Sep 11, 28 Nmeric Encodings Unsigned & Twoʼs complement Programming Implications C promotion rles Basic operations Addition, negation, mltiplication Programming Implications Conseqences

More information

Pushing squares around

Pushing squares around Pshing sqares arond Adrian Dmitresc János Pach Ý Abstract We stdy dynamic self-reconfigration of modlar metamorphic systems. We garantee the feasibility of motion planning in a rectanglar model consisting

More information

On the complexity of Submap Isomorphism

On the complexity of Submap Isomorphism On the compleit of Sbmap Isomorphism Christine Solnon 1,2, Gillame Damiand 1,2, Colin de la Higera 3, and Jean-Christophe Janodet 4 1 INSA de Lon, LIRIS, UMR 5205 CNRS, 69621 Villerbanne, France 2 Université

More information

Simplicial Trees are Sequentially Cohen-Macaulay

Simplicial Trees are Sequentially Cohen-Macaulay Simplicial Trees are Seqentiall Cohen-Macala Sara Faridi Agst 27, 2003 Abstract This paper ses dalities between facet ideal theor and Stanle-Reisner theor to show that the facet ideal of a simplicial tree

More information

Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods

Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods Annals of Operations Research 106, 19 46, 2001 2002 Klwer Academic Pblishers. Manfactred in The Netherlands. Discrete Cost Mlticommodity Network Optimization Problems and Exact Soltion Methods MICHEL MINOUX

More information

POWER-OF-2 BOUNDARIES

POWER-OF-2 BOUNDARIES Warren.3.fm Page 5 Monday, Jne 17, 5:6 PM CHAPTER 3 POWER-OF- BOUNDARIES 3 1 Ronding Up/Down to a Mltiple of a Known Power of Ronding an nsigned integer down to, for eample, the net smaller mltiple of

More information

Chapter 15 Vector Calculus

Chapter 15 Vector Calculus Chapter 15 Vector Calculus 151 Vector Fields 152 Line Integrals 153 Fundamental Theorem and Independence of Path 153 Conservative Fields and Potential Functions 154 Green s Theorem 155 urface Integrals

More information

arxiv: v2 [cs.cg] 5 Aug 2014

arxiv: v2 [cs.cg] 5 Aug 2014 The θ 5 -graph is a spanner Prosenjit Bose Pat Morin André van Renssen Sander Verdonschot November 5, 2018 arxiv:12120570v2 [cscg] 5 Ag 2014 Abstract Given a set of points in the plane, e sho that the

More information

Triple Connected Complementary Tree Domination Number of a Graph

Triple Connected Complementary Tree Domination Number of a Graph International Mathematical Form, Vol. 8, 2013, no. 14, 659-670 HIKARI Ltd, www.m-hikari.com Triple Connected Complementar Tree Domination Nmber of a Graph G. Mahadevan 1, Selvam Avadaappan 2, N. Ramesh

More information

Networks An introduction to microcomputer networking concepts

Networks An introduction to microcomputer networking concepts Behavior Research Methods& Instrmentation 1978, Vol 10 (4),522-526 Networks An introdction to microcompter networking concepts RALPH WALLACE and RICHARD N. JOHNSON GA TX, Chicago, Illinois60648 and JAMES

More information

5.0 Curve and Surface Theory

5.0 Curve and Surface Theory 5. Cre and Srface Theor 5.1 arametric Representation of Cres Consider the parametric representation of a cre as a ector t: t [t t t] 5.1 The deriatie of sch a ector ealated at t t is gien b t [ t t t ]

More information

On Bichromatic Triangle Game

On Bichromatic Triangle Game On Bichromatic Triangle Game Gordana Manić Daniel M. Martin Miloš Stojakoić Agst 16, 2012 Abstract We stdy a combinatorial game called Bichromatic Triangle Game, defined as follows. Two players R and B

More information

OPTI-502 Optical Design and Instrumentation I John E. Greivenkamp Homework Set 9 Fall, 2018

OPTI-502 Optical Design and Instrumentation I John E. Greivenkamp Homework Set 9 Fall, 2018 OPTI-502 Optical Design and Instrmentation I John E. Greivenkamp Assigned: 10/31/18 Lectre 21 De: 11/7/18 Lectre 23 Note that in man 502 homework and exam problems (as in the real world!!), onl the magnitde

More information

STABILITY OF SIMULTANEOUS RECURRENT NEURAL NETWORK DYNAMICS FOR STATIC OPTIMIZATION

STABILITY OF SIMULTANEOUS RECURRENT NEURAL NETWORK DYNAMICS FOR STATIC OPTIMIZATION STABILITY OF SIMULTANEOUS RECURRENT NEURAL NETWOR DYNAMICS FOR STATIC OPTIMIZATION Grsel Serpen and Yifeng X Electrical Engineering and Compter Science Department, The University of Toledo, Toledo, OH

More information

Finite Domain Cuts for Minimum Bandwidth

Finite Domain Cuts for Minimum Bandwidth Finite Domain Cts for Minimm Bandwidth J. N. Hooker Carnegie Mellon University, USA Joint work with Alexandre Friere, Cid de Soza State University of Campinas, Brazil INFORMS 2013 Two Related Problems

More information

A GENTLE INTRODUCTION TO THE BASIC CONCEPTS OF SHAPE SPACE AND SHAPE STATISTICS

A GENTLE INTRODUCTION TO THE BASIC CONCEPTS OF SHAPE SPACE AND SHAPE STATISTICS A GENTLE INTRODUCTION TO THE BASIC CONCEPTS OF SHAPE SPACE AND SHAPE STATISTICS HEMANT D. TAGARE. Introduction. Shape is a prominent visual feature in many images. Unfortunately, the mathematical theory

More information

CS224W Final Report. 1 Introduction. 3 Data Collection and Visualization. 2 Prior Work. Cyprien de Lichy, Renke Pan, Zheng Wu.

CS224W Final Report. 1 Introduction. 3 Data Collection and Visualization. 2 Prior Work. Cyprien de Lichy, Renke Pan, Zheng Wu. CS224W Final Report Cyprien de Lichy, Renke Pan, Zheng W 1 Introdction December 9, 2015 Recommender systems are information filtering systems that provide sers with personalized sggestions for prodcts

More information

The Disciplined Flood Protocol in Sensor Networks

The Disciplined Flood Protocol in Sensor Networks The Disciplined Flood Protocol in Sensor Networks Yong-ri Choi and Mohamed G. Goda Department of Compter Sciences The University of Texas at Astin, U.S.A. fyrchoi, godag@cs.texas.ed Hssein M. Abdel-Wahab

More information

The LS-STAG Method : A new Immersed Boundary / Level-Set Method for the Computation of Incompressible Viscous Flows in Complex Geometries

The LS-STAG Method : A new Immersed Boundary / Level-Set Method for the Computation of Incompressible Viscous Flows in Complex Geometries The LS-STAG Method : A new Immersed Bondary / Level-Set Method for the Comptation of Incompressible Viscos Flows in Complex Geometries Yoann Cheny & Olivier Botella Nancy Universités LEMTA - UMR 7563 (CNRS-INPL-UHP)

More information

Date: December 5, 1999 Dist'n: T1E1.4

Date: December 5, 1999 Dist'n: T1E1.4 12/4/99 1 T1E14/99-559 Project: T1E14: VDSL Title: Vectored VDSL (99-559) Contact: J Cioffi, G Ginis, W Y Dept of EE, Stanford U, Stanford, CA 945 Cioffi@stanforded, 1-65-723-215, F: 1-65-724-3652 Date:

More information

Tri-Edge-Connectivity Augmentation for Planar Straight Line Graphs

Tri-Edge-Connectivity Augmentation for Planar Straight Line Graphs Tri-Edge-Connectivity Agmentation for Planar Straight Line Graphs Marwan Al-Jbeh 1, Mashhood Ishaqe 1, Kristóf Rédei 1, Diane L. Sovaine 1, and Csaba D. Tóth 1,2 1 Department of Compter Science, Tfts University,

More information

Subgraph Matching with Set Similarity in a Large Graph Database

Subgraph Matching with Set Similarity in a Large Graph Database 1 Sbgraph Matching with Set Similarity in a Large Graph Database Liang Hong, Lei Zo, Xiang Lian, Philip S. Y Abstract In real-world graphs sch as social networks, Semantic Web and biological networks,

More information

Ma Lesson 18 Section 1.7

Ma Lesson 18 Section 1.7 Ma 15200 Lesson 18 Section 1.7 I Representing an Ineqality There are 3 ways to represent an ineqality. (1) Using the ineqality symbol (sometime within set-bilder notation), (2) sing interval notation,

More information

11 - Bump Mapping. Bump-Mapped Objects. Bump-Mapped Objects. Bump-Mapped Objects. Limitations Of Texture Mapping. Bumps: Perturbed Normals

11 - Bump Mapping. Bump-Mapped Objects. Bump-Mapped Objects. Bump-Mapped Objects. Limitations Of Texture Mapping. Bumps: Perturbed Normals CSc 155 Advanced Compter Graphics Limitations Of extre Mapping extre mapping paints srfaces o extre image is typically fixed Some characteristics are difficlt to textre o Roghness, Wrinkles extre illmination

More information

Submodule construction for systems of I/O automata*

Submodule construction for systems of I/O automata* Sbmodle constrction for systems of I/O atomata* J. Drissi 1, G. v. Bochmann 2 1 Dept. d'iro, Université de Montréal, CP. 6128, Scc. Centre-Ville, Montréal, H3C 3J7, Canada, Phone: (514) 343-6161, Fax:

More information

Uncertainty Determination for Dimensional Measurements with Computed Tomography

Uncertainty Determination for Dimensional Measurements with Computed Tomography Uncertainty Determination for Dimensional Measrements with Compted Tomography Kim Kiekens 1,, Tan Ye 1,, Frank Welkenhyzen, Jean-Pierre Krth, Wim Dewlf 1, 1 Grop T even University College, KU even Association

More information