On Reconfiguring Radial Trees
|
|
- Karin Howard
- 5 years ago
- Views:
Transcription
1 07 PAPER Special Section on Discrete Mathematics and Its Applications On Reconfiguring Radial Trees Yoshiyuki KUSAKARI a), Member SUMMARY A linkage is a collection of line segments, called bars, possibly joined at their ends, called joints. We consider flattening a tree-like linkage, that is, a continuous motion of their bars from an initial configuration to a final configuration looking like a straight line segment, preserving the length of each bar and not crossing any two bars. In this paper, we introduce a new class of linkages, called radial trees, and show that there exists a radial tree which cannot be flattened. key words: linkage, reconfiguration, straightening, flattening, monotone tree, radial tree. Introduction A linkage is a collection of line segments, called bars, possibly joined at their ends, called joints. A reconfiguration of a linkage is a continuous motion of their bars, or equivalently a continuous motion of their joints, that preserves the length of each bar. Applications of this problem include robotics, hydraulic tube bending, and the study of macromolecule folding [3], [7]. A linkage is called planar if all bars are in the plane R with no intersection. A reconfiguration of a linkage is called planar if all bars are in the plane during the motion, and is called non-crossing if every two bars do not cross each other during the motion. In this paper, we consider only a planar reconfiguration of a planar linkage, and we may omit the word planar. Furthermore, we consider only a non-crossing reconfiguration, and we may omit the word non-crossing. For such planar reconfiguration problems, there is a fundamental question: whether any polygonal chain can be straightened. This problem has been known as The Carpenter s Rule Problem [3], [7], [8], and had been open from the 970 s to the 990 s. However, Connelly et al. have answered this question affirmatively: they showed that any polygonal chain can be straightened, and they gave a method for straightening polygonal chains [3]. Streinu gave another method for straightening polygonal chains [8]. Both methods above work well for convexifying closed polygonal chains (polygons). For a non-crossing planar reconfiguration of tree-like linkages, several negative results are known, that is, there exist trees which cannot be flattened [], [4], [6]. Figure Manuscript received August 3, 005. Manuscript revised November 7, 005. Final manuscript received December, 005. The author is with the Department of Electronics and Information Systems, Faculty of Systems Science and Technology, Akita Prefectural University, Honjo-shi, Japan. a) kusakari@akita-pu.ac.jp DOI: 0.093/ietfec/e89 a.5.07 Fig. A locked tree []. Fig. A monotone tree [5]. illustrates a tree which cannot be flattened []. In Ref. [4], Connelly et al. gave a method for proving that some trees are locked, that is, cannot be flattened. On the other hand, an affirmative result was reported for reconfiguring tree linkages: Kusakari et al. showed that any monotone tree can be flattened, and gave a method for flattening monotone trees [5]. Figure illustrates a monotone tree [5]. Recently, the complexity of flattening tree linkages has been studied: Alt et al. showed that deciding lockability for trees is PSPACEcomplete []. However, there exist a few characterizations of tree linkages which can be flattened. Thus, it is desired to characterize a class of trees which can be flattened. In this paper, we define a new class of trees, called radially monotone trees or radial trees, which is a natural modification of the class of monotone trees, and show that there exists a radial tree which cannot be flattened. Figure 3 illustrates a locked radial tree. An early version of the paper was presented at a conference [6]. The remainder of this paper is organized as follows. In Sect., we give some preliminary definitions. In Sect. 3, we give a method to construct a locked radial tree. In Sect. 4, we show that the tree constructed in Sect. 3 is simple and radial. In Sect. 5, we present a theorem that the tree constructed in Sect. 3 cannot Copyright c 006 The Institute of Electronics, Information and Communication Engineers
2 08 Fig. 3 An overview of a locked radial tree. definition of monotone trees. A polygonal chain P is radially monotone for a point p (or, for short, radial for a point p ) if the intersection of P and any circle with the same center p is either a single point or empty. A tree T is radially monotone or radial if T is a rooted tree and every root-leaf polygonal chain in T is radially monotone for the root r. A radial tree is illustrated in Fig. 3. On the other hand, the tree illustrated in Fig. is not radial. Furthermore, every locked tree in [], [], [4] is not radial. Note that an x-monotone tree may not be radial, and a radial tree may not be x-monotone. For three points p, p, p 3 R, the angle p p p 3 is measured counterclockwise at point p from the direction of p p to the direction of p p 3, and ranges in [0, ). For two bars j = ( j 0, j ), j = ( j, j ) B joined with joint j, the angle j 0 j j is denoted by θ( j, j ). The slope s( j )of bar j = ( j 0, j ) is the angle measured counterclockwise at the parent joint j 0 from +x direction to the direction j0 j, andrangesin[0, ). The length of bar b B is denoted by b. For two points p, p R, the ray starting from p and passing through p is denoted by R(p, p ). For a point p R and a direction d [0, ), the ray starting from p and going in the direction d is denoted by R p (d). The circle centered at p R with radius a R is denoted by O p (a), and the circle with diameter p p is denoted by O(p, p ). be flattened. In Sect. 6, we prove lemmas whose proofs are omitted in Sect. 5. We conclude in Sect. 7.. Preliminaries Let L = (J, B) denote a linkage consisting of a joint set J and a bar set B. A structural graph of a linkage L is denoted by G(L). An embedding of a structural graph G(L) is called a configuration of linkage L. A linkage L is calleda(rooted) tree linkage or a (rooted) tree if the structural graph G(L) is a (rooted) tree. Let T = (J, B) be such a rooted tree linkage, and let r J be the root of T. A bar b B is denoted by ( j s, j t )if j s J is the parent of j t J. For any joint j J, a bar emanating from j, b = ( j, j ), is called a child bar of joint j. Aleaf is a joint having no child bar. For any joint j J {r}, a bar entering to j, b = ( j, j), is called a parent bar of joint j. For any joint j J {r}, a parent bar of j is unique, and is denoted by j. A joint j J is internal if j is neither the root nor a leaf. A flattened configuration of a rooted tree linkage is one in which the parent bar j of j makes angle with each child bar of j for every internal joint j, and the angle between each pair of child bars of j is zero for every non-leaf joint j J. Flattening a tree linkage T is a reconfiguration of T from an initial configuration to a flattened configuration. As an initial configuration of a tree linkage, we first define a monotone tree [5]. A polygonal chain P is x-monotone if the intersection of P and any vertical line is either a single point or a line segment if the intersection is not empty. A tree T is x-monotone if T is a rooted tree and every root-leaf polygonal chain in T is x-monotone. (See Fig..) Next, we define radial trees by slightly modifying the 3. Constructing a Locked Radial Tree In this section, we construct a radial tree which cannot be flattened, i.e., we construct a locked radial tree. Figure 3 illustrates such a locked radial tree. 3. Outline of Construction In this subsection, we show how to construct a locked radial tree. We first define some terms on a locked radial tree. Figure 3 does not illustrate a strict locked radial tree. Some bars should be overlapped and some joints should be touched each other in a strict locked radial tree. The locked tree T in Fig. 3 contains six congruent components C 0, C,, C 5, all of which are joined at the root r of T. More generally, one can construct a locked radial tree by such n(> 4) congruent components, each of which is called a C i component and is often denoted by C i,fori, 0 i n. Each C i component consists of three subcomponents: a V i component, anl i component and a Γ i component. TheseV i, L i and Γ i components are often denoted by V i, L i and Γ i, respectively. For each i,0 i n, these V i, L i and Γ i are incident to the root r counterclockwise in this order. Furthermore, L i is wrapped by V i and Γ i, as illustrated in Fig. 4. The V i component has two bars v = (v 0,v ) and v = (v,v ), joined with the internal joint v, whose angle θ(v, v ) is equal to + n (= + 6 ), and V i looks like the letter V, as illustrated in Fig. 5. The L i component has two bars l = (l 0, l )andl = (l, l ), joined with the internal joint l, whose angle θ(l, l ) is equal to 3,andL i looks like the letter L, as illustrated
3 KUSAKARI: ON RECONFIGURING RADIAL TREES 09 Fig. 4 Component C i. Fig. 8 Position of v Detail of Construction Fig. 5 Subcomponent V i. Fig. 6 Subcomponent L i. Fig. 7 Subcomponent Γ i. in Fig. 6. The Γ i component has four bars γ = (γ 0,γ ), γ = (γ,γ ), γ 3 = (γ,γ 3 )andγ 4 = (γ 3,γ 4 ), and two internal joints γ,γ 3. Γ i looks like the letter Γ, as illustrated in Fig. 7. The angles γ 0 γ γ, γ 0 γ γ 3 and γ 0 γ 3 γ 4 are, and 3, respectively. In this subsection, we focus on a single C i component, and may often omit the index i for simplicity. Furthermore, subcomponents, bars, and joints in C i or C i+ are designated by the corresponding objects with symbol or +, respectively. For example, Γ i, Γ i and Γ i+ are denoted by Γ, Γ and Γ +, respectively. Moreover, the bar in Γ i+ corresponding to the bar γ in Γ i is denoted by γ +. We use similar notation for the others. For two points p, p R, we denote by p p the line segment connecting p and p, and by p p the length of the segment p p. We will define an initial configuration Ci of the C i component. A joint j J in C i is denoted by j in Ci,anda bar b B in C i is denoted by b in Ci.Fori, 0 i n, we draw all figures Ci simultaneously so that each pair of corresponding bars in consecutive components makes angle n, and the index i increases counterclockwise. Without loss of generality, we may assume that the length γ is equal to, and the slope s(γ ) is equal to. Recall that we draw all bars corresponding to γ for all Ci simultaneously. Then, for each i, 0 i n, we draw line segments γ = γ γ on each ray R γ (0) from the point γ, so that the angle θ(γ, γ ) is equal to. We choose the length γ long enough, so that the ray R(r, (γ ) ) intersects γ. Thus, we choose the length γ so as to satisfy γ > tan( n ). Next, we choose a point γ4 on the bar (γ ) +,sothat the following inequality holds: ( ) ( tan < γ + n γ 4 < min tan n ), sin ( n ). () The condition tan( n ) < γ+ γ 4 < tan( n ) ensures that γ 4 lies between points X and Y, which are defined later. (See Fig. 8.) Moreover, the condition tan( n ) < γ+ γ 4 < sin( n ) ensures that γ4 lies between points W and Y, which are also defined later. (See Fig. 0.) Thus, inequality () ensures that γ4 is contained in both XY and WY. One can find the point γ3, on the bar γ, satisfying
4 0 γ4 γ 3 r =. Actually, the point γ 3 is the intersection of the bar γ and the circle O(r,γ4 ). Then, we draw two line segments γ4 r and γ 4 γ 3. (See Fig. 0.) We finally drop a perpendicular from γ to rv (= r(γ 4 ) ), and let l be the foot of the perpendicular. We construct C i on the figure Ci. For a joint j and a point p, the notation j = p means that joint j is configured at point p. For a bar b and a line segment s, the notation b = s also means that bar b is configured at line segment s. The initial configuration of the C i component is obtained as follows. (See Figs. 4 7, and 0.) For the V i component, let v = v (= (γ 4) ), v = γ, v = v (= rv ), and v = v (= v γ ). For the L i component, let l = l, l = l (= γ ), l = l (= rl ), and l = l (= l l ). For the Γ i component, γ = γ, γ = γ, γ 3 = γ3, γ 4 = γ4 (= v+ ), γ = γ (= rγ ), γ = γ (= γ γ ), γ 3 = γ 3 (= γ γ 3 ), and γ 4 = γ 4 (= γ3 γ 4 ). From this construction, one observes that v = v, v = v, l = l, l = l, γ = γ, γ = γ, γ 3 = γ 3,and γ 4 = γ 4. Note that all lengths γ 3, v, l and l are determined if γ + γ 4 is determined. 4. The Initial Configuration In this section, we show that the tree constructed in the previous section is simple and radial. From now on, we often do not distinguish the linkage and its configuration, and may often omit the symbol *. 4. Simplicity The slope s(γ + ) is equal to n and is smaller than if n > 4. The length γ is greater than tan n from the construction. Therefore, the ray R γ ( ) should cross γ +. Let X be the intersection point of the ray R γ ( ) with γ +,andlety be the intersection point of the ray R γ () with γ +, as illustrated in Fig. 8. Since the length γ + is equal to and Xrγ + is equal to γ rγ + (= n ), the length γ+ X is equal to tan( n ). Furthermore, one can observe γ + Y = tan( n ) as follows: since the hypotenuses are common and rγ = rγ + (= ), the two right triangles ryγ and ryγ + are congruent, and hence γ ry = Yrγ + = n. Thus, the point γ 4 is contained in the open line segment XY since the condition tan( n ) < γ+ γ 4 < tan( n ) holds by construction. Therefore, one can observe that the two line segments γ4 r(= (v ) + )and γ4 γ 3 (= γ 4 ) can be drawn without (properly) crossing any other line segments. Furthermore, one can easily observe that any pair of line segments in Ci can be drawn without (properly) crossing even if the pair contains neither (v ) + nor γ 4. Therefore, the tree constructed in Sect. 3 is simple. 4. Radial Monotonicity For any joint j J, a subtree of T rooted at j is denoted Fig. 9 Fan F j [θ,θ ]. by T( j). A fan p jp is the set of points swept out by a ray starting j moving counterclockwise from the direction jp to the direction jp, and contains points on both R( j, p )and R( j, p ). A fan p jp may be denoted by F j [θ,θ ], where θ = rjp and θ = rjp.(seefig.9.) The following lemmas hold. Lemma : (i) A tree T = (J, B) is radial if and only if, for any joint j J, all points p (except for j) contained in the subtree T( j) are properly outside of the circle O r ( rj ). (ii) A tree T = (J, B) isradialifandonlyif,foranyjoint j J {r}, every child bar b = ( j, j ) B is contained in the fan F j [, 3 ]. Proof. Both (i) and (ii) are obvious from the definition of radial trees. Note that, for every bar b = (r, j) emanating from the root r, the slope s(b) can take any value in [0, ) evenift is radial. Lemma : (i) The V i component is radial for the root r. (ii) The L i component is radial for the root r. (iii) The Γ i component is radial for the root r. Proof. (i) One can easily observe that the angle θ(v, v ) is greater than or equal to.(seefig.5.) Thus, the bar v is contained in the fan F v [, 3 ], and hence the path (r =)v 0 v v is radial by Lemma (ii). (ii) From the construction of the L i component, the angle θ(l, l ) is equal to 3. Thus, the bar l is contained in F l [, 3 ], and hence the path (r =)l 0l l is radial by Lemma (ii). (iii) Since the Γ i component has two leaves, it is sufficient to show that both path P and path P are radial, where P = γ 0 γ γ and P = γ 0 γ γ 3 γ 4. From the construction, θ(γ, γ ) =, and hence the path P is radial by Lemma (ii). Furthermore, one observe that the bar γ 3 is contained in F γ [, 3 ]andthebarγ 4 is contained in F γ3 [, 3 ]since θ(γ, γ 3 ) = and γ 0γ 3 γ 4 = 3. Thus, by Lemma (ii), the path P is radial. Every C i component is radial since all subcomponents are radial by Lemma above, and hence the tree constructed in Sect. 3 is radial.
5 KUSAKARI: ON RECONFIGURING RADIAL TREES 5. Lockability In this section, we present a theorem that the tree constructed in Sect. 3 cannot be flattened. Note that the method of the proof described in [4] cannot directly apply to our tree. For the initial configuration, the following lemma holds. Lemma 3: (i) rγ l <, (ii) l γ γ <, (iii) rγ 4 γ 3 <,and (iv) γ 3 γ 4 v + <. The following four inequalities hold: Proof. Since the sum rγ l + l γ γ is equal to rγ γ (= ), both (i) and (ii) immediately follow. Moreover, since the sum rγ 4 γ 3 + γ 4 γ 3 r + γ 3 rγ 4 is equal to and the angle γ 4 γ 3 r is equal to, (iii) follows. Thus, we only prove (iv) below. A quadrangle is a convex polygon with four vertices A, B, C, D counterclockwise, and is denoted by ABCD. For the quadrangle rγ 3 γ 4 γ +, it follows that γ 4γ 3 r = rγ + γ 4(= ) from our construction of the tree, and hence the sum γ + γ 4γ 3 + γ 3 rγ + is equal to. Let Z and W be vertices of a rectangle rzwγ + such that the vertex Z is on γ and the vertex W is on γ +, as illustrated in Fig. 0. Then, the angle γ Zr is equals to γ rγ + (= n ), since the equation Zrγ + γ Zr = Zrγ + γ rγ + = holds. Therefore, the equation γ + W = rz = follows. The sin( n ) condition γ + v+ < holds from Eq. (), and hence sin( n ) v+ is on the open line segment γ + W. Since both O(r,v+ )and O(r, W) have the same chord rγ + and the radius of O(r,v+ ) is smaller than the radius of O(r, W), γ 3 lies between points γ and Z from the construction. On the other hand, one can easily observe that γ 3 γ 4 v + = γ 3rγ + since the equation γ + γ 4γ 3 + γ 3 γ 4 v + = γ+ γ 4γ 3 + γ 3 rγ + = holds. Thus, the angle γ 3 γ 4 v + is equal to Zrγ+ and is smaller than. For each C i, the angle v rv + is called the angle of C i and may be denoted by C i. A reconfiguration widens C i if it makes the angle C i increase, and squeezes C i if it makes the angle C i decrease. The following lemmas hold. Lemma 4: There exists a widened C i component if and only if there exists a squeezed C j component, where 0 i, j n andi j. Proof. n Since the sum C i is equal to, the claim i=0 immediately follows. From Lemma 3 and 4, one can observe the following Lemma holds, a proof of which will be given in Sect. 6. Lemma 5: (i) No reconfiguration can squeeze any C i component. (ii) No reconfiguration can widen any C i component. Thus, the following theorem holds. Theorem : There exists a radial tree which cannot be flattened. 6. Proof of Lemma 5 In this section, we prove Lemma 5 whose proof is omitted in Sect. 5. We first give some additional notation. For any point p R, the x-,y-coordinate of p is denoted by x(p),y(p),respectively. Recall that the circle centered at p R with radius a R is denoted by O p (a). An inner open region bounded by O p (a) is denoted by Ô p (a), and an outer closed region bounded by O p (a) is denoted by Ŏ p (a). Note that Ô p (a) does not include any points on the boundary O p (a), but Ŏ p (a) does. An arc on O p (a) from a point q to a point q counterclockwise is denoted by A p (a; q, q ). Below, we regard the reconfiguration as a continuous function on time t [0, ), where the initial configuration is the image of this reconfiguration at time t = 0. The configuration of any object o at time t is denoted by o(t). For example, a configuration of joint v at time t is denoted by v (t). Moreover,C i (0) = Ci for every i, 0 i n. We use similar notation for the others. We may assume, without loss of generality, that the root r is located on the origin of the xy-plane, and the bar v of C 0 is fixed during any time t [0, ) for any reconfiguration. Thus, for any time t [0, ) of any reconfiguration, the following equation holds: v (t) = v (0)(= v ). () Therefore, the following equations also hold: { v0 (t) = v 0 (0)(= v 0 = r), v (t) = v (0)(= v ). Fig. 0 Position of γ 3. We shall prove some lemmas before proving Lemma 5.
6 In order to prove these lemmas, we consider infinitely small motion of linkage. We say that a motion of linkage L = (J, B)isinfinitely small for ε>0andt > 0 if every joint j J is contained in Ô j(0) (ε) during period [0, t). Since every reconfiguration is continuous, for any small real number ε>0, there exists a time δ>0such that the reconfiguration is infinitely small for ε and δ, i.e., every joint j J is properly contained in Ô j(0) (ε) during period [0,δ). Below, we only consider such infinitely small motion for a sufficiently small ε and a corresponding short time δ, sothatnocritical event occur, like s(γ 4 (t)) s(v + (t)) =. A crescent region CR j (ε) is the region defined by Ô j (ε) Ŏ j ( j ), where j is the parent joint of j. Thefollowing lemmas hold. Lemma 6: For any reconfiguration, the following membership holds during any time t [0,δ): l (t) CR l (ε). to l on A r( l ; l, l ). Then, at any time t [0,δ), joint l (t) is contained in R. One can easily observe that the region R contained in Ŏ l ( l ) Ô l ( l + ε). Thus, the claim holds. Lemma 7: For any reconfiguration, the following inequality holds at any time t [0,δ): v rγ (t) v rγ (0). Proof. By Eq. (), it is sufficient to show that the slope s(γ (t)) is greater than or equal to. Suppose for a contradiction that s(γ (t)) is smaller than for some time t [0,δ). Let γ (t)γ be the upper tangent of point γ (t) andcircle O γ (ε), and let F γ (t) beafanrγ (t)γ, as illustrated in Fig.. Proof. From the assumption of infinitely small motion, l (t) is contained in Ô l (ε). Thus, we shall only show that l (t) Ŏ l ( l ). Let l be the intersection of O l (ε) ando r( l ) satisfying s(rl ) < s(rl ). (See Fig..) Since l 0(= r) isfixedfor any reconfiguration and any time, l (t) should lie on O r ( l ). Moreover, the angle v (t)rl (t) should be greater than or equal to zero at any time t [0,δ) from Eq. () and the condition of a non-crossing reconfiguration. Thus, l (t) should lie on A r ( l ; l, l ) during time t [0,δ). Furthermore, joint l (t) should lie on O l (t)( l ). Let R be the region swept by a part of Ŏ l (t)( l ) with center from l Fig. Feasible position of l in time [0,δ). Fig. Impossible motion of γ.
7 KUSAKARI: ON RECONFIGURING RADIAL TREES 3 Then, one can observe that l (t) should be contained in F γ (t) from the condition of a non-crossing reconfiguration since no critical events occur during [0,δ). On the other hand, by Lemma 6, l (t) should be contained in CR l (ε). We shall show below that the equation F γ (t) CR l (ε) = holds. Let γ and γ be two intersections of O γ (ε) and O r ( γ ) satisfying s(rγ ) < s(rγ ), and let T l be the tangent of O l ( l )atl, as illustrated in Fig.. Then, T l is perpendicular to bar l. Moreover, by Lemma 3, the angle rγ l is smaller than and the angle l γ γ is also smaller than, and hence the equation F γ (0) CR l (ε) = {γ } holds at time t = 0. Furthermore, γ (t) should lie on A r ( γ ; γ,γ ), and hence x(γ (t)) is greater than zero since the slope s(γ (t)) is smaller than. This means that F γ (t) CR l (ε) = at time t > 0. Lemma 8: For any reconfiguration, the following inequality holds during the time t [0,δ): s(γ (t)) 0. Proof. By the proof of Lemma 7, one can observe that γ (t) should lie on A r ( γ ; γ,γ ). The y-coordinate of any point on A r ( γ ; γ,γ ) is smaller than or equal to y(γ )(= ). Moreover, γ (t) should be above v whose y-coordinate is equal to y(v )(= ) from Eq. (), and γ (t) should be contained in Ô γ (ε). Thus, the claim should hold from the condition of a non-crossing reconfiguration. Lemma 9: For any reconfiguration, if γ is fixed during the time t [0,δ) then the following inequality holds: γ rv+ (t) γ rv+ (0). Proof. Assume that γ is fixed during the time t [0,δ) in this proof. Then, it is sufficient to show that s(v + (t)) s(v + (0)). Suppose for a contradiction s(v + (t)) < s(v + (0)) for some time t [0,δ). Let γ3 be the intersection of O γ3 (ε)and O γ ( γ 3 ) satisfying s(γ γ 3 ) > 0, as illustrated in Fig. 3. Since γ and γ are fixed, γ 3 (t) should lie on A γ ( γ 3 ; γ3,γ 3 ). Similarly to the proof of Lemma 6, one can easily observe that the following membership holds: γ 4 (t) CR γ4 (ε). Let F v + (t) bethefanrv + (t)v+ (t). Then, similarly to the proof of Lemma 7, one can observe that F v + (t) CR γ4 (ε) = as follows. By Lemma 3, the angle rv + γ 3 is smaller than and the angle γ 3 γ+ v+ is also smaller than, and hence the equation F v + (0) CR γ4 (ε) = {γ4 } holds at time t = 0. However, since the slope s(v + (t)) is smaller than s(v + ), the equation F v + (t) CR γ4 (ε) = follows at time t > 0. We are now ready to prove Lemma 5. Proof of Lemma 5 By Lemma 4, it is sufficient to show Fig. 3 Feasible position of γ 4 in time [0,δ). only (i), i.e., we shall only show that no reconfiguration can squeeze any C i component. By Lemma 9, the angle v rv+ (t) is greater than or equal to v rv+ (0) if γ is fixed during the time t [0,δ). Moreover, since the inequality x(γ (t)) x(γ ) holds by Lemma 7 and the inequality s(γ (t)) 0 holds by Lemma 8, the x-coordinate x(γ 3 (t)) is smaller than or equal to x(γ3 ). This means that v + (t) should be contained in the region obtained by shifting CR γ4 (ε) tothe x direction. Therefore, the angle v rv+ (t) is greater than or equal to v rv+ (0) even if γ (t) rotates about the center r counterclockwise. Thus, the claim holds. 7. Conclusion In this paper, we show that there exists a tree linkage which is radially monotone and cannot be flattened. The following future works remain: () find new characterization of a class of tree linkages which can be flattened, () find a method for flattening a class of tree linkages other than monotone trees, and (3) find othernecessary or sufficient conditions for linkages to be reconfigured to some regular form, say, straightened, flattened, or convexified,. Acknowledgments We would like to thank Dr. Takao Nishizeki and Dr. Akiyoshi Shioura in Tohoku University for their helpful comments, which improve the presentation of this paper. We also wish to thank anonymous referees for their valuable comments, which improve the clarity of this paper. References [] H. Alt, C. Knauer, G. Rote, and S. Whitesides, On the complexity of the linkage reconfiguration problem in Towards a Theory of
8 4 Geometric Graphs, pp. 4, American Mathematical Society, 004. A preliminary version appeared as, The complexity of (un)folding, Proc. 9th ACM Symp. Computational Geometry, pp.64 70, 003. [] T. Biedl, E. Demaine, M. Demaine, S. Lazard, A. Lubiw, J. O Rourke, S. Robbins, I. Streinu, G. Toussaint, and S. Whitesides, A note on reconfiguring tree linkages: Trees can lock, Discrete Applied Mathematics, vol.54, pp.9 3, 00. A preliminary version appeared in Proc. 0th Canadian Conference on Computational Geometry, 998. [3] R. Connelly, E. Demaine, and G. Rote, Straightening polygonal arcs and convexifying polygonal cycles, Discrete and Computational Geometry, vol.30, pp.05 39, 003. A preliminary version appeared in Proc. 4st IEEE Symp. Foundations of Computer Science, pp.43 44, 000. [4] R. Connelly, E. Demaine, and G. Rote, Infinitesimally locked selftouching linkages with applications to locked trees, in Physical Knots: Knotting, Linking, and Folding Geometric Objects in R 3, pp.87 3, American Mathematical Society, 00. A preliminary version appeared in Proc. th Annual Fall Workshop on Computational Geometry, 00. [5] Y. Kusakari, M. Sato, and T. Nishizeki, Planar reconfiguration of monotone trees, IEICE Trans. Fundamentals, vol.e85-a, no.5, pp , May 00. [6] Y. Kusakari, On reconfiguring radial trees, Proc. JCDCG00, Lecture Notes Comput. Sci. 866, pp.8 9, Springer-Verlag, 003. [7] J. O Rourke, Folding and unfolding in computational geometry, Proc. JCDCG 98, Lecture Notes Comput. Sci. 763, pp.58 66, Springer-Verlag, 000. [8] I. Streinu, A combinatorial approach to planar non-colliding robot arm motion planning, Proc. 4st IEEE Symp. Foundations of Computer Science, pp , 000. Yoshiyuki Kusakari received the B.E. degree in information engineering, and the M.S. and Ph.D. degrees in information science from Tohoku University, Japan, in 993, 995 and 998, respectively. He joined Akita Prefectural University in 000, and is currently Associate Professor of Faculty of Systems Science and Technology. His research interests include graph theory and computational geometry.
Zipper Unfolding of Domes and Prismoids
CCCG 2013, Waterloo, Ontario, August 8 10, 2013 Zipper Unfolding of Domes and Prismoids Erik D. Demaine Martin L. Demaine Ryuhei Uehara Abstract We study Hamiltonian unfolding cutting a convex polyhedron
More informationFolding Equilateral Plane Graphs
Folding Equilateral Plane Graphs Zachary Abel 1, Erik D. Demaine 2, Martin L. Demaine 2, Sarah Eisenstat 2, Jayson Lynch 2, Tao B. Schardl 2, and Isaac Shapiro-Ellowitz 3 1 MIT Department of Mathematics,
More informationPlanar interpolation with a pair of rational spirals T. N. T. Goodman 1 and D. S. Meek 2
Planar interpolation with a pair of rational spirals T N T Goodman and D S Meek Abstract Spirals are curves of one-signed monotone increasing or decreasing curvature Spiral segments are fair curves with
More informationPacking Congruent Bricks into a Cube
Journal for Geometry and Graphics Volume 5 (2001), No. 1, 1 11. Packing Congruent Bricks into a Cube Ákos G. Horváth, István Prok Department of Geometry, Budapest University of Technology and Economics
More informationIntegrated Math II. IM2.1.2 Interpret given situations as functions in graphs, formulas, and words.
Standard 1: Algebra and Functions Students graph linear inequalities in two variables and quadratics. They model data with linear equations. IM2.1.1 Graph a linear inequality in two variables. IM2.1.2
More information(x 1, y 1 ) = (x 2, y 2 ) if and only if x 1 = x 2 and y 1 = y 2.
1. Complex numbers A complex number z is defined as an ordered pair z = (x, y), where x and y are a pair of real numbers. In usual notation, we write z = x + iy, where i is a symbol. The operations of
More information4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN. Robin Thomas* Xingxing Yu**
4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN Robin Thomas* Xingxing Yu** School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332, USA May 1991, revised 23 October 1993. Published
More informationMA 460 Supplement: Analytic geometry
M 460 Supplement: nalytic geometry Donu rapura In the 1600 s Descartes introduced cartesian coordinates which changed the way we now do geometry. This also paved for subsequent developments such as calculus.
More informationThe unit distance problem for centrally symmetric convex polygons
The unit distance problem for centrally symmetric convex polygons Bernardo M. Ábrego Department of Mathematics California State University, Northridge Silvia Fernández-Merchant Department of Mathematics
More informationFractional and circular 1-defective colorings of outerplanar graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 6() (05), Pages Fractional and circular -defective colorings of outerplanar graphs Zuzana Farkasová Roman Soták Institute of Mathematics Faculty of Science,
More informationNew Jersey Center for Teaching and Learning. Progressive Mathematics Initiative
Slide 1 / 150 New Jersey Center for Teaching and Learning Progressive Mathematics Initiative This material is made freely available at www.njctl.org and is intended for the non-commercial use of students
More information9.7 Extension: Writing and Graphing the Equations
www.ck12.org Chapter 9. Circles 9.7 Extension: Writing and Graphing the Equations of Circles Learning Objectives Graph a circle. Find the equation of a circle in the coordinate plane. Find the radius and
More informationNon-separating 2-factors of an even-regular graph
Discrete Mathematics 308 008) 5538 5547 www.elsevier.com/locate/disc Non-separating -factors of an even-regular graph Yusuke Higuchi a Yui Nomura b a Mathematics Laboratories College of Arts and Sciences
More informationHomework Assignments Math /02 Fall 2017
Homework Assignments Math 119-01/02 Fall 2017 Assignment 1 Due date : Wednesday, August 30 Section 6.1, Page 178: #1, 2, 3, 4, 5, 6. Section 6.2, Page 185: #1, 2, 3, 5, 6, 8, 10-14, 16, 17, 18, 20, 22,
More informationMath Precalculus I University of Hawai i at Mānoa Spring
Math 135 - Precalculus I University of Hawai i at Mānoa Spring - 2014 Created for Math 135, Spring 2008 by Lukasz Grabarek and Michael Joyce Send comments and corrections to lukasz@math.hawaii.edu Contents
More informationRose-Hulman Undergraduate Mathematics Journal
Rose-Hulman Undergraduate Mathematics Journal Volume 17 Issue 1 Article 5 Reversing A Doodle Bryan A. Curtis Metropolitan State University of Denver Follow this and additional works at: http://scholar.rose-hulman.edu/rhumj
More information36. Double Integration over Non-Rectangular Regions of Type II
36. Double Integration over Non-Rectangular Regions of Type II When establishing the bounds of a double integral, visualize an arrow initially in the positive x direction or the positive y direction. A
More informationPRACTICE TEST 1 Math Level IC
SOLID VOLUME OTHER REFERENCE DATA Right circular cone L = cl V = volume L = lateral area r = radius c = circumference of base h = height l = slant height Sphere S = 4 r 2 V = volume r = radius S = surface
More informationTheorem 1.2 (Converse of Pythagoras theorem). If the lengths of the sides of ABC satisfy a 2 + b 2 = c 2, then the triangle has a right angle at C.
hapter 1 Some asic Theorems 1.1 The ythagorean Theorem Theorem 1.1 (ythagoras). The lengths a b < c of the sides of a right triangle satisfy the relation a + b = c. roof. b a a 3 b b 4 b a b 4 1 a a 3
More informationBaltic Way 2008 Gdańsk, November 8, 2008
Baltic Way 008 Gdańsk, November 8, 008 Problems and solutions Problem 1. Determine all polynomials p(x) with real coefficients such that p((x + 1) ) = (p(x) + 1) and p(0) = 0. Answer: p(x) = x. Solution:
More informationHomework Assignments Math /02 Fall 2014
Homework Assignments Math 119-01/02 Fall 2014 Assignment 1 Due date : Friday, September 5 6th Edition Problem Set Section 6.1, Page 178: #1, 2, 3, 4, 5, 6. Section 6.2, Page 185: #1, 2, 3, 5, 6, 8, 10-14,
More informationVector Calculus. Lecture Notes
Vector Calculus Lecture Notes Adolfo J. Rumbos c Draft date November 23, 211 2 Contents 1 Motivation for the course 5 2 Euclidean Space 7 2.1 Definition of n Dimensional Euclidean Space........... 7 2.2
More informationEdge-Unfolding Nearly Flat Convex Caps
Edge-Unfolding Nearly Flat Convex Caps Joseph O Rourke August 31, 2017 Abstract This paper proves a conjecture from [LO17]: A nearly flat, acutely triangulated convex cap C has an edge-unfolding to a non-overlapping
More informationMECH 576 Geometry in Mechanics November 30, 2009 Kinematics of Clavel s Delta Robot
MECH 576 Geometry in Mechanics November 3, 29 Kinematics of Clavel s Delta Robot The DELTA Robot DELTA, a three dimensional translational manipulator, appears below in Fig.. Figure : Symmetrical (Conventional)
More informationDefinitions, Axioms, Postulates, Propositions, and Theorems from Euclidean and Non-Euclidean Geometries by Marvin Jay Greenberg
Definitions, Axioms, Postulates, Propositions, and Theorems from Euclidean and Non-Euclidean Geometries by Marvin Jay Greenberg Undefined Terms: Point, Line, Incident, Between, Congruent. Incidence Axioms:
More informationSecondary School Certificate Examination Syllabus MATHEMATICS. Class X examination in 2011 and onwards. SSC Part-II (Class X)
Secondary School Certificate Examination Syllabus MATHEMATICS Class X examination in 2011 and onwards SSC Part-II (Class X) 15. Algebraic Manipulation: 15.1.1 Find highest common factor (H.C.F) and least
More informationQUESTION BANK ON STRAIGHT LINE AND CIRCLE
QUESTION BANK ON STRAIGHT LINE AND CIRCLE Select the correct alternative : (Only one is correct) Q. If the lines x + y + = 0 ; 4x + y + 4 = 0 and x + αy + β = 0, where α + β =, are concurrent then α =,
More informationIndicate whether the statement is true or false.
PRACTICE EXAM IV Sections 6.1, 6.2, 8.1 8.4 Indicate whether the statement is true or false. 1. For a circle, the constant ratio of the circumference C to length of diameter d is represented by the number.
More information12-neighbour packings of unit balls in E 3
12-neighbour packings of unit balls in E 3 Károly Böröczky Department of Geometry Eötvös Loránd University Pázmány Péter sétány 1/c H-1117 Budapest Hungary László Szabó Institute of Informatics and Economics
More information(D) (A) Q.3 To which of the following circles, the line y x + 3 = 0 is normal at the point ? 2 (A) 2
CIRCLE [STRAIGHT OBJECTIVE TYPE] Q. The line x y + = 0 is tangent to the circle at the point (, 5) and the centre of the circles lies on x y = 4. The radius of the circle is (A) 3 5 (B) 5 3 (C) 5 (D) 5
More informationMAT1035 Analytic Geometry
MAT1035 Analytic Geometry Lecture Notes R.A. Sabri Kaan Gürbüzer Dokuz Eylül University 2016 2 Contents 1 Review of Trigonometry 5 2 Polar Coordinates 7 3 Vectors in R n 9 3.1 Located Vectors..............................................
More informationA Pair in a Crowd of Unit Balls
Europ. J. Combinatorics (2001) 22, 1083 1092 doi:10.1006/eujc.2001.0547 Available online at http://www.idealibrary.com on A Pair in a Crowd of Unit Balls K. HOSONO, H. MAEHARA AND K. MATSUDA Let F be a
More informationExhaustion: From Eudoxus to Archimedes
Exhaustion: From Eudoxus to Archimedes Franz Lemmermeyer April 22, 2005 Abstract Disclaimer: Eventually, I plan to polish this and use my own diagrams; so far, most of it is lifted from the web. Exhaustion
More information2009 Math Olympics Level II Solutions
Saginaw Valley State University 009 Math Olympics Level II Solutions 1. f (x) is a degree three monic polynomial (leading coefficient is 1) such that f (0) 3, f (1) 5 and f () 11. What is f (5)? (a) 7
More informationGeometry. Open Caps and Cups in Planar Point Sets. Pavel Valtr. 1. Introduction
Discrete Comput Geom 37:565 576 (2007) DOI: 10.1007/s00454-006-1286-3 Discrete & Computational Geometry 2007 Springer Science+Business Media, Inc. Open Caps and Cups in Planar Point Sets Pavel Valtr Department
More informationConstant Time Generation of Set Partitions
930 PAPER Special Section on Selected Papers from the 17th Workshop on Circuits and Systems in Karuizawa Constant Time Generation of Set Partitions Shin-ichiro KAWANO a) and Shin-ichi NAKANO b), Members
More information12 Inversion by a Circle
12 Inversion by a Circle 12.1 Definition and construction of the inverted point Let D be a open circular disk of radius R and center O, and denote its boundary circle by D. Definition 12.1 (Inversion by
More informationMT - w A.P. SET CODE MT - w - MATHEMATICS (71) GEOMETRY- SET - A (E) Time : 2 Hours Preliminary Model Answer Paper Max.
.P. SET CODE.. Solve NY FIVE of the following : (i) ( BE) ( BD) ( BE) ( BD) BE D 6 9 MT - w 07 00 - MT - w - MTHEMTICS (7) GEOMETRY- (E) Time : Hours Preliminary Model nswer Paper Max. Marks : 40 [Triangles
More informationMathematics 3210 Spring Semester, 2005 Homework notes, part 8 April 15, 2005
Mathematics 3210 Spring Semester, 2005 Homework notes, part 8 April 15, 2005 The underlying assumption for all problems is that all points, lines, etc., are taken within the Poincaré plane (or Poincaré
More informationTrans Web Educational Services Pvt. Ltd B 147,1st Floor, Sec-6, NOIDA, UP
Solved Examples Example 1: Find the equation of the circle circumscribing the triangle formed by the lines x + y = 6, 2x + y = 4, x + 2y = 5. Method 1. Consider the equation (x + y 6) (2x + y 4) + λ 1
More informationComplex Analysis Homework 3
Complex Analysis Homework 3 Steve Clanton David Holz March 3, 009 Problem 3 Solution. Let z = re iθ. Then, we see the mapping leaves the modulus unchanged while multiplying the argument by -3: Ω z = z
More informationDefinitions, Axioms, Postulates, Propositions, and Theorems from Euclidean and Non-Euclidean Geometries by Marvin Jay Greenberg ( )
Definitions, Axioms, Postulates, Propositions, and Theorems from Euclidean and Non-Euclidean Geometries by Marvin Jay Greenberg (2005-02-16) Logic Rules (Greenberg): Logic Rule 1 Allowable justifications.
More informationOn the maximum number of isosceles right triangles in a finite point set
On the maximum number of isosceles right triangles in a finite point set Bernardo M. Ábrego, Silvia Fernández-Merchant, and David B. Roberts Department of Mathematics California State University, Northridge,
More informationUSAC Colloquium. Bending Polyhedra. Andrejs Treibergs. September 4, Figure 1: A Rigid Polyhedron. University of Utah
USAC Colloquium Bending Polyhedra Andrejs Treibergs University of Utah September 4, 2013 Figure 1: A Rigid Polyhedron. 2. USAC Lecture: Bending Polyhedra The URL for these Beamer Slides: BendingPolyhedra
More information1966 IMO Shortlist. IMO Shortlist 1966
IMO Shortlist 1966 1 Given n > 3 points in the plane such that no three of the points are collinear. Does there exist a circle passing through (at least) 3 of the given points and not containing any other
More informationEntropy-Preserving Cuttings and Space-Efficient Planar Point Location
Appeared in ODA 2001, pp. 256-261. Entropy-Preserving Cuttings and pace-efficient Planar Point Location unil Arya Theocharis Malamatos David M. Mount Abstract Point location is the problem of preprocessing
More informationUNIT 6. BELL WORK: Draw 3 different sized circles, 1 must be at LEAST 15cm across! Cut out each circle. The Circle
UNIT 6 BELL WORK: Draw 3 different sized circles, 1 must be at LEAST 15cm across! Cut out each circle The Circle 1 Questions How are perimeter and area related? How are the areas of polygons and circles
More informationMath Precalculus I University of Hawai i at Mānoa Spring
Math 135 - Precalculus I University of Hawai i at Mānoa Spring - 2013 Created for Math 135, Spring 2008 by Lukasz Grabarek and Michael Joyce Send comments and corrections to lukasz@math.hawaii.edu Contents
More information8th Grade Math Definitions
8th Grade Math Definitions Absolute Value: 1. A number s distance from zero. 2. For any x, is defined as follows: x = x, if x < 0; x, if x 0. Acute Angle: An angle whose measure is greater than 0 and less
More informationMA 460 Supplement on Analytic Geometry
M 460 Supplement on nalytic Geometry Donu rapura In the 1600 s Descartes introduced cartesian coordinates which changed the way we now do geometry. This also paved for subsequent developments such as calculus.
More informationMath 1230, Notes 2. Aug. 28, Math 1230, Notes 2 Aug. 28, / 17
Math 1230, Notes 2 Aug. 28, 2014 Math 1230, Notes 2 Aug. 28, 2014 1 / 17 This fills in some material between pages 10 and 11 of notes 1. We first discuss the relation between geometry and the quadratic
More informationDefinitions, Axioms, Postulates, Propositions, and Theorems from Euclidean and Non-Euclidean Geometries by Marvin Jay Greenberg ( )
Definitions, Axioms, Postulates, Propositions, and Theorems from Euclidean and Non-Euclidean Geometries by Marvin Jay Greenberg (2009-03-26) Logic Rule 0 No unstated assumptions may be used in a proof.
More informationTangent Lines Unit 10 Lesson 1 Example 1: Tell how many common tangents the circles have and draw them.
Tangent Lines Unit 10 Lesson 1 EQ: How can you verify that a segment is tangent to a circle? Circle: Center: Radius: Chord: Diameter: Secant: Tangent: Tangent Lines Unit 10 Lesson 1 Example 1: Tell how
More informationTopological Graph Theory Lecture 4: Circle packing representations
Topological Graph Theory Lecture 4: Circle packing representations Notes taken by Andrej Vodopivec Burnaby, 2006 Summary: A circle packing of a plane graph G is a set of circles {C v v V (G)} in R 2 such
More informationFamilies of point-touching squares k-touching
Geombinatorics 12(2003), 167 174 Families of point-touching squares Branko Grünbaum Department of Mathematics, Box 354350 University of Washington Seattle, WA 98195-4350 e-mail: grunbaum@math.washington.edu
More information2. (i) Find the equation of the circle which passes through ( 7, 1) and has centre ( 4, 3).
Circle 1. (i) Find the equation of the circle with centre ( 7, 3) and of radius 10. (ii) Find the centre of the circle 2x 2 + 2y 2 + 6x + 8y 1 = 0 (iii) What is the radius of the circle 3x 2 + 3y 2 + 5x
More informationMath 144 Activity #7 Trigonometric Identities
144 p 1 Math 144 Activity #7 Trigonometric Identities What is a trigonometric identity? Trigonometric identities are equalities that involve trigonometric functions that are true for every single value
More informationROLE OF GEOMETRY IN DIFFERENT DISCIPLINES OF MATHEMATICS
Bulletin of the Marathwada Mathematical Society Vol. 17, No. 2, December 2016, Pages 13 21. ROLE OF GEOMETRY IN DIFFERENT DISCIPLINES OF MATHEMATICS S.R. Joshi 8, Karmayog, Tarak Housing Society, Opp.
More informationCovering the Convex Quadrilaterals of Point Sets
Covering the Convex Quadrilaterals of Point Sets Toshinori Sakai, Jorge Urrutia 2 Research Institute of Educational Development, Tokai University, 2-28-4 Tomigaya, Shibuyaku, Tokyo 5-8677, Japan 2 Instituto
More informationSOLVING INEQUALITIES and 9.1.2
SOLVING INEQUALITIES 9.1.1 and 9.1.2 To solve an inequality in one variable, first change it to an equation and solve. Place the solution, called a boundary point, on a number line. This point separates
More informationCircle Chains Inside a Circular Segment
Forum eometricorum Volume 9 (009) 73 79. FRUM EM ISSN 534-78 ircle hains Inside a ircular Segment iovanni Lucca bstract. We consider a generic circles chain that can be drawn inside a circular segment
More informationDraft Version 1 Mark scheme Further Maths Core Pure (AS/Year 1) Unit Test 1: Complex numbers 1
1 w z k k States or implies that 4 i TBC Uses the definition of argument to write 4 k π tan 1 k 4 Makes an attempt to solve for k, for example 4 + k = k is seen. M1.a Finds k = 6 (4 marks) Pearson Education
More information(c) log 1 4 (d) log 3 3. Use logarithm properties for expanding to rewrite the expression in
AP Calculus AB Summer Assignment for 2017-2018 School Year Mrs. Brennan In order to be prepared for next year and be ready to move on to new work, you must have skills required to do these problems with
More information4.3 TRIGONOMETRY EXTENDED: THE CIRCULAR FUNCTIONS
4.3 TRIGONOMETRY EXTENDED: THE CIRCULAR FUNCTIONS MR. FORTIER 1. Trig Functions of Any Angle We now extend the definitions of the six basic trig functions beyond triangles so that we do not have to restrict
More informationMORE EXERCISES FOR SECTIONS II.1 AND II.2. There are drawings on the next two pages to accompany the starred ( ) exercises.
Math 133 Winter 2013 MORE EXERCISES FOR SECTIONS II.1 AND II.2 There are drawings on the next two pages to accompany the starred ( ) exercises. B1. Let L be a line in R 3, and let x be a point which does
More information( 1 ) Find the co-ordinates of the focus, length of the latus-rectum and equation of the directrix of the parabola x 2 = - 8y.
PROBLEMS 04 - PARABOLA Page 1 ( 1 ) Find the co-ordinates of the focus, length of the latus-rectum and equation of the directrix of the parabola x - 8. [ Ans: ( 0, - ), 8, ] ( ) If the line 3x 4 k 0 is
More informationOn the Distortion of Embedding Perfect Binary Trees into Low-dimensional Euclidean Spaces
On the Distortion of Embedding Perfect Binary Trees into Low-dimensional Euclidean Spaces Dona-Maria Ivanova under the direction of Mr. Zhenkun Li Department of Mathematics Massachusetts Institute of Technology
More informationTORIC WEAK FANO VARIETIES ASSOCIATED TO BUILDING SETS
TORIC WEAK FANO VARIETIES ASSOCIATED TO BUILDING SETS YUSUKE SUYAMA Abstract. We give a necessary and sufficient condition for the nonsingular projective toric variety associated to a building set to be
More informationSyllabus. + + x + n 1 n. + x + 2
1. Special Functions This class will cover problems involving algebraic functions other than polynomials, such as square roots, the floor function, and logarithms. Example Problem: Let n be a positive
More informationHEAT-3 APPLICATION OF DERIVATIVES BY ABHIJIT KUMAR JHA MAX-MARKS-(112(3)+20(5)=436)
HEAT- APPLICATION OF DERIVATIVES BY ABHIJIT KUMAR JHA TIME-(HRS) Select the correct alternative : (Only one is correct) MAX-MARKS-(()+0(5)=6) Q. Suppose & are the point of maimum and the point of minimum
More informationChapter 1. Some Basic Theorems. 1.1 The Pythagorean Theorem
hapter 1 Some asic Theorems 1.1 The ythagorean Theorem Theorem 1.1 (ythagoras). The lengths a b < c of the sides of a right triangle satisfy the relation a 2 + b 2 = c 2. roof. b a a 3 2 b 2 b 4 b a b
More informationQuasiconformal Maps and Circle Packings
Quasiconformal Maps and Circle Packings Brett Leroux June 11, 2018 1 Introduction Recall the statement of the Riemann mapping theorem: Theorem 1 (Riemann Mapping). If R is a simply connected region in
More informationThe Minimal Element Theorem
The Minimal Element Theorem The CMC Dynamics Theorem deals with describing all of the periodic or repeated geometric behavior of a properly embedded CMC surface with bounded second fundamental form in
More informationUNIT 3 CIRCLES AND VOLUME Lesson 1: Introducing Circles Instruction
Prerequisite Skills This lesson requires the use of the following skills: performing operations with fractions understanding slope, both algebraically and graphically understanding the relationship of
More informationUse this space for computations. 1 In trapezoid RSTV below with bases RS and VT, diagonals RT and SV intersect at Q.
Part I Answer all 28 questions in this part. Each correct answer will receive 2 credits. For each statement or question, choose the word or expression that, of those given, best completes the statement
More informationThe CENTRE for EDUCATION in MATHEMATICS and COMPUTING cemc.uwaterloo.ca Euclid Contest. Tuesday, April 12, 2016
The CENTRE for EDUCATION in MATHEMATICS and COMPUTING cemc.uwaterloo.ca 016 Euclid Contest Tuesday, April 1, 016 (in North America and South America) Wednesday, April 13, 016 (outside of North America
More informationR1: Sets A set is a collection of objects sets are written using set brackets each object in onset is called an element or member
Chapter R Review of basic concepts * R1: Sets A set is a collection of objects sets are written using set brackets each object in onset is called an element or member Ex: Write the set of counting numbers
More informationWritten test, 25 problems / 90 minutes
Sponsored by: UGA Math Department and UGA Math Club Written test, 5 problems / 90 minutes October, 06 WITH SOLUTIONS Problem. Let a represent a digit from to 9. Which a gives a! aa + a = 06? Here aa indicates
More informationCBSE Class IX Syllabus. Mathematics Class 9 Syllabus
Mathematics Class 9 Syllabus Course Structure First Term Units Unit Marks I Number System 17 II Algebra 25 III Geometry 37 IV Co-ordinate Geometry 6 V Mensuration 5 Total 90 Second Term Units Unit Marks
More informationDecomposing planar cubic graphs
Decomposing planar cubic graphs Arthur Hoffmann-Ostenhof Tomáš Kaiser Kenta Ozeki Abstract The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree,
More informationMath Section 4.3 Unit Circle Trigonometry
Math 10 - Section 4. Unit Circle Trigonometry An angle is in standard position if its vertex is at the origin and its initial side is along the positive x axis. Positive angles are measured counterclockwise
More informationMatching points with squares
Matching points with squares Bernardo M Ábrego1 Esther M Arkin 2 Silvia Fernández-Merchant 1 Ferran Hurtado 3 Mikio Kano 4 Joseph S B Mitchell 2 Jorge Urrutia 5 May 30, 2008 Abstract Given a class C of
More informationSzemerédi-Trotter theorem and applications
Szemerédi-Trotter theorem and applications M. Rudnev December 6, 2004 The theorem Abstract These notes cover the material of two Applied post-graduate lectures in Bristol, 2004. Szemerédi-Trotter theorem
More information,... We would like to compare this with the sequence y n = 1 n
Example 2.0 Let (x n ) n= be the sequence given by x n = 2, i.e. n 2, 4, 8, 6,.... We would like to compare this with the sequence = n (which we know converges to zero). We claim that 2 n n, n N. Proof.
More information1 (C) 1 e. Q.3 The angle between the tangent lines to the graph of the function f (x) = ( 2t 5)dt at the points where (C) (A) 0 (B) 1/2 (C) 1 (D) 3
[STRAIGHT OBJECTIVE TYPE] Q. Point 'A' lies on the curve y e and has the coordinate (, ) where > 0. Point B has the coordinates (, 0). If 'O' is the origin then the maimum area of the triangle AOB is (A)
More informationLadder-Lottery Realization
Ladder-Lottery Realization Katsuhisa Yamanaka Takashi Horiyama Takeaki Uno Kunihiro Wasa Abstract C B D A C B D A A ladder lottery of a permutation π = (p 1, p 2,..., p n ) is a network with n vertical
More informationThe Densest Packing of 13 Congruent Circles in a Circle
Beiträge zur Algebra und Geometrie Contributions to Algebra and Geometry Volume 44 (003), No., 431-440. The Densest Packing of 13 Congruent Circles in a Circle Ferenc Fodor Feherviz u. 6, IV/13 H-000 Szentendre,
More informationarxiv: v2 [math.gm] 20 Dec 2018
arxiv:1803.01317v2 [math.gm] 20 Dec 2018 New Proofs of Classical Triangle Inequality Norihiro Someyama & Mark Lyndon Adamas Borongan Abstract In this article, we give two kinds of new simple and elementary
More informationTest Codes : MIA (Objective Type) and MIB (Short Answer Type) 2007
Test Codes : MIA (Objective Type) and MIB (Short Answer Type) 007 Questions will be set on the following and related topics. Algebra: Sets, operations on sets. Prime numbers, factorisation of integers
More informationLecture 9: Random sampling, ɛ-approximation and ɛ-nets
CPS296.2 Geometric Optimization February 13, 2007 Lecture 9: Random sampling, -approximation and -nets Lecturer: Pankaj K. Agarwal Scribe: Shashidhara K. Ganjugunte In the next few lectures we will be
More informationCandidates are expected to have available a calculator. Only division by (x + a) or (x a) will be required.
Revision Checklist Unit C2: Core Mathematics 2 Unit description Algebra and functions; coordinate geometry in the (x, y) plane; sequences and series; trigonometry; exponentials and logarithms; differentiation;
More informationExercises for Unit V (Introduction to non Euclidean geometry)
Exercises for Unit V (Introduction to non Euclidean geometry) V.1 : Facts from spherical geometry Ryan : pp. 84 123 [ Note : Hints for the first two exercises are given in math133f07update08.pdf. ] 1.
More informationCAMI Education linked to CAPS: Mathematics
- 1 - The main topics in the Curriculum: NUMBER TOPIC 1 Functions 2 Number patterns, sequences and series 3 Finance, growth and decay 4 Algebra 5 Differential Calculus 6 Probability 7 Euclidian geometry
More informationMinmax Tree Cover in the Euclidean Space
Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 15, no. 3, pp. 345 371 (2011) Minmax Tree Cover in the Euclidean Space Seigo Karakawa 1 Ehab Morsy 1 Hiroshi Nagamochi 1 1 Department
More informationCIRCLES PART - II Theorem: The condition that the straight line lx + my + n = 0 may touch the circle x 2 + y 2 = a 2 is
CIRCLES PART - II Theorem: The equation of the tangent to the circle S = 0 at P(x 1, y 1 ) is S 1 = 0. Theorem: The equation of the normal to the circle S x + y + gx + fy + c = 0 at P(x 1, y 1 ) is (y
More informationSolutions to Problem Sheet for Week 11
THE UNIVERSITY OF SYDNEY SCHOOL OF MATHEMATICS AND STATISTICS Solutions to Problem Sheet for Week MATH9: Differential Calculus (Advanced) Semester, 7 Web Page: sydney.edu.au/science/maths/u/ug/jm/math9/
More informationCHAPTER 7. Connectedness
CHAPTER 7 Connectedness 7.1. Connected topological spaces Definition 7.1. A topological space (X, T X ) is said to be connected if there is no continuous surjection f : X {0, 1} where the two point set
More information9.1 Circles and Parabolas. Copyright Cengage Learning. All rights reserved.
9.1 Circles and Parabolas Copyright Cengage Learning. All rights reserved. What You Should Learn Recognize a conic as the intersection of a plane and a double-napped cone. Write equations of circles in
More informationCircles in Neutral Geometry
Everything we do in this set of notes is Neutral. Definitions: 10.1 - Circles in Neutral Geometry circle is the set of points in a plane which lie at a positive, fixed distance r from some fixed point.
More informationA Decidable Class of Planar Linear Hybrid Systems
A Decidable Class of Planar Linear Hybrid Systems Pavithra Prabhakar, Vladimeros Vladimerou, Mahesh Viswanathan, and Geir E. Dullerud University of Illinois at Urbana-Champaign. Abstract. The paper shows
More information