MOMENTS OF THE LENGTH OF LINE SEGMENTS IN HOMOGENEOUS PLANAR STIT TESSELLATIONS

Size: px
Start display at page:

Download "MOMENTS OF THE LENGTH OF LINE SEGMENTS IN HOMOGENEOUS PLANAR STIT TESSELLATIONS"

Transcription

1 Image Anal Stereol 9;8:69-76 Original Research Paper MOMENTS OF THE LENGTH OF LINE SEGMENTS IN HOMOGENEOUS PLANAR STIT TESSELLATIONS CHRISTOPH THÄLE Department of Mathematics University of Fribourg CH-7 Fribourg Switzerl (Accepted February 9 ABSTRACT Homogeneous planar tessellations stable under iteration (STIT tessellations are considered. Using recent results about the joint distribution of direction length of the typical I- K- J-segment we prove closed formulas for the first second higher moments of the length of these segments given their direction. This especially leads to the mean values variances of these quantities mean value relations as well as general moment relationships. Moreover the relation between these mean values certain conditional mean values ( also higher moments is discussed. The results are also illustrated for several examples. Keywords: conditional distribution iteration (nesting linear segments mean value relation moments rom tessellation stability stochastic geometry. INTRODUCTION Rom tessellations are nowadays used for modeling several structures which arise for example in material sciences biology medical sciences. The most popular models are Poisson line or plane tessellations or Poisson-Voronoi tessellations (see Stoyan et al These models are on the one h side mathematically feasible useful in practice on the other. More complex models can be obtained by applying certain operations on given tessellations. These are for example superposition or iteration. The latter operation leads to a relatively new model for rom tessellations the so-called STIT model. The name STIT refers to their characteristic property: they are stable under iteration. This property will be explained in some detail in the next section. Several geometric quantities were calculated for this model by now. This includes mean value formulas in D 3D length distributions of several linear segments. For the latter Mecke et al. (7 calculated also first second moments but only for the isotropic case. They especially observed that the variance of the length of the so-called typical I- segment is infinite. The same observation was made in Thäle (8 also for two anisotropic examples. It is one aim of this short paper to undertake a deeper study of this phenomenon. We will show that the variance ( also other higher moments of the length of the typical I-segment does not exist for any homogeneous planar STIT tessellation which shows that these linear segments are in some sense very long. In contrast to this result we will be able to show that for the length of the typical K- J-segment all moments exist. Moreover we will derive explicit formulas for all moments of the quantities in question for arbitrary homogeneous planar STIT tessellations. The other aim of the paper is the study of mean value relations. In particular we are interested in mean values for the lengths of the typical I- K- J- segment having a fixed direction their relation to the mean values without the directional conditioning (this could be of some interest for stereological questions. At this point the directional distribution of the tessellation plays an important role we will be able to extend the mean value formulas to the case where the typical I- K- or J-segment is replaced by the typical I- K- or J-segment with a fixed given direction. Moreover the known formulas can be recovered by averaging over all possible directions. This observation is a new feature of STIT tessellations which can only be observed when the anisotropic case is studied this was not investigated until the recent works Mecke (8 Thäle (8. We will furthermore obtain a general moment relationship for the conditional unconditional length distribution of the segments. Our results are demonstrated on several concrete examples in particular we consider the isotropic case confirm again the results of Mecke et al. (7. Also the new rectangular case a case with unequal weights is discussed. PLANAR STIT TESSELLATIONS By a planar tessellation we mean a subdivision of the plane into a locally finite union of convex polygons which intersect only in their boundaries. 69

2 THÄLE C: Moments of length of line segments in homogeneous planar STIT tessellations The family of such tessellations will be denoted by T. Such tessellations can also be described as the union of their cell boundaries. This allows us to consider a tessellation as a closed subset of R. We will follow this path here. Denoting by T the restriction of Matheron s σ-algebra (cf. Stoyan et al. 995 to T we call a rom variable Φ with values in the measurable space [T T] a rom planar tessellation. For x R we denote by T x the translation of R by the vector x. T x induces also an operation on the space of tessellations also denoted by T x by T x Φ = Φ x. We say that a rom tessellation Φ is homogeneous (or stationary if T x Φ has the same distribution as Φ for all x R. The law of a homogeneous tessellation is also called homogeneous. We fix now two rom planar tessellations Φ Ψ with law P Q respectively. The cells of Φ are denoted by C(Φ. We associate now to each cell p C(Φ independently a rom tessellation Ψ p with law Q. Now define a rom tessellation Φ Ψ by Φ Ψ := Φ p C(Φ (p Ψ p the law of which is denoted by P Q. It was shown in Mecke et al. (8b that if Φ is a homogeneous tessellation Q is also homogeneous then Φ Ψ is a homogeneous rom tessellation too. We call a homogeneous rom tessellation Φ stable with respect to iteration (STIT for short if (Φ Φ has the same law as Φ itself (this is equivalent to the definition used for example in Nagel Weiss (5 see Mecke 8. The existence of such tessellations was shown in Nagel Weiss (5 together with a construction in a bounded window for arbitrary dimensions. A global construction of planar STIT tessellations was recently presented in Mecke et al. (8a. Denote by [H H] the measurable space of lines through the origin. By the direction of an arbitrary line g we mean the unique parallel line r(g H. For a line segment s denote the line g containing s by g(s. Then the direction r(s of s can be defined as r(s := r(g(s H. For a planar tessellation Φ we introduce now a directional measure κ as follows: For B H we consider the family Φ B of edges with direction in B. The mean length of these edges per unit area (note that this is a well defined quantity since Φ is homogeneous will be denoted by L A (B. By the relation κ : H [ : B L A (B we get a measure κ on [H H] the directional measure of Φ. If we denote by L A the edge length intensity i.e. the mean total edge length per unit area of Φ we can write κ also as κ = L A ϑ for some probability measure ϑ on [H H] since κ(h = L A. The latter is called directional distribution of Φ. We assume in this paper that κ (or equivalently ϑ is concentrated on more than a single direction. This ensures the existence of of a STIT tessellation with this measure as its directional measure or distribution (cf. Nagel Weiss 5. Having in mind these notions notations we can define the rose of intersections of κ as s κ : H ( : h sin (h h dκ( h. ( Fig.. Realization of an isotropic STIT tessellation. H We summarize now the most important features of planar STIT tessellations Φ with directional measure κ:. The intersection of Φ with an arbitrary line g (not necessarily through the origin is a homogeneous Poisson point process on g. It has intensity s κ (r(g (cf. Nagel Weiss 5.. The interior of the typical cell (this is a cell with Palm shape distribution see Stoyan et al. 995 has the same distribution as the interior of the typical cell of a Poisson line tessellation with the same directional measure (cf. Nagel Weiss The nodes (vertices have T -shape i.e. from each node we have three emanating edges two of them are collinear (cf. Nagel Weiss The cells of Φ are not in a face-to-face position see Fig. (cf. Nagel Weiss 5. More results about STIT tessellations can be found in Nagel Weiss (3 Nagel Weiss (5 Nagel Weiss (6Mecke et al. (7 Mecke et al. (8a Mecke et al. (8b Thäle (8 Thäle (9. 7

3 Image Anal Stereol 9;8:69-76 RECENT RESULTS FOR I- K - AND J-SEGMENTS Mackisack Miles (996 introduced the notion of I- K- J-segments showed that their analysis can be fruitful especially in the case of tessellations which are not face-to-face. A K-segment they called every line segment of the tessellation without any vertex in its relative interior. A J-Segment is a face of a cell an I-segment is the union of connected collinear K-segments which cannot be enlarged by another K-segment. Fig.. Different types of linear segments in a planar tessellation. The investigation of the length distribution of these segments for planar STIT tessellations starts in Mecke et al. (7 for the isotropic case. The authors of this paper were able to calculate explicitly the densities of the length distribution of the segments by integration their mean values second moments (compare with the isotropic example below. In his paper Mecke (8 starts the analysis of the anisotropic case. Here in contrast to the isotropic case one has to take also into account the direction of the segments. Thus he considered the joint distribution of direction length for the case of I-segments. His approach was completed by the consideration of the typical K- J-segment in Thäle (8 (here typical should be understood in the Palm sense where the Palm distribution with respect to the segment midpoints is considered. We like to summarize the results now. Let therefore Φ be a homogeneous planar STIT tessellation with directional measure κ. The rose of intersections of κ is again given by Eq.. The directional distribution of Φ will be denoted by ϑ. We further define the constant ζ κ := sin (h h dκ(hdκ( h. H H The joint distribution of direction length of the typical X-segment X {I J K} is a probability measure on H ( having density d X with respect to the product measure κ L + where L + is the Lebesgue measure restricted to (. Then we have (Theorem in Mecke 8 Corollary 3.4 Corollary 3.6 in Thäle 8: d I : (hx sκ (h t e tx dt ζ κ s κ (h d K : (hx s κ 3ζ (h t e sκ(htx dt κ d J : (hx s κ(h ζ κ x e s κ(ht dt. We consider now the marked point process α X = {y k h k } k N X {IJK} of X-segment midpoints y k where the marks h k H are given by the direction of the X-segment through y k. The typical X-segment in direction h H of the tessellation Φ can now be defined as the line segment containing the origin where Φ is considered under the Palm distribution P h. (For the general theory of Palm distributions for marked point processes see for example Stoyan et al From the formulas above we can conclude the following integral representations for the conditional densities d I h d J h d K h of the length distributions of the typical I- K- J-segment in direction h H since the density of the direction with respect to the directional measure κ of the typical I- K- J- segment is given by s κ ( /ζ κ in each case (cf. Mecke 8; Thäle 8: d I h (x = sκ (h s t e tx dt ( κ(h d K h (x = 3 s κ(h d J h (x = x t e s κ(htx dt (3 e s κ(ht dt. (4 The densities written in this form ( not explicitly without an integral will turn out to be very powerful lead to short proof in the next section. MAIN RESULTS We consider a homogeneous planar STIT tessellation Φ with directional measure κ. Denote the rose of intersections of κ again by s κ fix some direction h H. The typical I- K- J-segment with direction h will be denoted by I h K h J h respectively. The (euclidean length of I h K h J h is denoted by L(I h L(K h L(J h 7

4 THÄLE C: Moments of length of line segments in homogeneous planar STIT tessellations respectively. For k = 3... we define now the k- moments I k (h := E L(I h k K k (h := E L(K h k J k (h := E L(J h k. TYPICAL I-SEGMENTS We start our analysis with the typical I-segment I h in direction h H. First observe that integration by parts yields for t > x k e tx dx = t k Γ(k+ where Γ( is Euler s Gamma-function. We can now use Fubini s theorem formula Eq. to obtain I k (h = x k d I h (xdx [ = x k s κ (h = s κ (h sκ (h sκ (h t [ ] t e tx dt dx ] x k e tx dx dt = sκ(h s κ (h Γ(k+ t t k dt = sκ(h s κ (h Γ(k+ t k+ dt : k = = s κ (h + : k. This means for the length of the typical I-segment in any direction h that only the first moment exists. All higher moments are infinite. TYPICAL K -SEGMENTS We continue with the typical K-segment K h with direction h H. First observe that x k e stx dx = (st k Γ(k+ for all st >. We use now formula Eq. 3 again Fubini s theorem to obtain K k (h = x k d K h (xdx = = 3 s κ(h [ x k 3 s κ(h = 3 s κ(h k Γ(k+ ] t e sκ(htx dt ] [ t x k e sκ(hx dx t t k dt dx = 3s κ (h k Γ(k+ t k+ dt = 3s κ (h k Γ(k+ k 4 k : k (k 4 3s κ (h ln : k =. This shows that in contrast to the previous case all moments of the length of the typical K-segment with direction h exist. We also obtained a closed formula for them. TYPICAL J-SEGMENTS This case is much easier since L(J h is exponentially distributed with parameter s κ (h because of the Poisson typical cells of STIT tessellations (see the key properties in the section on planar STIT tessellations. Thus we obtain J k (h = E L(J h k = Γ(k+ s κ (h k. We see that also in the case of the typical J- segment in direction h all moments exist. We like to remark that the result can also be obtained by a direct calculation using formula Eq. 4. Note that in the above formulas for I k (h K k (h J k (h Γ(k+ could be replaced by k!. MEAN VALUES AND VARIANCES We can especially apply our results to compute the mean values the variances of L(I h L(K h L(J h. We consider therefore a homogeneous planar STIT tessellation with directional measure κ fix a direction h H. Then we obtain dt 7

5 Image Anal Stereol 9;8:69-76 EL(I h = s κ (h VL(I h = + EL(K h = 3s κ (h VL(K h = 3s κ (h EL(J h = s κ (h VL(J h = s κ (h ( ln 3 by using the formula VX = EX (EX for real valued rom variables X. MOMENT RELATIONSHIPS Recall that s κ ( /ζ κ is the density of the direction of the typical I- J- K-segment segment I K J wrt. κ (cf. Mecke 8; Thäle 8 the relation κ(h = L A. We obtain the following mean values for the length of the typical I- J- K-segment: EL(I = E h (EL(I h = L A ζ κ (5 EL(K = E h (EL(K h = L A 3ζ κ (6 EL(J = E h (EL(J h = L A ζ κ (7 where E h denotes the average over all directions h. For example EL(I = s κ (h sκ(h dκ(h = κ(h = L A. ζ κ ζ κ ζ κ H Note that these mean values are the same as the one computed in Nagel Weiss (6 but there the constant ζ = ζ κ /L A was used instead of ζ κ. These formulas imply the following mean value relations: EL(I h = 3EL(K h = EL(J h EL(I = 3EL(K = EL(J. (8 The relations Eq. 8 confirm earlier results from the paper Nagel Weiss (6 which were obtained by quite different methods. Beside these mean value relations we obtain the following relationship of the variances of the typical K- J-segment with direction h H : VL(K h = ( ln VL(J h VL(J h. For the higher moments K k (h J k (h k 3 we get the following general relation for the conditional length distributions: K k (h = 3 k 4 k (k J k(h for any h H. An analogous formula can also be obtained for the unconditioned moments again simply by integration: Note that E L(K k = 3 k 4 k (k E L(J k. lim k 3 k 4 k (k =. Comment: One can conclude from Eq. 8 the fact that the mean number of nodes in the relative interior of the typical I-segment equals / for the typical J-segment. It will be shown in the forthcoming paper (Thäle 9 that for STIT tessellations in R d d the mean number of nodes in the relative interior of the typical I-segment equals d (d / for the typical J-segment (I- J- K-segments of higher dimensional STIT tessellations are now considered for the -skeleton; the definition remains the same. EXAMPLES THE ISOTROPIC CASE We consider in this section homogeneous isotropic planar STIT tessellations with edge length intensity π/. In this case we can calculate the distribution functions F I F K F J of the length of the typical I- K- J-segment respectively using formulas Eqs. 4. We obtain F I (x = x ( (+xe x F K (x = 3x ( +x (+xe x e x F J (x = e x which confirms the results of Mecke et al. (7 especially Theorem 4 therein. For the densities p I (x p K (x p J (x we get p I (x = 4 x 3 ( p K (x = 4 3x 3 p J (x = e x. ( +x+ x ( (+x+ x e x e x ( +x+x e x 73

6 THÄLE C: Moments of length of line segments in homogeneous planar STIT tessellations Fig. 3. Densities p I (black p K (grey p J (dashed in the isotropic case. For the mean values variances we have in this case EL(I = EL(K = 3 EL(J = VL(I = + VL(K = 4 ( ln 3 3 Fig. 4. Realization of a rectangular STIT tessellation. From Eqs. 4 we calculate again the densities p I (x p K (x p J (x of the length distribution of the typical I- K- J-segment with direction in x- or y- axis respectively: p I (x = (8 x 3 (8+4x+x e x p K (x = ( 3x 3 8+4x+x e x ( 8+8x+4x e x p J (x = e x. VL(J = from Eqs. 5 7 which confirms Eq. 8 the earlier results from Nagel Weiss (6. Note that in the isotropic case the length the direction of the typical I- K- J-segment are independent. THE RECTANGULAR CASE We consider a homogeneous planar STIT tessellation Φ with directional distribution : h is the x- or y-axis ϑ(h = : else edge length intensity. The cells of such a tessellation Φ are rectangles with probability one (a similar case was investigated in Mackisack Miles (996 but not for STIT tessellations of course. Fig. 5. Densities p I (black p K (grey p J (dashed in the rectangular case. For the mean values variances we obtain EL(I h = 4 EL(K h = 4 3 EL(Jh = 74

7 Image Anal Stereol 9;8:69-76 VL(I h = + VL(K h = 6 3 VL(J h = 4 ( ln 3 for both directions h (x y. Furthermore we have VL(I D = + VL(K D = 4(6 ln VL(J D = 9. EL(I = (EL(Ix +EL(I y = 4 EL(K = (EL(Kx +EL(K y = 4 3 EL(J = (EL(Jx +EL(J y =. A CASE WITH UNEQUAL WEIGHTS At the end we like to discuss an example with unequal weights. Consider therefore a directional distribution ϑ which has the following weights on three directions : h = x-axis ϑ(h = : h = {x = y} the diagonal 3 : h = y-axis. 6 The first direction is called D the second D the third D 3 for abbreviation. We further assume that the edge length intensity L A is. On can now calculate the 9 different densities p XDi ( for X {IJK} i = 3 but we do not give the explicit formulas here. Instead we concentrate on several mean value relations: For the mean values variances in direction D we have EL(I D = 4 EL(K D = 4 3 EL(JD = VL(I D = + VL(K D = 6 3 VL(J D = 4. ( ln 3 This are the same values as in the rectangular case. For the mean values variances in direction D we get EL(I D = 6 EL(K D = EL(J D = 3 For the mean values variances in direction D 3 we obtain EL(I D 3 = EL(K D 3 = 4 EL(J D 3 = 6 VL(I D 3 = + VL(K D 3 = 6(6 ln VL(J D 3 = 36. Here we see that the mean values in direction D are half of the mean values in direction D 3. This is due to the fact that direction D is twice more likely to occur for an edge than direction D 3. Note that there is a similar relation between the mean values in the other directions. For the mean length of the typical I- K- J- segment I K J we obtain now EL(I = EL(ID + 3 EL(ID + 6 EL(ID 3 = 6 EL(K = EL(KD + 3 EL(KD + 6 EL(KD 3 = EL(J = EL(JD + 3 EL(JD + 6 EL(JD 3 = 3 which confirms the relation in Eq. 8. ACKNOWLEDGMENTS The author would like to thank Joachim Ohser (Darmstadt for providing the beautiful pictures of the STIT tessellations Werner Nagel (Jena for his helpful comments interesting discussions the referees for improving considerably the presentation of the manuscript. This work was supported by the Schweizerischer Nationalfonds grant SNF PP-475/. 75

8 THÄLE C: Moments of length of line segments in homogeneous planar STIT tessellations REFERENCES Mackisack M Miles R (996. Homogeneous rectangular tessellations. Adv Appl Prob 8: Mecke J (8. Joint distribution of direction length of the typical I-segment in a homogeneous rom planar tessellation stable under iteration. Preprint. Mecke J Nagel W Weiss V (7. Length distributions of edges in planar stationary isotropic STIT tessellations. Izvestija Akademii Nauk Armenii Matematika 4:39 6. Mecke J Nagel W Weiss V (8a. A global construction of homogeneous rom planar tessellations that are stable under iteration. Stochastics 8:5 67. Mecke J Nagel W Weiss V (8b. The iteration of rom tessellations a construction of a homogeneous process of cell divisions. Adv Appl Prob 4: Nagel W Weiss V (3. Limits of sequences of stationary planar tessellations. Adv Appl Prob 35:3 38. Nagel W Weiss V (5. Crack STIT tessellations characterization of stationary rom tessellations stable with respect to iteration. Adv Appl Prob 37: Nagel W Weiss V (6. STIT tessellations in the plane. Rendiconti del circulo matematico di Palermo Serie II Suppl. 77: Stoyan D Kendall WS Mecke J (995. Stochastic Geometry its Applications. nd Ed. Chichester: Wiley. Thäle C (8. K- J-segments in homogeneous planar STIT tessellations. Preprint. Thäle C (9. On the length of certain segments in higher dimensional STIT tessellations. Preprint. 76

Length distributions of edges in planar stationary and isotropic STIT tessellations

Length distributions of edges in planar stationary and isotropic STIT tessellations Length distributions of edges in planar stationary and isotropic STIT tessellations Joseph Mecke, Friedrich-Schiller-Universität Jena, Werner Nagel, Friedrich-Schiller-Universität Jena, Viola Weiß, Fachhochschule

More information

A global construction of homogeneous planar STIT tessellations

A global construction of homogeneous planar STIT tessellations A global construction of homogeneous planar STIT tessellations Joseph Mecke, Friedrich-Schiller-Universität Jena, Werner Nagel, Friedrich-Schiller-Universität Jena, Viola Weiß, Fachhochschule Jena Abstract

More information

STIT tessellations a mathematical model. for structures generated by sequential division. Werner Nagel, Jena

STIT tessellations a mathematical model. for structures generated by sequential division. Werner Nagel, Jena STIT tessellations a mathematical model for structures generated by sequential division Werner Nagel, Jena Examples of structures that can be modeled by random tessellations Craquelée on a ceramic surface

More information

Laguerre Tessellations

Laguerre Tessellations Voronoi Tessellation Applications of Voronoi tessellations Laguerre tessellation Voronoi cells vs. Laguerre cells Normal tessellations are LT Claudia Lautensack 1 2 1 University of Applied Sciences, Darmstadt,

More information

We have set up our axioms to deal with the geometry of space but have not yet developed these ideas much. Let s redress that imbalance.

We have set up our axioms to deal with the geometry of space but have not yet developed these ideas much. Let s redress that imbalance. Solid geometry We have set up our axioms to deal with the geometry of space but have not yet developed these ideas much. Let s redress that imbalance. First, note that everything we have proven for the

More information

Planar Graphs. 1 Graphs and maps. 1.1 Planarity and duality

Planar Graphs. 1 Graphs and maps. 1.1 Planarity and duality Planar Graphs In the first half of this book, we consider mostly planar graphs and their geometric representations, mostly in the plane. We start with a survey of basic results on planar graphs. This chapter

More information

7. The Gauss-Bonnet theorem

7. The Gauss-Bonnet theorem 7. The Gauss-Bonnet theorem 7.1 Hyperbolic polygons In Euclidean geometry, an n-sided polygon is a subset of the Euclidean plane bounded by n straight lines. Thus the edges of a Euclidean polygon are formed

More information

A TESSELLATION FOR ALGEBRAIC SURFACES IN CP 3

A TESSELLATION FOR ALGEBRAIC SURFACES IN CP 3 A TESSELLATION FOR ALGEBRAIC SURFACES IN CP 3 ANDREW J. HANSON AND JI-PING SHA In this paper we present a systematic and explicit algorithm for tessellating the algebraic surfaces (real 4-manifolds) F

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

Simplicial Complexes: Second Lecture

Simplicial Complexes: Second Lecture Simplicial Complexes: Second Lecture 4 Nov, 2010 1 Overview Today we have two main goals: Prove that every continuous map between triangulable spaces can be approximated by a simplicial map. To do this,

More information

Points covered an odd number of times by translates

Points covered an odd number of times by translates Points covered an odd number of times by translates Rom Pinchasi August 5, 0 Abstract Let T be a fixed triangle and consider an odd number of translated copies of T in the plane. We show that the set of

More information

Ice-Creams and Wedge Graphs

Ice-Creams and Wedge Graphs Ice-Creams and Wedge Graphs Eyal Ackerman Tsachik Gelander Rom Pinchasi Abstract What is the minimum angle α > such that given any set of α-directional antennas (that is, antennas each of which can communicate

More information

CAT(0)-spaces. Münster, June 22, 2004

CAT(0)-spaces. Münster, June 22, 2004 CAT(0)-spaces Münster, June 22, 2004 CAT(0)-space is a term invented by Gromov. Also, called Hadamard space. Roughly, a space which is nonpositively curved and simply connected. C = Comparison or Cartan

More information

Lecture-12: Closed Sets

Lecture-12: Closed Sets and Its Examples Properties of Lecture-12: Dr. Department of Mathematics Lovely Professional University Punjab, India October 18, 2014 Outline Introduction and Its Examples Properties of 1 Introduction

More information

Lecture 15: The subspace topology, Closed sets

Lecture 15: The subspace topology, Closed sets Lecture 15: The subspace topology, Closed sets 1 The Subspace Topology Definition 1.1. Let (X, T) be a topological space with topology T. subset of X, the collection If Y is a T Y = {Y U U T} is a topology

More information

LINE SEGMENTS WHICH ARE UNIONS OF TESSELLATION EDGES

LINE SEGMENTS WHICH ARE UNIONS OF TESSELLATION EDGES Image Anal Stereol 2018;37:83-98 Original Research Paper doi:10.5566/ias.1621 LINE SEGENTS WHICH ARE UNIONS OF TESSELLATION EDGES RICHARD COWAN,1 AND VIOLA WEISS 2 1 School of athematics and Statistics,

More information

Conjectures concerning the geometry of 2-point Centroidal Voronoi Tessellations

Conjectures concerning the geometry of 2-point Centroidal Voronoi Tessellations Conjectures concerning the geometry of 2-point Centroidal Voronoi Tessellations Emma Twersky May 2017 Abstract This paper is an exploration into centroidal Voronoi tessellations, or CVTs. A centroidal

More information

Reversible Hyperbolic Triangulations

Reversible Hyperbolic Triangulations Reversible Hyperbolic Triangulations Circle Packing and Random Walk Tom Hutchcroft 1 Joint work with O. Angel 1, A. Nachmias 1 and G. Ray 2 1 University of British Columbia 2 University of Cambridge Probability

More information

= f (a, b) + (hf x + kf y ) (a,b) +

= f (a, b) + (hf x + kf y ) (a,b) + Chapter 14 Multiple Integrals 1 Double Integrals, Iterated Integrals, Cross-sections 2 Double Integrals over more general regions, Definition, Evaluation of Double Integrals, Properties of Double Integrals

More information

arxiv: v2 [cs.cg] 24 Jul 2011

arxiv: v2 [cs.cg] 24 Jul 2011 Ice-Creams and Wedge Graphs Eyal Ackerman Tsachik Gelander Rom Pinchasi Abstract arxiv:116.855v2 [cs.cg] 24 Jul 211 What is the minimum angle α > such that given any set of α-directional antennas (that

More information

Vertex cuts and group splittings. Bernhard Krön

Vertex cuts and group splittings. Bernhard Krön Vertex cuts and group splittings XXI Escola de Algebra 2010 Bernhard Krön University of Vienna, Austria joint with Martin J. Dunwoody, Univ. of Southampton, UK Bernhard Krön (Univ. of Vienna) Vertex cuts

More information

Buffon Type Problems in Archimedean Tilings II

Buffon Type Problems in Archimedean Tilings II pplied Mathematical Sciences, Vol. 1, 16, no. 7, 199-16 HIKRI Ltd, www.m-hikari.com http://dx.doi.org/1.1988/ams.16.61 Buffon Type Problems in rchimedean Tilings II Salvatore Vassallo Università attolica

More information

However, this is not always true! For example, this fails if both A and B are closed and unbounded (find an example).

However, this is not always true! For example, this fails if both A and B are closed and unbounded (find an example). 98 CHAPTER 3. PROPERTIES OF CONVEX SETS: A GLIMPSE 3.2 Separation Theorems It seems intuitively rather obvious that if A and B are two nonempty disjoint convex sets in A 2, then there is a line, H, separating

More information

LAUTENSACK ET AL: 3d image analysis of foams using random tessellations

LAUTENSACK ET AL: 3d image analysis of foams using random tessellations LAUTENSACK ET AL: 3d image analysis of foams using random tessellations Claudia Lautensack Fraunhofer Institut Techno- und Wirtschaftsmathematik (ITWM), Gottlieb-Daimler-Str. 49, D-67663 Kaiserslautern

More information

Preferred directions for resolving the non-uniqueness of Delaunay triangulations

Preferred directions for resolving the non-uniqueness of Delaunay triangulations Preferred directions for resolving the non-uniqueness of Delaunay triangulations Christopher Dyken and Michael S. Floater Abstract: This note proposes a simple rule to determine a unique triangulation

More information

Open and Closed Sets

Open and Closed Sets Open and Closed Sets Definition: A subset S of a metric space (X, d) is open if it contains an open ball about each of its points i.e., if x S : ɛ > 0 : B(x, ɛ) S. (1) Theorem: (O1) and X are open sets.

More information

Monotone Paths in Geometric Triangulations

Monotone Paths in Geometric Triangulations Monotone Paths in Geometric Triangulations Adrian Dumitrescu Ritankar Mandal Csaba D. Tóth November 19, 2017 Abstract (I) We prove that the (maximum) number of monotone paths in a geometric triangulation

More information

Stewart Gough platforms with linear singularity surface

Stewart Gough platforms with linear singularity surface Stewart Gough platforms with linear singularity surface Georg Nawratil Institute of Discrete Mathematics and Geometry Differential Geometry and Geometric Structures 19th IEEE International Workshop on

More information

Manifolds. Chapter X. 44. Locally Euclidean Spaces

Manifolds. Chapter X. 44. Locally Euclidean Spaces Chapter X Manifolds 44. Locally Euclidean Spaces 44 1. Definition of Locally Euclidean Space Let n be a non-negative integer. A topological space X is called a locally Euclidean space of dimension n if

More information

Topology 550A Homework 3, Week 3 (Corrections: February 22, 2012)

Topology 550A Homework 3, Week 3 (Corrections: February 22, 2012) Topology 550A Homework 3, Week 3 (Corrections: February 22, 2012) Michael Tagare De Guzman January 31, 2012 4A. The Sorgenfrey Line The following material concerns the Sorgenfrey line, E, introduced in

More information

Restricted-Orientation Convexity in Higher-Dimensional Spaces

Restricted-Orientation Convexity in Higher-Dimensional Spaces Restricted-Orientation Convexity in Higher-Dimensional Spaces ABSTRACT Eugene Fink Derick Wood University of Waterloo, Waterloo, Ont, Canada N2L3G1 {efink, dwood}@violetwaterlooedu A restricted-oriented

More information

Chapter 8. Voronoi Diagrams. 8.1 Post Oce Problem

Chapter 8. Voronoi Diagrams. 8.1 Post Oce Problem Chapter 8 Voronoi Diagrams 8.1 Post Oce Problem Suppose there are n post oces p 1,... p n in a city. Someone who is located at a position q within the city would like to know which post oce is closest

More information

Fitting and Simulation of Models for Telecommunication Access Networks

Fitting and Simulation of Models for Telecommunication Access Networks Fitting and Simulation of Models for Telecommunication Access Networks Frank Fleischer Joint work with C. Gloaguen, H. Schmidt, V. Schmidt University of Ulm Department of Applied Information Processing

More information

Definition 3.1 The partial derivatives of a function f(x, y) defined on an open domain containing (x, y) are denoted by f

Definition 3.1 The partial derivatives of a function f(x, y) defined on an open domain containing (x, y) are denoted by f Chapter 3 Draft October 3, 009 3. Partial Derivatives Overview: Partial derivatives are defined by differentiation in one variable, viewing all others as constant (frozen at some value). The reduction

More information

Basics of Combinatorial Topology

Basics of Combinatorial Topology Chapter 7 Basics of Combinatorial Topology 7.1 Simplicial and Polyhedral Complexes In order to study and manipulate complex shapes it is convenient to discretize these shapes and to view them as the union

More information

Lecture 2 September 3

Lecture 2 September 3 EE 381V: Large Scale Optimization Fall 2012 Lecture 2 September 3 Lecturer: Caramanis & Sanghavi Scribe: Hongbo Si, Qiaoyang Ye 2.1 Overview of the last Lecture The focus of the last lecture was to give

More information

arxiv: v1 [cs.cc] 30 Jun 2017

arxiv: v1 [cs.cc] 30 Jun 2017 On the Complexity of Polytopes in LI( Komei Fuuda May Szedlá July, 018 arxiv:170610114v1 [cscc] 30 Jun 017 Abstract In this paper we consider polytopes given by systems of n inequalities in d variables,

More information

Face Width and Graph Embeddings of face-width 2 and 3

Face Width and Graph Embeddings of face-width 2 and 3 Face Width and Graph Embeddings of face-width 2 and 3 Instructor: Robin Thomas Scribe: Amanda Pascoe 3/12/07 and 3/14/07 1 Representativity Recall the following: Definition 2. Let Σ be a surface, G a graph,

More information

On median graphs and median grid graphs

On median graphs and median grid graphs On median graphs and median grid graphs Sandi Klavžar 1 Department of Mathematics, PEF, University of Maribor, Koroška cesta 160, 2000 Maribor, Slovenia e-mail: sandi.klavzar@uni-lj.si Riste Škrekovski

More information

Tilings of the Euclidean plane

Tilings of the Euclidean plane Tilings of the Euclidean plane Yan Der, Robin, Cécile January 9, 2017 Abstract This document gives a quick overview of a eld of mathematics which lies in the intersection of geometry and algebra : tilings.

More information

Ray shooting from convex ranges

Ray shooting from convex ranges Discrete Applied Mathematics 108 (2001) 259 267 Ray shooting from convex ranges Evangelos Kranakis a, Danny Krizanc b, Anil Maheshwari a;, Jorg-Rudiger Sack a, Jorge Urrutia c a School of Computer Science,

More information

Geometric structures on manifolds

Geometric structures on manifolds CHAPTER 3 Geometric structures on manifolds In this chapter, we give our first examples of hyperbolic manifolds, combining ideas from the previous two chapters. 3.1. Geometric structures 3.1.1. Introductory

More information

POLYHEDRAL GEOMETRY. Convex functions and sets. Mathematical Programming Niels Lauritzen Recall that a subset C R n is convex if

POLYHEDRAL GEOMETRY. Convex functions and sets. Mathematical Programming Niels Lauritzen Recall that a subset C R n is convex if POLYHEDRAL GEOMETRY Mathematical Programming Niels Lauritzen 7.9.2007 Convex functions and sets Recall that a subset C R n is convex if {λx + (1 λ)y 0 λ 1} C for every x, y C and 0 λ 1. A function f :

More information

Triple Integrals in Rectangular Coordinates

Triple Integrals in Rectangular Coordinates Triple Integrals in Rectangular Coordinates P. Sam Johnson April 10, 2017 P. Sam Johnson (NIT Karnataka) Triple Integrals in Rectangular Coordinates April 10, 2017 1 / 28 Overview We use triple integrals

More information

Technische Universität München Zentrum Mathematik

Technische Universität München Zentrum Mathematik Technische Universität München Zentrum Mathematik Prof. Dr. Dr. Jürgen Richter-Gebert, Bernhard Werner Projective Geometry SS 208 https://www-m0.ma.tum.de/bin/view/lehre/ss8/pgss8/webhome Solutions for

More information

arxiv: v1 [math.co] 7 Dec 2018

arxiv: v1 [math.co] 7 Dec 2018 SEQUENTIALLY EMBEDDABLE GRAPHS JACKSON AUTRY AND CHRISTOPHER O NEILL arxiv:1812.02904v1 [math.co] 7 Dec 2018 Abstract. We call a (not necessarily planar) embedding of a graph G in the plane sequential

More information

EXTREME POINTS AND AFFINE EQUIVALENCE

EXTREME POINTS AND AFFINE EQUIVALENCE EXTREME POINTS AND AFFINE EQUIVALENCE The purpose of this note is to use the notions of extreme points and affine transformations which are studied in the file affine-convex.pdf to prove that certain standard

More information

Visibility: Finding the Staircase Kernel in Orthogonal Polygons

Visibility: Finding the Staircase Kernel in Orthogonal Polygons Visibility: Finding the Staircase Kernel in Orthogonal Polygons 8 Visibility: Finding the Staircase Kernel in Orthogonal Polygons Tzvetalin S. Vassilev, Nipissing University, Canada Stefan Pape, Nipissing

More information

The Geometry of Carpentry and Joinery

The Geometry of Carpentry and Joinery The Geometry of Carpentry and Joinery Pat Morin and Jason Morrison School of Computer Science, Carleton University, 115 Colonel By Drive Ottawa, Ontario, CANADA K1S 5B6 Abstract In this paper we propose

More information

THE GROWTH DEGREE OF VERTEX REPLACEMENT RULES

THE GROWTH DEGREE OF VERTEX REPLACEMENT RULES THE GROWTH DEGREE OF VERTEX REPLACEMENT RULES JOSEPH P. PREVITE AND MICHELLE PREVITE 1. Introduction. 2. Vertex Replacement Rules. 3. Marked Graphs Definition 3.1. A marked graph (G, p) is a graph with

More information

Approximate Algorithms for Touring a Sequence of Polygons

Approximate Algorithms for Touring a Sequence of Polygons Approximate Algorithms for Touring a Sequence of Polygons Fajie Li 1 and Reinhard Klette 2 1 Institute for Mathematics and Computing Science, University of Groningen P.O. Box 800, 9700 AV Groningen, The

More information

Chapter 6. Curves and Surfaces. 6.1 Graphs as Surfaces

Chapter 6. Curves and Surfaces. 6.1 Graphs as Surfaces Chapter 6 Curves and Surfaces In Chapter 2 a plane is defined as the zero set of a linear function in R 3. It is expected a surface is the zero set of a differentiable function in R n. To motivate, graphs

More information

Notes on Spherical Geometry

Notes on Spherical Geometry Notes on Spherical Geometry Abhijit Champanerkar College of Staten Island & The Graduate Center, CUNY Spring 2018 1. Vectors and planes in R 3 To review vector, dot and cross products, lines and planes

More information

Pebble Sets in Convex Polygons

Pebble Sets in Convex Polygons 2 1 Pebble Sets in Convex Polygons Kevin Iga, Randall Maddox June 15, 2005 Abstract Lukács and András posed the problem of showing the existence of a set of n 2 points in the interior of a convex n-gon

More information

Technische Universität München Zentrum Mathematik

Technische Universität München Zentrum Mathematik Question 1. Incidence matrix with gaps Technische Universität München Zentrum Mathematik Prof. Dr. Dr. Jürgen Richter-Gebert, Bernhard Werner Projective Geometry SS 2016 www-m10.ma.tum.de/projektivegeometriess16

More information

Background for Surface Integration

Background for Surface Integration Background for urface Integration 1 urface Integrals We have seen in previous work how to define and compute line integrals in R 2. You should remember the basic surface integrals that we will need to

More information

Contour Lines: The Lost World

Contour Lines: The Lost World Contour Lines: The Lost World K. Maes Department of Applied Mathematics, Biometrics and Process Control, Ghent University, Coupure links 653, B-9000 Gent, Belgium Koen.Maes@Ugent.be B. De Baets Department

More information

CAD & Computational Geometry Course plan

CAD & Computational Geometry Course plan Course plan Introduction Segment-Segment intersections Polygon Triangulation Intro to Voronoï Diagrams & Geometric Search Sweeping algorithm for Voronoï Diagrams 1 Voronoi Diagrams Voronoi Diagrams or

More information

4. Definition: topological space, open set, topology, trivial topology, discrete topology.

4. Definition: topological space, open set, topology, trivial topology, discrete topology. Topology Summary Note to the reader. If a statement is marked with [Not proved in the lecture], then the statement was stated but not proved in the lecture. Of course, you don t need to know the proof.

More information

In what follows, we will focus on Voronoi diagrams in Euclidean space. Later, we will generalize to other distance spaces.

In what follows, we will focus on Voronoi diagrams in Euclidean space. Later, we will generalize to other distance spaces. Voronoi Diagrams 4 A city builds a set of post offices, and now needs to determine which houses will be served by which office. It would be wasteful for a postman to go out of their way to make a delivery

More information

Parameterization of triangular meshes

Parameterization of triangular meshes Parameterization of triangular meshes Michael S. Floater November 10, 2009 Triangular meshes are often used to represent surfaces, at least initially, one reason being that meshes are relatively easy to

More information

6.3 Poincare's Theorem

6.3 Poincare's Theorem Figure 6.5: The second cut. for some g 0. 6.3 Poincare's Theorem Theorem 6.3.1 (Poincare). Let D be a polygon diagram drawn in the hyperbolic plane such that the lengths of its edges and the interior angles

More information

On the undecidability of the tiling problem. Jarkko Kari. Mathematics Department, University of Turku, Finland

On the undecidability of the tiling problem. Jarkko Kari. Mathematics Department, University of Turku, Finland On the undecidability of the tiling problem Jarkko Kari Mathematics Department, University of Turku, Finland Consider the following decision problem, the tiling problem: Given a finite set of tiles (say,

More information

Pick s Theorem and Lattice Point Geometry

Pick s Theorem and Lattice Point Geometry Pick s Theorem and Lattice Point Geometry 1 Lattice Polygon Area Calculations Lattice points are points with integer coordinates in the x, y-plane. A lattice line segment is a line segment that has 2 distinct

More information

ALGORITHMS FOR BALL HULLS AND BALL INTERSECTIONS IN NORMED PLANES

ALGORITHMS FOR BALL HULLS AND BALL INTERSECTIONS IN NORMED PLANES ALGORITHMS FOR BALL HULLS AND BALL INTERSECTIONS IN NORMED PLANES Pedro Martín and Horst Martini Abstract. Extending results of Hershberger and Suri for the Euclidean plane, we show that ball hulls and

More information

γ 2 γ 3 γ 1 R 2 (b) a bounded Yin set (a) an unbounded Yin set

γ 2 γ 3 γ 1 R 2 (b) a bounded Yin set (a) an unbounded Yin set γ 1 γ 3 γ γ 3 γ γ 1 R (a) an unbounded Yin set (b) a bounded Yin set Fig..1: Jordan curve representation of a connected Yin set M R. A shaded region represents M and the dashed curves its boundary M that

More information

Assignment 8; Due Friday, March 10

Assignment 8; Due Friday, March 10 Assignment 8; Due Friday, March 10 The previous two exercise sets covered lots of material. We ll end the course with two short assignments. This one asks you to visualize an important family of three

More information

The Farey Tessellation

The Farey Tessellation The Farey Tessellation Seminar: Geometric Structures on manifolds Mareike Pfeil supervised by Dr. Gye-Seon Lee 15.12.2015 Introduction In this paper, we are going to introduce the Farey tessellation. Since

More information

K 4,4 e Has No Finite Planar Cover

K 4,4 e Has No Finite Planar Cover K 4,4 e Has No Finite Planar Cover Petr Hliněný Dept. of Applied Mathematics, Charles University, Malostr. nám. 25, 118 00 Praha 1, Czech republic (E-mail: hlineny@kam.ms.mff.cuni.cz) February 9, 2005

More information

Modal logic of the planar polygons

Modal logic of the planar polygons Modal logic of the planar polygons David Gabelaia TSU Razmadze Mathematical Institute Kristina Gogoladze Ivane Javakhishvili Tbilisi State University Mamuka Jibladze TSU Razmadze Mathematical Institute

More information

Bases of topologies. 1 Motivation

Bases of topologies. 1 Motivation Bases of topologies 1 Motivation In the previous section we saw some examples of topologies. We described each of them by explicitly specifying all of the open sets in each one. This is not be a feasible

More information

Polygonal Areas in Regular and Distorted Lattices

Polygonal Areas in Regular and Distorted Lattices Irish Math. Soc. ulletin 52 (2003), 31 81 31 Polygonal reas in Regular and Distorted Lattices DIMITRIOS KODOKOSTS 1. Distorted Lattices, Long Determinants and Statement of the Main Results Some sixteen

More information

Planar graphs. Chapter 8

Planar graphs. Chapter 8 Chapter 8 Planar graphs Definition 8.1. A graph is called planar if it can be drawn in the plane so that edges intersect only at vertices to which they are incident. Example 8.2. Different representations

More information

Basic Euclidean Geometry

Basic Euclidean Geometry hapter 1 asic Euclidean Geometry This chapter is not intended to be a complete survey of basic Euclidean Geometry, but rather a review for those who have previously taken a geometry course For a definitive

More information

Voronoi Diagrams in the Plane. Chapter 5 of O Rourke text Chapter 7 and 9 of course text

Voronoi Diagrams in the Plane. Chapter 5 of O Rourke text Chapter 7 and 9 of course text Voronoi Diagrams in the Plane Chapter 5 of O Rourke text Chapter 7 and 9 of course text Voronoi Diagrams As important as convex hulls Captures the neighborhood (proximity) information of geometric objects

More information

arxiv: v2 [math.nt] 4 Jun 2014

arxiv: v2 [math.nt] 4 Jun 2014 RATIONAL HYPERBOLIC TRIANGLES AND A QUARTIC MODEL OF ELLIPTIC CURVES NICOLAS BRODY AND JORDAN SCHETTLER arxiv:14060467v2 [mathnt] 4 Jun 2014 Abstract The family of Euclidean triangles having some fixed

More information

A Reduction of Conway s Thrackle Conjecture

A Reduction of Conway s Thrackle Conjecture A Reduction of Conway s Thrackle Conjecture Wei Li, Karen Daniels, and Konstantin Rybnikov Department of Computer Science and Department of Mathematical Sciences University of Massachusetts, Lowell 01854

More information

4. Simplicial Complexes and Simplicial Homology

4. Simplicial Complexes and Simplicial Homology MATH41071/MATH61071 Algebraic topology Autumn Semester 2017 2018 4. Simplicial Complexes and Simplicial Homology Geometric simplicial complexes 4.1 Definition. A finite subset { v 0, v 1,..., v r } R n

More information

Product constructions for transitive decompositions of graphs

Product constructions for transitive decompositions of graphs 116 Product constructions for transitive decompositions of graphs Geoffrey Pearce Abstract A decomposition of a graph is a partition of the edge set, giving a set of subgraphs. A transitive decomposition

More information

Lecture : Topological Space

Lecture : Topological Space Example of Lecture : Dr. Department of Mathematics Lovely Professional University Punjab, India October 18, 2014 Outline Example of 1 2 3 Example of 4 5 6 Example of I Topological spaces and continuous

More information

Lecture notes for Topology MMA100

Lecture notes for Topology MMA100 Lecture notes for Topology MMA100 J A S, S-11 1 Simplicial Complexes 1.1 Affine independence A collection of points v 0, v 1,..., v n in some Euclidean space R N are affinely independent if the (affine

More information

Generation of lattices of points for bivariate interpolation

Generation of lattices of points for bivariate interpolation Generation of lattices of points for bivariate interpolation J. M. Carnicer and M. Gasca Departamento de Matemática Aplicada. University of Zaragoza, Spain Abstract. Principal lattices in the plane are

More information

Surface Mesh Generation

Surface Mesh Generation Surface Mesh Generation J.-F. Remacle Université catholique de Louvain September 22, 2011 0 3D Model For the description of the mesh generation process, let us consider the CAD model of a propeller presented

More information

Simultaneously flippable edges in triangulations

Simultaneously flippable edges in triangulations Simultaneously flippable edges in triangulations Diane L. Souvaine 1, Csaba D. Tóth 2, and Andrew Winslow 1 1 Tufts University, Medford MA 02155, USA, {dls,awinslow}@cs.tufts.edu 2 University of Calgary,

More information

The Space of Closed Subsets of a Convergent Sequence

The Space of Closed Subsets of a Convergent Sequence The Space of Closed Subsets of a Convergent Sequence by Ashley Reiter and Harold Reiter Many topological spaces are simply sets of points(atoms) endowed with a topology Some spaces, however, have elements

More information

On the number of distinct directions of planes determined by n points in R 3

On the number of distinct directions of planes determined by n points in R 3 On the number of distinct directions of planes determined by n points in R 3 Rom Pinchasi August 27, 2007 Abstract We show that any set of n points in R 3, that is not contained in a plane, determines

More information

Distance Trisector Curves in Regular Convex Distance Metrics

Distance Trisector Curves in Regular Convex Distance Metrics Distance Trisector Curves in Regular Convex Distance Metrics Tetsuo sano School of Information Science JIST 1-1 sahidai, Nomi, Ishikawa, 923-1292 Japan t-asano@jaist.ac.jp David Kirkpatrick Department

More information

Simplicial Objects and Homotopy Groups. J. Wu

Simplicial Objects and Homotopy Groups. J. Wu Simplicial Objects and Homotopy Groups J. Wu Department of Mathematics, National University of Singapore, Singapore E-mail address: matwuj@nus.edu.sg URL: www.math.nus.edu.sg/~matwujie Partially supported

More information

Scope and Sequence for the New Jersey Core Curriculum Content Standards

Scope and Sequence for the New Jersey Core Curriculum Content Standards Scope and Sequence for the New Jersey Core Curriculum Content Standards The following chart provides an overview of where within Prentice Hall Course 3 Mathematics each of the Cumulative Progress Indicators

More information

EULER S FORMULA AND THE FIVE COLOR THEOREM

EULER S FORMULA AND THE FIVE COLOR THEOREM EULER S FORMULA AND THE FIVE COLOR THEOREM MIN JAE SONG Abstract. In this paper, we will define the necessary concepts to formulate map coloring problems. Then, we will prove Euler s formula and apply

More information

The Ropelengths of Knots Are Almost Linear in Terms of Their Crossing Numbers

The Ropelengths of Knots Are Almost Linear in Terms of Their Crossing Numbers The Ropelengths of Knots Are Almost Linear in Terms of Their Crossing Numbers Yuanan Diao, Claus Ernst, Attila Por, and Uta Ziegler Abstract. For a knot or link K, let L(K) be the ropelength of K and Cr(K)

More information

Intersection of an Oriented Box and a Cone

Intersection of an Oriented Box and a Cone Intersection of an Oriented Box and a Cone David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International

More information

Convexization in Markov Chain Monte Carlo

Convexization in Markov Chain Monte Carlo in Markov Chain Monte Carlo 1 IBM T. J. Watson Yorktown Heights, NY 2 Department of Aerospace Engineering Technion, Israel August 23, 2011 Problem Statement MCMC processes in general are governed by non

More information

Voronoi Diagram. Xiao-Ming Fu

Voronoi Diagram. Xiao-Ming Fu Voronoi Diagram Xiao-Ming Fu Outlines Introduction Post Office Problem Voronoi Diagram Duality: Delaunay triangulation Centroidal Voronoi tessellations (CVT) Definition Applications Algorithms Outlines

More information

The Medial Axis of the Union of Inner Voronoi Balls in the Plane

The Medial Axis of the Union of Inner Voronoi Balls in the Plane The Medial Axis of the Union of Inner Voronoi Balls in the Plane Joachim Giesen a, Balint Miklos b,, Mark Pauly b a Max-Planck Institut für Informatik, Saarbrücken, Germany b Applied Geometry Group, ETH

More information

1 Introduction and Review

1 Introduction and Review Figure 1: The torus. 1 Introduction and Review 1.1 Group Actions, Orbit Spaces and What Lies in Between Our story begins with the torus, which we will think of initially as the identification space pictured

More information

MOTION OF A LINE SEGMENT WHOSE ENDPOINT PATHS HAVE EQUAL ARC LENGTH. Anton GFRERRER 1 1 University of Technology, Graz, Austria

MOTION OF A LINE SEGMENT WHOSE ENDPOINT PATHS HAVE EQUAL ARC LENGTH. Anton GFRERRER 1 1 University of Technology, Graz, Austria MOTION OF A LINE SEGMENT WHOSE ENDPOINT PATHS HAVE EQUAL ARC LENGTH Anton GFRERRER 1 1 University of Technology, Graz, Austria Abstract. The following geometric problem originating from an engineering

More information

A Singular Example for the Averaged Mean Curvature Flow

A Singular Example for the Averaged Mean Curvature Flow To appear in Experimental Mathematics Preprint Vol. No. () pp. 3 7 February 9, A Singular Example for the Averaged Mean Curvature Flow Uwe F. Mayer Abstract An embedded curve is presented which under numerical

More information

Straight-line Drawability of Embedded Graphs

Straight-line Drawability of Embedded Graphs Straight-line Drawability of Embedded Graphs Hiroshi Nagamochi Department of Applied Mathematics and Physics, Kyoto University, Yoshida Honmachi, Sakyo, Kyoto 606-8501, Japan. nag@amp.i.kyoto-u.ac.jp Abstract:

More information

On-Line Computer Graphics Notes CLIPPING

On-Line Computer Graphics Notes CLIPPING On-Line Computer Graphics Notes CLIPPING Kenneth I. Joy Visualization and Graphics Research Group Department of Computer Science University of California, Davis 1 Overview The primary use of clipping in

More information