The Voronoi diagram of three arbitrary lines in R 3

Size: px
Start display at page:

Download "The Voronoi diagram of three arbitrary lines in R 3"

Transcription

1 The Voronoi diagram of three arbitrary lines in R 3 Hazel Everett Christian Gillot Daniel Lazard Sylvain Lazard Marc Pouget Abstract In this paper we study the Voronoi diagram of lines in R 3. The Voronoi diagram of three lines in general position was studied in [14]. In this paper we complete this work by presenting a complete characterization of the Voronoi diagram of three arbitrary lines in R 3. As in the general case, we prove that the arcs of trisectors are always monotonic in some direction and we show how to separate the connected components and to sort points along each arc of a trisector using only rational linear semi-algebraic tests. These results are important for the robust computation of the Voronoi diagram of polyhedra. LORIA - INRIA Lorraine - University Nancy 2, Firstname.Name@loria.fr LIP6 - INRIA Rocquencourt - University Pierre et Marie Curie, Firstname.Name@lip6.fr

2 1 Introduction The Voronoi diagram of a set of disjoint objects is a decomposition of space into cells, one cell per object, such that the cell associated with an object consists of all points that are closer to that object than to any other object. In this paper, we consider the Voronoi diagram of lines in R 3 under the Euclidean metric. Voronoi diagrams have been the subject of a tremendous amount of research. For points, these diagrams, their complexity and optimal algorithms are well understood and robust efficient implementations exist for computing them in any dimension (see for instance [1, 2, 4, 5, 7, 8, 15, 23, 26]) although some important problems remain and are addressed in recent papers. The same is true for segments and polygons in two dimensions [18]. For lines, segments, and polyhedra in three dimensions much less is known. In particular, determining the combinatorial complexity of the Voronoi diagram of n lines or line segments in R 3 is an outstanding open problem. The best known lower bound is Ω(n 2 ) and the best upper bound is O(n 3+ɛ ) [27]. It is conjectured that the complexity of such diagrams is near-quadratic. In the restricted case of a set of n lines with a fixed number of possible orientations, Koltun and Sharir have shown an upper bound of O(n 2+ɛ ), for any ɛ > 0 [20]. There are few algorithms for computing exactly the Voronoi diagram of linear objects. Most of this work has been done in the context of computing the medial axis of a polyhedron, i.e., the Voronoi diagram of the faces of the polyhedron [9, 21]. Recently, some progress has been made on the related problem of computing arrangements of quadrics (each cell of the Voronoi diagram is a cell of such an arrangement) [3, 19, 22, 24, 25]. Finally, there have been many papers reporting algorithms for computing approximations of the Voronoi diagram (see for instance [11, 13, 16, 28]). In this paper, we address the fundamental problem of understanding the structure of the Voronoi diagram of three lines. A robust and effective implementation of Voronoi diagrams of three-dimensional linear objects requires a complete and thorough treatment of the base cases, that is, the diagrams of three and four lines, points or planes. Indeed, one of the few shortcomings of Culver s algorithm for the exact computation of the medial axis of a polyhedron, which handles many degeneracies, is that it does not handle the case of a singular trisector [9]. We provide here a complete characterization of the Voronoi diagram of three arbitrary lines in R 3. This completes the study of three lines, the case of three lines in general position having been studied in [14]. The Voronoi diagram of three arbitrary lines. The Voronoi diagram of a set of lines S is a subdivision V of R 3 into regions called cells associated with subsets s of S. The cell V (s) consists of the set of points equidistant to the lines of s and strictly closer to those lines than to any other line. The distance between a point p and a line s, d(p, s) is defined as the minimum Euclidean distance between the point and any point on the line. More precisely, V (s) = { p R 3, a s : d(p, a) < min d(p, b) and c s : d(p, a) = d(p, c)} b S\s The Voronoi diagram of pairwise skew lines consists of cells of dimension k determined by 4 k lines, 0 k 3. The cells are not necessarily connected even in the generic case [14] and when the lines intersect the number of connected components, as we shall see, may increase. One way of handling intersecting objects is to subdivide them into nonintersecting pieces; for example, in the case of line segments in 2D, intersecting segments 1

3 are partitioned into points and open segments [17]. Following this approach, we could handle intersecting lines by subdividing them into points, open rays and open segments. Since the bisector of two open segments is typically computed by first computing the bisector of their supporting lines, this approach also requires understanding the nature of the cells in the case of intersecting lines. Main results. Our main results are summarized in the following theorems which describe the cells of dimension one and two of the Voronoi diagram of three lines. Theorem 1 The trisector of three lines is (i) a non-singular quartic if the three lines are pairwise skew but not all parallel to a common plane nor on the surface of a hyperboloid of revolution, (ii) a cubic and a line if the three lines are pairwise skew and lie on the surface of a hyperboloid of revolution, (iii) a nodal quartic if the three lines are pairwise skew and are all parallel to a common plane, (iv) one or two parabolas or hyperbolas if there is exactly one pair of coplanar lines, (v) between 0 and 4 lines if there are two pairs of coplanar lines. In all cases, each branch of the trisector is monotonic in some direction. 1 The following theorem summarizes the geometry of the cells of dimension two. We actually provide a much more precise description of the 2D cells; see Propositions 12, 20, 24, 26, and Theorem 2 A cell of dimension two of a Voronoi diagram of three lines consists of up to four connected components of hyperbolic paraboloids or planes. This characterization yields some fundamental properties of the Voronoi diagram of three lines which are likely to be critical for the analysis of the complexity and the development of efficient algorithms for computing Voronoi diagrams and medial axis of lines or polyhedra. In particular, we obtain the following: Theorem 3 There is a rational linear semi-algebraic test for (i) given a point on a 2D cell, deciding on which of the connected components of the cell it lies, (ii) given a point on the trisector, deciding on which of the branches of the trisector it lies, (iii) ordering points on each branch of the trisector, knowing that they lie on the trisector. While the proofs primarily use basic notions from geometry and algebra, such as the classification of conics [10], it also relies on two recent results, the classification of quadrics [12] by Dupont et al., and a characterization of the common tangents to spheres [6] by Borcea et al. The rest of the paper is organized as follows. The next section presents notation and some preliminary lemmas. We then prove our main results about trisectors and cells of dimension two, case by case. Section 4 discusses Theorem 3. 2 Preliminaries Let,, and be three lines in R 3 and let (X, Y, Z) denote a Cartesian coordinate system. Without loss of generality, we assume that, whenever there are two skew lines 1 See Table 1 and Figure 8 in the Appendix for a slightly finer classification of cases (iv) and (v). 2 See also Table 2 in the Appendix for more details. 2

4 amongst the three lines, that the lines and are parallel to the XY -plane, pass through (0, 0, 1) and (0, 0, 1) respectively, and have directions that are symmetric with respect to the XZ-plane. More precisely, we assume that line is defined by point p 1 = (0, 0, 1) and vector v 1 = (1, a, 0), and line by point p 2 = (0, 0, 1) and vector v 2 = (1, a, 0), a R. See Figure 1(a). We denote by H i,j the bisector of lines l i and l j. It is well-known, see for instance [20], that the bisector of two pairwise skew lines is a right hyperbolic paraboloid, that is, has equation of the form Z = γ X Y, γ R, in some coordinate system. Recall that our objective is to characterize the Voronoi diagram of three lines in R 3. We will often, however, for convenience, consider our lines in projective space. We say that two lines intersect if they intersect in P 3 (R) i.e. they are coplanar in R 3, or equivalently, intersect or are parallel in R 3. We will make use of the following lemma which provides a geometric characterization of three lines whose trisector contains a line. Lemma 4 If the trisector contains a line then either the three lines are pairwise skew and lie on a hyperboloid of one sheet of revolution or one of the lines intersects the other two in P 3 (R). Proof. Let, and be three lines whose trisector includes a line l. Any point p on l is equidistant to, and so p is the center of a sphere that is tangent to all of, and. Consider three distinct such points on l and the three corresponding spheres. If these spheres have a common intersection, then this common intersection is a circle (possibly reduced to a point) and all lines tangent to the three spheres lie in the plane of this circle, and thus all three lines are coplanar and pairwise intersect in P 3 (R). Otherwise, the set of lines tangent to the three spheres are the ruling(s) of a single quadric of revolution with symmetry axis the line through their centers [6, Lemma 7]. This quadric is a hyperboloid of one sheet, a cone or a cylinder. Now three lines lying on a cone or a cylinder pairwise intersect in P 3 (R). Finally, if the three lines lie in the same ruling of a hyperboloid of one sheet of revolution then they are pairwise skew. Otherwise, one of the lines lies in one ruling and intersects the two lines lying in the other ruling. 3 Trisectors and cells of dimension two In this section we present the proof of Theorems 1 and 2 which describe the cells of dimension one and two of the Voronoi diagram of three arbitrary lines. 3.1 Three pairwise skew lines not all parallel to a common plane The results in the case of lines in general position can be found in [14]. We reproduce them here for completeness. See Figure 1. Proposition 5 ([14]) The topology of the Voronoi diagram of three pairwise skew lines that are not all parallel to a common plane is invariant. The trisector consists of four infinite branches of either a non-singular quartic or of a cubic and a line that do not intersect in P 3 (R). Each cell of dimension two consists of two connected components on a hyperbolic paraboloid that are bounded, respectively, by three and one of the branches of the trisector. Proposition 6 ([14]) The trisector of three pairwise skew lines that are not all parallel to a common plane consists of a cubic and a line if and only if the hyperboloid of one sheet containing the three skew lines is of revolution. 3

5 Z : y = ax z = 1 Y X O l2 : y = ax z = 1 Y X (a) (b) (c) Figure 1: (a) The standard configuration of two skew lines. (a) The trisector of three skew lines is a non-singular quartic. (b) Orthogonal projection of a 2D cell on a plane P with coordinate system (X, Y ); the plane s normal is parallel to the common perpendicular of and and the X and Y -axes are parallel to the two bisector lines (in P) of the projection of and on P. The 2D cell is bounded by four branches of the trisector. Z v 3 = (1, β, 0) Y X p 3 = (0, y, z) O : : y = ax z = 1 y = ax z = 1 (a) (b) (c) Figure 2: (a) Three pairwise skew lines all parallel to the same plane. (b) The trisector, which is a nodal quartic, is the intersection of hyperbolic paraboloids, or, equivalently, (c) the intersection of a hyperbolic paraboloid and a hyperbolic cylinder : H 1,2 H 1,3 H 1,2 Monotonicity Property Given three pairwise skew lines that are not all parallel to a common plane, there is a direction in which all four branches of the trisector are monotonic. 3.2 Three pairwise skew lines all parallel to a common plane Refer to Figure 2. In this section we prove the following proposition. Proposition 7 The trisector of three pairwise skew lines all parallel to the same plane is a nodal quartic whose singularity is at infinity. It consists of two branches that project, in the direction orthogonal to the plane to which the lines are parallel, onto a rectangular hyperbola. Let,, and be three pairwise skew lines all parallel to the same plane with and as in Figure 1(a). Moreover, line is parallel to the plane z = 0, and we also assume that is not parallel to the Y -axis, by exchanging the role of X and Y if necessary. In particular, line is defined by point p 3 = (0, y, z) and vector v 3 = (1, β, 0), y, z, β R, z ±1. Finally, we have that a 0 and β ±a, since no two lines are parallel. See Figure 2(a). 4

6 Lemma 8 The projection of the trisector in a plane parallel to the lines is a rectangular hyperbola. Proof. The trisector is given by the intersection of the bisectors H 1,2 and H 1,3, or equivalently, as the intersection of H 1,2 H 1,3 and, say, H 1,2. See Figure 2. Both of H 1,2 and H 1,3 are rectangular hyperbolic paraboloids and can be written in the form Z = f(x, Y ). This implies that H 1,2 H 1,3, is a degree 2 equation in X and Y, H 1,2 H 1,3 : (a 2 β 2 )X 2 (a 2 β 2 )Y 2 2βy(1 + a 2 )X +2y(1 + a 2 )Y + 2((1 + a 2 )β az(1 + β 2 ))XY (1 + a 2 )((z 2 1)(1 + β 2 ) + y 2 ) = 0, that is, a cylinder, whose axis is the Z-axis and whose projection onto the XY -plane is a conic. Any curve traced on the surface of this cylinder, and in particular, the trisector, projects onto this conic. By the standard classification of conics [10], the conic is a hyperbola or a pair of lines if the determinant, K, of the upper-left 2 x 2 matrix of the coefficient matrix 3 of the conic is negative. This is the case since the coefficients of the X 2 and Y 2 terms have opposite signs and are non-zero since a ±β. By Lemma 4, the conic is not a pair of lines, hence it is a hyperbola. Furthermore, the coefficients of the X 2 and Y 2 terms are equal and opposite which gives that the hyperbola is rectangular. Lemma 9 The trisector is a nodal quartic. Proof. We use the following result of Dupont et al. [12] : the intersection of two quadrics Q and R is, in P 3 (R), either a nodal quartic or one or two conics if the determinant of the characteristic polynomial of the pencil of the quadrics Q + λr, λ R, has one double real root and two simple complex roots. For the quadrics H 1,2 and H 1,3 we get that this determinant is : D = 16(1 + a 2 ) 3 ((1 + β 2 )(a + β) 2 λ 2 4a(a + β)(aβ + 1)λ + 4a 2 (1 + a 2 ) ) ( (1 + β 2 )(1 + c)λ + 2a(a 2 + 1) ) 2. Consider the polynomial of degree 2 in λ given by the second term. Its discriminant is 16( β + a) 2 (β + a) 2 a 2. Recall that a ±β and so this discriminant is strictly negative yielding two complex roots. The third term of D gives a double real root. Now suppose that the trisector is one or two conics. Since the trisector projects to a hyperbola, it contains at least one conic that is a hyperbola and thus intersects the plane at infinity in at least 2 points. We show now that the trisector intersects the plane at infinity in a single point, hence it is a nodal quartic. To compute the intersection of the trisector with the plane at infinity we intersect each homogenized bisector H 1,2 and H 1,3 with the plane w = 0. This gives two curves in the plane w = 0 whose intersection are the points we are looking for. In other words, we are looking for the solutions to the following system : 0 = axy 0 = (a 2 β 2 )X 2 (a 2 β 2 )Y 2 + 2(β 2 + β 2 a + a 2 β + a)xy 0 = w 3 The coefficient matrix is the hessian of the trivariate quadratic form associated to the homogenized equation of the conic 5

7 The first equation implies that X or Y is 0. Substituting Y = 0 (resp. X = 0) into the second equation gives (a 2 β 2 )X 2 = 0 (resp. (a 2 β 2 )Y 2 = 0). Now since a ±β, this implies that Y = 0 (resp. X = 0). The solution to the system then is the single point (0, 0, z, 0) = (0, 0, 1, 0). Lemma 10 The trisector has a singular point at infinity and consists of two branches. Proof. The trisector is a nodal quartic and thus has one singular point. We argue that the singular point is at infinity because all points on the trisector in R 3 are regular. Recall that a point on a curve that is defined as the intersection of two surfaces is regular if the two tangent planes to those surfaces at that point exist and are distinct. Any point p in R 3 on the trisector is at the intersection of the hyperbolic cylinder H 1,2 H 1,3 and, a right hyperbolic paraboloid, say, H 1,2. The plane tangent to the hyperbolic cylinder at p exists and is vertical, and the plane tangent to the right hyperbolic paraboloid at p exists and is not vertical. The two tangent planes exist and are distinct and hence the point on the curve is regular. The trisector lies on a right hyperbolic paraboloid of equation Z = axy. The projection between the the hyperbolic paraboloid and the plane Z = 0 is a bijection. Therefore any point on the hyperbola maps to a unique point on the hyperbolic paraboloid. So there are exactly two branches. Lemma 11 Each branch of the trisector is monotonic with respect to X or Y. Proof. By Lemma 8, the trisector projects, in the XY -plane, to a rectangular hyperbola. Each branch of the hyperbola is monotonic in either the X or the Y direction since, if it is not monotonic in some direction, then it is monotonic in the orthogonal direction. Since the projection between H 1,2 and the plane Z = 0 is a bijection, and since the trisector lies on H 1,2, the two branches of the trisector are also monotonic with respect to X or Y. The cells of dimension two are described in the following proposition. Proposition 12 Let, and be three pairwise skew lines lying all parallel to the same plane with lying between and. The cells of dimension two consist of up to two connected components of a hyperbolic paraboloid that are bounded by either one or two branches of the trisector. In particular, the cells V 1,2 and V 1,3 consist of one connected component bounded by two branches of the trisector and the cell V 2,3 consists of two connected components each bound by one branch of the trisector. Sketch of proof. The origin is on V 1,2 because it is the midpoint of the common perpendicular of and and the distance to is at least the distance to the plane supporting it. The result follows by showing that the origin projected on to the XY -plane is in between the branches of the hyperbola. Similarly for V 1,3 and V 2, One pair of coplanar lines We treat here the case in which there are exactly one pair of coplanar lines. Here the trisector is given by the intersection of a right hyperbolic paraboloid and one or two planes and consists of one or two conics. We divide this case into three sub-cases depending on whether the pair of coplanar lines is parallel or not and, if not, whether the third line intersects or is parallel to that plane. Intuitively, given a pair of coplanar lines, when the third line becomes parallel to this plane, each of the hyperbola degenerates into a parabola and when the two coplanar lines become parallel, one of their two bisecting planes goes to infinity and one of the conics of the trisector also goes to infinity. We prove the following: 6

8 Z Y X O y = ax : z = 1 p 3 = (x, ax, 1) v 3 = (α, β, 1) : y = ax z = 1 (a) (b) Figure 3: Two intersecting lines with the third one skew and not in a parallel plane. The trisector is the intersection of a right hyperbolic paraboloid and a pair of planes; it consists of two hyperbola. Proposition 13 Let, and be three lines such that exactly two of them, say and, are coplanar. Their trisector consists of one conic if and are parallel and two conics otherwise. The conics are parabolas if is parallel to the plane of and and hyperbolas otherwise. We will make use of the following lemma that is easily obtained and whose proof, which relies primarily on the classification of conics [10], we omit. Lemma 14 The intersection of a right hyperbolic paraboloid and a plane is (i) a parabola or a line if the plane is parallel to the axis of the hyperbolic paraboloid and (ii) a hyperbola or a pair of intersecting lines otherwise. Due to lack of space, we present only the case when the trisector is a pair of hyperbola. See the Appendix for the remaining cases. Two lines intersect in R 3 and the third is skew but not in a parallel plane We prove here that, in this case, the trisector consists of two hyperbola. See Figure 3. We also prove several other properties which will be useful for characterizing the bisectors and performing the basic linear tests referred to in the introduction. Let and be a pair of intersecting lines and a line that is skew with respect to both of them and such that the three lines are not all parallel to the same plane. More precisely, assume that and are as in Figure 1(a). Since intersects and is not horizontal, then line may be defined by point p 3 = (x, ax, 1) and vector v 3 = (α, β, 1), x R. See Figure 3(a). Lemma 15 The trisector consists of two hyperbolas, one in each of the planes of H 1,3. Proof. The bisector H 1,2 is a right hyperbolic paraboloid with vertical axis. The planes of H 1,3 are not vertical. By Lemma 14 the intersection of H 1,2 with each of the planes of H 1,3 is either a hyperbola or a line. It cannot be a line by Lemma 4. Lemma 16 The projection of the trisector in the XY -plane is a pair of rectangular hyperbolas whose asymptotes are parallel to the X and Y axes and are all distinct. Proof. The bisector H 1,2 is a right hyperbolic paraboloid with vertical axis. The planes of H 1,3 are not vertical, and so the projection of the trisector in the XY -plane is a pair of hyperbola. See Figure 4. Consider the equation of the trisector projected into the XY plane (a degree four equation). We will use the well-known fact that a plane curve admits a vertical asymptote when the coefficient of the leading monomial in y, which is a polynomial in x, is zero. We 7

9 (a) x = 1 (b) x = 1 Figure 4: Projections of the trisector and bisector corresponding to the two canonical triplets. obtain that the projected trisector has exactly two distinct vertical asymptotes since this polynomial in x is quadratic with strictly positive discriminant, 4a 4 (1 + α 2 + β 2 )(1 + a 2 ), since a 0. Similarly for the vertical asymptotes. Since a hyperbola does not have two asymptotes in the same direction, each hyperbola admits a vertical and a horizontal asymptote and is rectangular. The next lemma follows easily from the properties of a rectangular hyperbola. Lemma 17 Each branch of the trisector is monotonic with respect to X and Y. The next lemma will be useful to further describe how the two hyperbola intersect in projection. Lemma 18 The set of triplets of lines consists of at most two connected components. Proof. Consider three lines as in Figure 3(a). We argue that any triplet of lines in this setting can be moved to one of two canonical triplets of lines in which is vertical (v 3 = (0, 0, 1)) and intersects the X-axis at either 1 or 1, and a = 1. Line intersects in the plane z = 1 at point p 3 and the plane z = 1 at a point, say p 4. Line can be modified continuously by moving point p 4 until it reaches either (1, a, 1) or ( 1, a, 1) and this without ever crossing. Now, if p 4 = (1, a, 1) (resp. p 4 = ( 1, a, 1)) then p 3 can be moved to (1, a, 1) (resp. ( 1, a, 1)) without intersecting. Finally, we can continuously deform the triplet of lines to obtain a = 1. To conclude notice that during the above deformation, never crosses. Lemma 19 When projected onto the XY -plane, the projected hyperbolas lie in asymmetric pairs of opposite quadrants and one branch of one hyperbola intersects both branches of the other. Proof. This follows by looking at the projections (see Figure 4) of the trisector of the canonical triplets of Lemma 18 and by noticing that by Lemma 16 no deformation causes the asymptotes to switch. The two dimensional cells are described in the following proposition. Proposition 20 Let, and be three lines such that and intersect in R 3 and is skew with respect to them and not in a parallel plane. Then (i) V 1,2 and V 2,3 consist of three connected components of a hyperbolic paraboloid one of which is bounded by four arcs of the trisector and the other two are each bounded by two arcs of the trisector having the same asymptotic direction (see Figure 4), and (ii) V 1,3 consists of two connected components of two planes. In one of the planes, the cell consists of one component bounded by two branches of the trisector and in the other plane the cell consists of two components each bounded by one branch of the trisector (see Figure 5(a)). 8

10 (a) (b) Figure 5: (a) The 2D cell of and. (b) Impossible configuration for this 2D cell. Sketch of proof. For (i) the result follows from looking at the projections (see Figure 4) of the trisector for the two canonical triplets of lines of Lemma 18 and noticing that, in both instances, the origin is in V 1,2 and its projection lies in the cell bounded by four branches of the trisector, and arguing that, by continuity, the topology is invariant. Similarly for V 2,3. For (ii), each plane of the bisector contains one hyperbola and we can show that the 2D cell consists of the region between the branches on one plane and the region outside in the other. There are only two possible configurations (by Lemma 19) which are shown in Figure 5. That the 2D cell has two connected components, that is, corresponds to Figure 5(a), can be shown by computing the midpoint of the intersection points of the two hyperbolas and showing that this point is closer to and than to. 3.4 Two pairs of coplanar lines In this case the trisector is given by the intersection of planes and consists of up to four lines. Here again we classify the cases depending on whether the lines intersect or are parallel in R 3. Proposition 21 Their trisector of three lines, at least two pairs of which are coplanar, consists of (i) the empty set, if the three lines are parallel and coplanar, (ii) one line, if either the three lines are all coplanar and concurrent in R 3 or, the three lines are parallel and not all coplanar, (iii) two intersecting lines, if exactly two pairs are coplanar, one pair parallel and the other intersecting; or two parallel lines if the three lines are coplanar, two lines are parallel and the third one intersects them, (iv) four lines, otherwise. Due to space limitations we do not provide a proof of this proposition nor do we describe the two-dimensional cells, all of which are elementary, the bisectors being planes. 4. We mention here just one of the subcases of (iv) since it yields the maximum number of connected components for a 2D cell. Lemma 22 Let, and be three concurrent lines in three distinct planes. The cells of dimension two consist of four connected components of a pair of planes. Proof. Say that, and intersect at the origin. The trisector consists of 4 lines. Consider one of the bisecting planes of and. On this plane lies two of the lines of the trisector which divides the plane into four components, two of which will be in the 2D cell 4 See Table 2 in the Appendix for more details. 9

11 V 1,3. The same is true of the other bisecting plane. To see that these four components are disconnected notice that the line L that is the intersection of the two bisecting planes (of and ) is not in the 2D cell. To see this consider a sphere whose center p is on L and that is tangent to the plane containing lines and (at the origin). The line which goes through the origin and doesn t lie in the plane of and properly intersects this sphere. Thus p is closer to than to and. Hence L is not in the 2D cell V 1,3 and the four components are disconnected. (Notice that their closure is connected at the origin.) Similarly for V 1,2 and V 2,3. 4 Algorithms To prove Theorem 3 we need to demonstrate, in all cases, rational separating lines and planes for branches of the trisector and the components of the two dimensional cells. The case of three pairwise skew lines not all parallel to the same plane is treated in [14]. Otherwise, this is largely elementary and follows from the monotonicity of the trisectors and the properties of their projections. We discuss here briefly the case when two lines intersect and the third is skew but not in a parallel plane, which requires some additional argument. Refer to Figure 4. We first show how to separate the component of the 2D cell bounded by four branches of trisector from the two components bounded by two branches of the trisector. First notice that when projected onto the XY -plane these components are separated by the line through the two points of intersection of the two projected hyperbola. The line in 3D through the corresponding points in 3D is the line L of intersection between the 2 planes containing the hyperbola, that is, the 2 bisecting planes of the intersecting lines and. Line L is the normal to and and is thus rational and its projection onto the XY -plane is rational. To separate the two components bounded by two branches of the trisector we take a line that separates the two branches of the (correct) hyperbola. The line L intersects the hyperbolic parabola in two points (the intersection points of the two hyperbola) which are algebraic conjugates. Hence the midpoint m of the two intersection points is rational so the line orthogonal to L in the XY plane through m is rational and separates the components. References [1] F. Aurenhammer. Voronoi diagrams a survey of a fundamental geometric data structure. ACM Computing Surveys, 23(3): , [2] F. Aurenhammer and R. Klein. Voronoi diagrams. In J. R. Sack and J. Urrutia, editors, Handbook of computational geometry, chapter 5, pages Elsevier Publishing House, December [3] E. Berberich, M. Hemmer, L. Kettner, E. Schömer, and N. Wolpert. An exact, complete and efficient implementation for computing planar maps of quadric intersection curves. In Proceedings of the 21st ACM Annual Symposium on Computational Geometry (SoCG 05), pages , [4] J.-D. Boissonnat, O. Devillers, S. Pion, M. Teillaud, and M. Yvinec. Triangulations in CGAL. Computational Geometry: Theory and Applications, 22:5 19,

12 [5] J.-D. Boissonnat, O. Devillers, R. Schott, M. Teillaud, and M. Yvinec. Applications of random sampling to on-line algorithms in computational geometry. Discrete and Computational Geometry, 8:51 71, [6] C. Borcea, X. Goaoc, S. Lazard, and S. Petitjean. Common tangents to spheres in R 3. Discrete and Computational Geometry, 35(2): , [7] T. M. Chan, J. Snoeyink, and C. K. Yap. Primal dividing and dual pruning: Outputsensitive construction of four dimensional polytopes and three-dimensional diagram Voronoi diagrams. Discrete and Computational Geometry, 18: , [8] K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, II. Discrete and Computational Geometry, 4: , [9] T. Culver. Computing the Medial Axis of a Polyhedron Reliably and Efficiently. PhD thesis, University of North Carolina at Chapel Hill, [10] C. Delode. Gomtrie affine et euclidienne. Dunod Universit, France, [11] T. K. Dey and W. Zhao. Approximate medial axis as a voronoi subcomplex. In SMA 02: Proceedings of the seventh ACM symposium on Solid modeling and applications, pages , New York, NY, USA, ACM Press. [12] L. Dupont, D. Lazard, S. Lazard, and S. Petitjean. Near-optimal parameterization of the intersection of quadrics: II. A classification of pencils. Journal of Symbolic Computation, In press (24 pages) [13] M. Etzion and A. Rappoport. Computing Voronoi skeletons of a 3-d polyhedron by space subdivision. Computational Geometry: Theory and Applications, 21(3):87 120, [14] H. Everett, D. Lazard, S. Lazard, and M. S. E. Din. The Voronoi diagram of three lines in R 3. In Proceedings of the 23rd ACM Annual Symposium on Computational Geometry (SoCG 07), pages , S. Korea, [15] S. Fortune. Voronoi diagrams and delaunay triangulations. In Handbook of discrete and computational geometry, pages CRC Press, Inc., Boca Raton, FL, USA, [16] K. Hoff, T. Culver, J. Keyser, M. Lin, and D. Manocha. Fast computation of generalized Voronoi diagrams using graphics hardware. Computer Graphics, 33(Annual Conference Series): , Proceedings of ACM SIGGRAPH [17] M.. Karavelas. A robust and efficient implementation for the segment voronoi diagram. In Proc. Internat. Symp. on Voronoi diagrams in Science and Engineering, pages 51 62, [18] M. I. Karavelas. A robust and efficient implementation for the segment Voronoi diagram. In International Symposium on Voronoi Diagrams in Science and Engineering, pages 51 62, [19] J. Keyser, S. Krishnan, and D. Manocha. Efficient and accurate B-Rep generation of low degree sculptured solids using exact arithmetic: I Representations, II Computation. Computer Aided Geometric Design, 16(9): , ,

13 [20] V. Koltun and M. Sharir. Three dimensional euclidean Voronoi diagrams of lines with a fixed number of orientations. SIAM Journal on Computing, 32(3): , [21] V. J. Milenkovic. Robust construction of the Voronoi diagram of a polyhedron. In Proceedings of the 5th Canadian Conference on Computational Geometry (CCCG 93), pages , [22] B. Mourrain, J.-P. Técourt, and M. Teillaud. On the computation of an arrangement of quadrics in 3D. Computational Geometry: Theory and Applications, 30(2): , Special issue, 19th European Workshop on Computational Geometry. [23] A. Okabe, B. Boots, K. Sugihara, and S. N. Chiu. Spatial Tessellations - Concepts and Applications of Voronoi Diagrams. John Wiley, 2nd edition, [24] E. Schömer and N. Wolpert. An exact and efficient approach for computing a cell in an arrangement of quadrics. Computational Geometry: Theory and Applications, 33(1-2):65 97, Special Issue on Robust Geometric Algorithms and their Implementations. [25] O. Schwarzkopf and M. Sharir. Vertical decomposition of a single cell in a threedimensional arrangement of surfaces and its applications. Discrete and Computational Geometry, 18: , [26] R. Seidel. A convex hull algorithm optimal for point sets in even dimensions. M.Sc. thesis, Univ. British Columbia, Vancouver, BC, Report 81/14. [27] M. Sharir. Almost tight upper bounds for lower envelopes in higher dimensions. Discrete and Computational Geometry, 12: , [28] M. Teichmann and S. Teller. Polygonal approximation of Voronoi diagrams of a set of triangles in three dimensions. Technical Report 766, Laboratory of Computer Science, MIT,

14 Appendix A Two lines intersect in R 3 and the third is in a plane parallel In this case the trisector consists of the intersection of a right hyperbolic paraboloid and two planes. Proposition 23 If two lines intersect in R 3 and the third is in a plane parallel then the trisector consists of two parabolas, one in each of the planes of the bisector of the intersecting lines. The projection of the trisector on the XY -plane is a pair of orthogonal lines (and thus monotonic in X and Y ). Proof. See Figure 6(a). We can assume that all three lines are parallel to the XY -plane so that bisector H 1,3 is a pair of vertical planes and H 1,2 is a right hyperbolic parabloid with vertical axis. By Lemma 14 the trisector is either a parabola or a line in each of the planes of H 1,3. By Lemma 4 neither is a line. Proposition 24 Let, and be three lines such that and intersect in R 3 and is in a plane parallel and below the plane containing and. Then (i) V 1,2 and V 2,3 consist of two connected components of a hyperbolic paraboloid each of which is bounded by two arcs of the trisector. The cell of V 1,2 (resp. V 2,3 ) consists of the components that contain (resp. ) in projection. (i) V 1,3 consists of one connected component lying on two planes. In each plane, the cell consists of the region above the corresponding branch of the trisector. Sketch of proof. The pair of parabola project onto the XY -plane in a pair of orthogonal lines dividing the plane into four quadrants. Each quadrant contains either or in projection. A point on the hyperbolic paraboloid H 1,2 in the quadrant of is clearly closer to than to. Similarly for H 2,3. This concludes the argument for (i). For (ii) consider a point p on the trisector that projects, orthogonally to the XY - plane, on. Such a point p can be chosen on each of the bisecting planes and thus on each parabola. Since is everywhere below the hyperbolic paraboloid H 1,2 (and H 2,3 ) and is above, moving the point p upward moves it away from and closer to. Hence the result. (a) The trisector is two parabolas (b) One parabola Figure 6: The trisector of two intersecting and one skew line. 13

15 Y Z v 3 = (1, a, 0) p 3 = (x, 0, z) O X : : y = ax z = 1 y = ax z = 1 (a) is above (b) is above (c) is below Figure 7: A pair of parallel lines with the third line in a plane not parallel to the plane of the parallel pair. The trisector is a hyperbola. The 2D cells depend on whether intersects the plane containing and between them or not. B Two lines are parallel When two lines are parallel the trisector consists of the intersection of a right hyperbolic paraboloid and a plane. It is either a parabola or a hyperbola depending on whether the third line is in a plane parallel to the parallel pair. Proposition 25 If the third line is in a plane parallel to the plane of the parallel pair then the trisector is a parabola. It s projection in the XY -plane is a line (which is monotonic in X and Y ). Proof. See Figure 6(b). We can assume that all three lines are parallel to the XY - plane so that bisector H 1,3 is a vertical plane and H 1,2 is a right hyperbolic parabloid with vertical axis. By Lemma 14 the trisector is either a parabola or a line and by Lemma 4 it is not a line. It projects to a line since H 1,3 is vertical. Proposition 26 Let, and be three lines such that and are parallel in R 3 and is in a plane parallel and below the plane containing and. Then (i) V 1,2 and V 2,3 consist of one connected component of a hyperbolic paraboloid bounded by the trisector. The cell of V 1,2 (resp. V 2,3 ) consists of the component that contains (resp. ) when projected on the XY -plane. (i) V 1,3 consists of one connected component lying on the plane above the corresponding branch of the trisector. Sketch of proof. The proof is similar to the proof of Proposition 24. Proposition 27 If the third line is in a plane not parallel to the plane of the parallel pair then the trisector is a hyperbola. Its projection onto the XY -plane is a rectangular hyperbola which is monotonic in X and Y. Proof. See Figure 7. We can assume that bisector H 1,3 is a non-vertical plane and H 1,2 is a right hyperbolic parabloid with vertical axis. By Lemma 14 the trisector is either a hyperbola or a line and by Lemma 4 it is not a line. To see that its projection is rectangular, we proceed as in the proof of Lemma 8. Lines and are as in Figure 1(a) and is given by p 3 = (x, 0, z) and v 3 = (1, a, 0), z ±1. See Figure 7(a). The equation of the projected conic is 2a(1 z)xy + 2a 2 xx 2axY + (1 z 2 )(a 2 + 1) a 2 x 2 = 0. Since z 1, the coefficient of XY is not zero, which gives the result. 14

16 Proposition 28 Let, and be three lines such that and are parallel in R 3 and intersects the plane containing and in a point p. Without loss of generality, by exchanging if necessary and we may assume that is below (z < 1). If is above (resp. below) then (i) V 2,3 consists of one connected component of a hyperbolic paraboloid bounded by the two branches of the trisector, (ii) V 1,2 consists of two connected components of a hyperbolic paraboloid each bounded by one branch of the trisector (resp. consists of one connected component of a hyperbolic paraboloid bounded by the two branches of the trisector), and (iii) V 1,3 consists of one connected component lying on the plane and bounded by two branches of the trisector (resp. two connected components on the plane and each bounded by one branch of the trisector) (see Figure 7). Sketch of proof. For (i) note that the midpoint of the common perpendicular of and is in the cell V 1,3 and it can be shown that the projection of this midpoint is in between the two branches of the projected hyperbola. Similarly for (ii) and (iii). 15

17 C Tables and figures Configuration of lines Three pairwise skew lines Trisector not all parallel to a common plane or on a hyperboloid of revolution non-singular quartic on a hyperboloid of revolution cubic and a line all parallel to a common plane nodal quartic Fig. 8(a) One pair of coplanar lines one pair intersecting, third skew, not in a parallel plane two hyperbolas Fig. 8(b) one pair intersecting, third in a parallel plane two parabolas Fig. 8(c) one pair parallel, third skew, not in a parallel plane one hyperbola Fig. 8(d) one pair parallel, third in a parallel plane one parabola Fig. 8(e) Two pairs of coplanar lines two intersecting pairs four lines Fig. 8(f) one pair parallel, one pair intersecting two lines Fig. 8(g) Three pairs of coplanar lines in three distinct planes three pairwise parallel lines one line Fig. 8(h) three concurrent lines four lines Fig. 8(i) Three coplanar lines three parallel lines empty set Fig. 8(j) two parallel lines, the third one intersects them two lines Fig. 8(k) three concurrent lines one line Fig. 8(l) three pairwise intersecting lines (not concurrent) four lines Fig. 8(m) Table 1: Classification of the trisector of three lines. 16

18 Configuration of lines Bisector type No. CC V 1,2 V 1,3 V 2,3 V 1,2 V 1,3 V 2,3 Three pairwise skew lines not all parallel to a common plane or on a hyperboloid of revolution HP HP HP on a hyperboloid of revolution HP HP HP all parallel to a common plane HP HP HP One pair of coplanar lines one pair intersecting, third skew, not in a parallel plane HP HP 2P one pair intersecting, third in a parallel plane HP HP 2P one pair parallel, third skew, not in a parallel plane HP HP P 2(1) 1 1(2) one pair parallel, third in a parallel plane HP HP P Two pairs of coplanar lines two intersecting pairs HP 2P 2P one pair parallel, one pair intersecting HP 2P P Three pairs of coplanar lines in three distinct planes three pairwise parallel lines P P P three concurrent lines 2P 2P 2P Three coplanar lines three parallel lines P P two parallel lines, the third one intersects them P 2P 2P three concurrent lines 2P 2P 2P three pairwise intersecting lines (not in a point) 2P 2P 2P Table 2: Classification of the 2D cells of three lines. In each case the bisectors are either hyperbolic paraboloids (HP), pairs of planes (2P), or single planes (P). *The number of connected components for cells V 1,2 and V 2,3 depends on where the skew line intersects the plane containing the parallel lines in between them or not. 17

19 (a) Three pairwise skew lines all parallel to a common plane. (b) One pair of coplanar lines: one pair intersecting, third is skew but not in a parallel plane. (c) One pair of coplanar lines: one pair intersecting, third in a parallel plane. (d) One pair of coplanar lines: one pair parallel, the third is skew but not in a parallel plane. (e) One pair of coplanar lines: one pair parallel, third in a parallel plane. (f) Two pairs of coplanar lines: two intersecting pairs. (g) Two pairs of coplanar lines: one pair parallel, one pair intersecting. (h) Three pairwise parallel lines in three distinct planes. (i) Three concurrent lines in three distinct planes. (j) Three coplanar parallel lines. (k) Three coplanar lines: two are parallel, the third intersects them. (l) Three coplanar concurrent lines. (m) Three coplanar pairwise intersecting lines (not concurrent). Figure 8: Classification of the degenerate cases. 18

The Voronoi diagram of three arbitrary lines in R3

The Voronoi diagram of three arbitrary lines in R3 The Voronoi diagram of three arbitrary lines in R3 Hazel Everett, Christian Gillot, Daniel Lazard, Sylvain Lazard, Marc Pouget To cite this version: Hazel Everett, Christian Gillot, Daniel Lazard, Sylvain

More information

6.854J / J Advanced Algorithms Fall 2008

6.854J / J Advanced Algorithms Fall 2008 MIT OpenCourseWare http://ocw.mit.edu 6.854J / 18.415J Advanced Algorithms Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advanced

More information

Transversals to line segments in three-dimensional space

Transversals to line segments in three-dimensional space Transversals to line segments in three-dimensional space H. Brönnimann, 1 H. Everett, 2 S. Lazard, 2 F. Sottile, 3 and S. Whitesides 4 1 Department of Computer and Information Science, Polytechnic University,

More information

Transversals to Line Segments in Three- Dimensional Space

Transversals to Line Segments in Three- Dimensional Space University of Massachusetts Amherst ScholarWorks@UMass Amherst Mathematics and Statistics Department Faculty Publication Series Mathematics and Statistics 2003 Transversals to Line Segments in Three- Dimensional

More information

Aspect-Ratio Voronoi Diagram with Applications

Aspect-Ratio Voronoi Diagram with Applications Aspect-Ratio Voronoi Diagram with Applications Tetsuo Asano School of Information Science, JAIST (Japan Advanced Institute of Science and Technology), Japan 1-1 Asahidai, Nomi, Ishikawa, 923-1292, Japan

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

Chapter 15: Functions of Several Variables

Chapter 15: Functions of Several Variables Chapter 15: Functions of Several Variables Section 15.1 Elementary Examples a. Notation: Two Variables b. Example c. Notation: Three Variables d. Functions of Several Variables e. Examples from the Sciences

More information

Lifting Transform, Voronoi, Delaunay, Convex Hulls

Lifting Transform, Voronoi, Delaunay, Convex Hulls Lifting Transform, Voronoi, Delaunay, Convex Hulls Subhash Suri Department of Computer Science University of California Santa Barbara, CA 93106 1 Lifting Transform (A combination of Pless notes and my

More information

Hyperbolic structures and triangulations

Hyperbolic structures and triangulations CHAPTER Hyperbolic structures and triangulations In chapter 3, we learned that hyperbolic structures lead to developing maps and holonomy, and that the developing map is a covering map if and only if the

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

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

Chapter 3. Quadric hypersurfaces. 3.1 Quadric hypersurfaces Denition.

Chapter 3. Quadric hypersurfaces. 3.1 Quadric hypersurfaces Denition. Chapter 3 Quadric hypersurfaces 3.1 Quadric hypersurfaces. 3.1.1 Denition. Denition 1. In an n-dimensional ane space A; given an ane frame fo;! e i g: A quadric hypersurface in A is a set S consisting

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

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

Vectors and the Geometry of Space

Vectors and the Geometry of Space Vectors and the Geometry of Space In Figure 11.43, consider the line L through the point P(x 1, y 1, z 1 ) and parallel to the vector. The vector v is a direction vector for the line L, and a, b, and c

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

Packing Two Disks into a Polygonal Environment

Packing Two Disks into a Polygonal Environment Packing Two Disks into a Polygonal Environment Prosenjit Bose, School of Computer Science, Carleton University. E-mail: jit@cs.carleton.ca Pat Morin, School of Computer Science, Carleton University. E-mail:

More information

CS-9645 Introduction to Computer Vision Techniques Winter 2019

CS-9645 Introduction to Computer Vision Techniques Winter 2019 Table of Contents Projective Geometry... 1 Definitions...1 Axioms of Projective Geometry... Ideal Points...3 Geometric Interpretation... 3 Fundamental Transformations of Projective Geometry... 4 The D

More information

LINES AND FREE LINE SEGMENTS TANGENT TO ARBITRARY THREE-DIMENSIONAL CONVEX POLYHEDRA

LINES AND FREE LINE SEGMENTS TANGENT TO ARBITRARY THREE-DIMENSIONAL CONVEX POLYHEDRA LINES AND FREE LINE SEGMENTS TANGENT TO ARBITRARY THREE-DIMENSIONAL CONVEX POLYHEDRA HERVÉ BRÖNNIMANN, OLIVIER DEVILLERS, VIDA DUJMOVIĆ, HAZEL EVERETT, MARC GLISSE, XAVIER GOAOC, SYLVAIN LAZARD, HYEON-SUK

More information

Algebraic Geometry of Segmentation and Tracking

Algebraic Geometry of Segmentation and Tracking Ma191b Winter 2017 Geometry of Neuroscience Geometry of lines in 3-space and Segmentation and Tracking This lecture is based on the papers: Reference: Marco Pellegrini, Ray shooting and lines in space.

More information

Near-Optimal Parameterization of the Intersection of Quadrics: III. Parameterizing Singular Intersections

Near-Optimal Parameterization of the Intersection of Quadrics: III. Parameterizing Singular Intersections Near-Optimal Parameterization of the Intersection of Quadrics: III. Parameterizing Singular Intersections Laurent Dupont, Daniel Lazard, Sylvain Lazard, Sylvain Petitjean To cite this version: Laurent

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

Smallest Intersecting Circle for a Set of Polygons

Smallest Intersecting Circle for a Set of Polygons Smallest Intersecting Circle for a Set of Polygons Peter Otfried Joachim Christian Marc Esther René Michiel Antoine Alexander 31st August 2005 1 Introduction Motivated by automated label placement of groups

More information

3. Voronoi Diagrams. 3.1 Definitions & Basic Properties. Examples :

3. Voronoi Diagrams. 3.1 Definitions & Basic Properties. Examples : 3. Voronoi Diagrams Examples : 1. Fire Observation Towers Imagine a vast forest containing a number of fire observation towers. Each ranger is responsible for extinguishing any fire closer to her tower

More information

LECTURE 13, THURSDAY APRIL 1, 2004

LECTURE 13, THURSDAY APRIL 1, 2004 LECTURE 13, THURSDAY APRIL 1, 2004 FRANZ LEMMERMEYER 1. Parametrizing Curves of Genus 0 As a special case of the theorem that curves of genus 0, in particular those with the maximal number of double points,

More information

Local differentiability and monotonicity properties of Voronoi diagrams for disjoint convex sites in three dimensions

Local differentiability and monotonicity properties of Voronoi diagrams for disjoint convex sites in three dimensions Local differentiability and monotonicity properties of Voronoi diagrams for disjoint convex sites in three dimensions Colm Ó Dúnlaing Mathematics, Trinity College, Dublin 2, Ireland December 31, 2003 Abstract

More information

Shape Control of Cubic H-Bézier Curve by Moving Control Point

Shape Control of Cubic H-Bézier Curve by Moving Control Point Journal of Information & Computational Science 4: 2 (2007) 871 878 Available at http://www.joics.com Shape Control of Cubic H-Bézier Curve by Moving Control Point Hongyan Zhao a,b, Guojin Wang a,b, a Department

More information

The Voronoi Diagram of Planar Convex Objects

The Voronoi Diagram of Planar Convex Objects The Voronoi Diagram of Planar Convex Objects Memelaos Karavelas, Mariette Yvinec To cite this version: Memelaos Karavelas, Mariette Yvinec. The Voronoi Diagram of Planar Convex Objects. European Symposium

More information

274 Curves on Surfaces, Lecture 5

274 Curves on Surfaces, Lecture 5 274 Curves on Surfaces, Lecture 5 Dylan Thurston Notes by Qiaochu Yuan Fall 2012 5 Ideal polygons Previously we discussed three models of the hyperbolic plane: the Poincaré disk, the upper half-plane,

More information

arxiv: v1 [cs.cg] 8 Jan 2018

arxiv: v1 [cs.cg] 8 Jan 2018 Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon Eunjin Oh Hee-Kap Ahn arxiv:1801.02292v1 [cs.cg] 8 Jan 2018 Abstract Given a set of sites in a simple polygon, a geodesic Voronoi diagram

More information

Computing Numerically-Optimal Bounding Boxes for CSG Components in Monte Carlo Particle Transport Calculations

Computing Numerically-Optimal Bounding Boxes for CSG Components in Monte Carlo Particle Transport Calculations MC21 Computing Numerically-ptimal ounding oxes for CSG Components in Monte Carlo Particle Transport Calculations David L. Millman 1, David P. Griesheimer 1, rian R. Nease 1, and Jack Snoeyink 2 1. ettis

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

The Farthest Point Delaunay Triangulation Minimizes Angles

The Farthest Point Delaunay Triangulation Minimizes Angles The Farthest Point Delaunay Triangulation Minimizes Angles David Eppstein Department of Information and Computer Science UC Irvine, CA 92717 November 20, 1990 Abstract We show that the planar dual to the

More information

Advanced Algorithms Computational Geometry Prof. Karen Daniels. Fall, 2012

Advanced Algorithms Computational Geometry Prof. Karen Daniels. Fall, 2012 UMass Lowell Computer Science 91.504 Advanced Algorithms Computational Geometry Prof. Karen Daniels Fall, 2012 Voronoi Diagrams & Delaunay Triangulations O Rourke: Chapter 5 de Berg et al.: Chapters 7,

More information

A fast approximation of the Voronoi diagram for a set of pairwise disjoint arcs

A fast approximation of the Voronoi diagram for a set of pairwise disjoint arcs A fast approximation of the Voronoi diagram for a set of pairwise disjoint arcs Dmytro Kotsur Taras Shevchenko National University of Kyiv 64/13, Volodymyrska, st., Kyiv, Ukraine dkotsur@gmail.com Vasyl

More information

Sphere-geometric aspects of bisector surfaces

Sphere-geometric aspects of bisector surfaces Sphere-geometric aspects of bisector surfaces Martin eternell Vienna University of Technology, AGGM 2006, arcelona, September 2006 1 Definition Smooth oriented objects and

More information

Other Voronoi/Delaunay Structures

Other Voronoi/Delaunay Structures Other Voronoi/Delaunay Structures Overview Alpha hulls (a subset of Delaunay graph) Extension of Voronoi Diagrams Convex Hull What is it good for? The bounding region of a point set Not so good for describing

More information

Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes

Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes Menelaos I. Karavelas joint work with Eleni Tzanaki University of Crete & FO.R.T.H. OrbiCG/ Workshop on Computational

More information

Tangency of Conics and Quadrics

Tangency of Conics and Quadrics Proc. of the 6th WSEAS Int. Conf. on Signal Processing, Computational Geometry & Artificial Vision, Elounda, Greece, August 21-23, 26 (pp21-29) Tangency of Conics and Quadrics SUDANTHI N. R. WIJEWICKREMA,

More information

arxiv: v2 [cs.cg] 30 Nov 2010

arxiv: v2 [cs.cg] 30 Nov 2010 Farthest-Polygon Voronoi Diagrams Otfried Cheong Hazel Everett Marc Glisse Joachim Gudmundsson Samuel Hornus Sylvain Lazard Mira Lee Hyeon-Suk Na September 17, 2018 arxiv:1001.3593v2 [cs.cg] 30 Nov 2010

More information

Triangulations of Line Segment Sets in the Plane

Triangulations of Line Segment Sets in the Plane Triangulations of Line Segment Sets in the Plane Mathieu Brévilliers, Nicolas Chevallier, and Dominique Schmitt Laboratoire MIA, Université de Haute-Alsace 4, rue des Frères Lumière, 68093 Mulhouse Cedex,

More information

Orthogonal Ham-Sandwich Theorem in R 3

Orthogonal Ham-Sandwich Theorem in R 3 Orthogonal Ham-Sandwich Theorem in R 3 Downloaded 11/24/17 to 37.44.201.8. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php Abstract The ham-sandwich theorem

More information

Geometry Vocabulary Math Fundamentals Reference Sheet Page 1

Geometry Vocabulary Math Fundamentals Reference Sheet Page 1 Math Fundamentals Reference Sheet Page 1 Acute Angle An angle whose measure is between 0 and 90 Acute Triangle A that has all acute Adjacent Alternate Interior Angle Two coplanar with a common vertex and

More information

12.6 Cylinders and Quadric Surfaces

12.6 Cylinders and Quadric Surfaces 12 Vectors and the Geometry of Space 12.6 and Copyright Cengage Learning. All rights reserved. Copyright Cengage Learning. All rights reserved. and We have already looked at two special types of surfaces:

More information

1.8 Coordinate Geometry. Copyright Cengage Learning. All rights reserved.

1.8 Coordinate Geometry. Copyright Cengage Learning. All rights reserved. 1.8 Coordinate Geometry Copyright Cengage Learning. All rights reserved. Objectives The Coordinate Plane The Distance and Midpoint Formulas Graphs of Equations in Two Variables Intercepts Circles Symmetry

More information

CONNECTED SPACES AND HOW TO USE THEM

CONNECTED SPACES AND HOW TO USE THEM CONNECTED SPACES AND HOW TO USE THEM 1. How to prove X is connected Checking that a space X is NOT connected is typically easy: you just have to find two disjoint, non-empty subsets A and B in X, such

More information

Introduction p. 1 What Is Geometric Modeling? p. 1 Computer-aided geometric design Solid modeling Algebraic geometry Computational geometry

Introduction p. 1 What Is Geometric Modeling? p. 1 Computer-aided geometric design Solid modeling Algebraic geometry Computational geometry Introduction p. 1 What Is Geometric Modeling? p. 1 Computer-aided geometric design Solid modeling Algebraic geometry Computational geometry Representation Ab initio design Rendering Solid modelers Kinematic

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

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

Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra

Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra Haim Kaplan, Natan Rubin, and Micha Sharir School of Computer Science, Tel Aviv University, Tel Aviv, Israel {haimk,rubinnat,michas}@post.tau.ac.il

More information

60 2 Convex sets. {x a T x b} {x ã T x b}

60 2 Convex sets. {x a T x b} {x ã T x b} 60 2 Convex sets Exercises Definition of convexity 21 Let C R n be a convex set, with x 1,, x k C, and let θ 1,, θ k R satisfy θ i 0, θ 1 + + θ k = 1 Show that θ 1x 1 + + θ k x k C (The definition of convexity

More information

Mathematics High School Geometry An understanding of the attributes and relationships of geometric objects can be applied in diverse contexts

Mathematics High School Geometry An understanding of the attributes and relationships of geometric objects can be applied in diverse contexts Mathematics High School Geometry An understanding of the attributes and relationships of geometric objects can be applied in diverse contexts interpreting a schematic drawing, estimating the amount of

More information

High-Level Filtering for Arrangements of Conic Arcs (Extended Abstract)

High-Level Filtering for Arrangements of Conic Arcs (Extended Abstract) High-Level Filtering for Arrangements of Conic Arcs (Extended Abstract) Ron Wein School of Computer Science Tel Aviv University wein@post.tau.ac.il Abstract. Many computational geometry algorithms involve

More information

Mathematics High School Geometry

Mathematics High School Geometry Mathematics High School Geometry An understanding of the attributes and relationships of geometric objects can be applied in diverse contexts interpreting a schematic drawing, estimating the amount of

More information

Connected Components of Underlying Graphs of Halving Lines

Connected Components of Underlying Graphs of Halving Lines arxiv:1304.5658v1 [math.co] 20 Apr 2013 Connected Components of Underlying Graphs of Halving Lines Tanya Khovanova MIT November 5, 2018 Abstract Dai Yang MIT In this paper we discuss the connected components

More information

MAT175 Overview and Sample Problems

MAT175 Overview and Sample Problems MAT175 Overview and Sample Problems The course begins with a quick review/overview of one-variable integration including the Fundamental Theorem of Calculus, u-substitutions, integration by parts, and

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

Edge Guards for Polyhedra in Three-Space

Edge Guards for Polyhedra in Three-Space Edge Guards for Polyhedra in Three-Space Javier Cano Csaba D. Tóth Jorge Urrutia Abstract It is shown that every polyhedron in R with m edges can be guarded with at most 27 2m The bound improves to 5 6

More information

Quadric Surfaces. Philippe B. Laval. Today KSU. Philippe B. Laval (KSU) Quadric Surfaces Today 1 / 24

Quadric Surfaces. Philippe B. Laval. Today KSU. Philippe B. Laval (KSU) Quadric Surfaces Today 1 / 24 Quadric Surfaces Philippe B. Laval KSU Today Philippe B. Laval (KSU) Quadric Surfaces Today 1 / 24 Introduction A quadric surface is the graph of a second degree equation in three variables. The general

More information

G 6i try. On the Number of Minimal 1-Steiner Trees* Discrete Comput Geom 12:29-34 (1994)

G 6i try. On the Number of Minimal 1-Steiner Trees* Discrete Comput Geom 12:29-34 (1994) Discrete Comput Geom 12:29-34 (1994) G 6i try 9 1994 Springer-Verlag New York Inc. On the Number of Minimal 1-Steiner Trees* B. Aronov, 1 M. Bern, 2 and D. Eppstein 3 Computer Science Department, Polytechnic

More information

Lecture 1 Discrete Geometric Structures

Lecture 1 Discrete Geometric Structures Lecture 1 Discrete Geometric Structures Jean-Daniel Boissonnat Winter School on Computational Geometry and Topology University of Nice Sophia Antipolis January 23-27, 2017 Computational Geometry and Topology

More information

Module 3: Stand Up Conics

Module 3: Stand Up Conics MATH55 Module 3: Stand Up Conics Main Math concepts: Conic Sections (i.e. Parabolas, Ellipses, Hyperbolas), nd degree equations Auxilliary ideas: Analytic vs. Co-ordinate-free Geometry, Parameters, Calculus.

More information

Quadric Surfaces. Philippe B. Laval. Spring 2012 KSU. Philippe B. Laval (KSU) Quadric Surfaces Spring /

Quadric Surfaces. Philippe B. Laval. Spring 2012 KSU. Philippe B. Laval (KSU) Quadric Surfaces Spring / .... Quadric Surfaces Philippe B. Laval KSU Spring 2012 Philippe B. Laval (KSU) Quadric Surfaces Spring 2012 1 / 15 Introduction A quadric surface is the graph of a second degree equation in three variables.

More information

Projective spaces and Bézout s theorem

Projective spaces and Bézout s theorem Projective spaces and Bézout s theorem êaû{0 Mijia Lai 5 \ laimijia@sjtu.edu.cn Outline 1. History 2. Projective spaces 3. Conics and cubics 4. Bézout s theorem and the resultant 5. Cayley-Bacharach theorem

More information

For a set S of line segments, a separator can be found using duality. Under duality, the segments transform to double wedges, and a separator line tra

For a set S of line segments, a separator can be found using duality. Under duality, the segments transform to double wedges, and a separator line tra Separating and Shattering Long Line Segments? Alon Efrat School of Mathematical Sciences, Tel Aviv University, Tel-Aviv 69982, Israel. Email: alone@cs.tau.ac.il Otfried Schwarzkopf Dept of Computer Science,

More information

Honors Precalculus: Solving equations and inequalities graphically and algebraically. Page 1

Honors Precalculus: Solving equations and inequalities graphically and algebraically. Page 1 Solving equations and inequalities graphically and algebraically 1. Plot points on the Cartesian coordinate plane. P.1 2. Represent data graphically using scatter plots, bar graphs, & line graphs. P.1

More information

Higher-Order Voronoi Diagrams on Triangulated Surfaces

Higher-Order Voronoi Diagrams on Triangulated Surfaces Higher-Order Voronoi Diagrams on Triangulated Surfaces Sergio Cabello Marta Fort J. Antoni Sellarès January 12, 2009 Abstract We study the complexity of higher-order Voronoi diagrams on triangulated surfaces

More information

Computational Geometry

Computational Geometry Lecture 1: Introduction and convex hulls Geometry: points, lines,... Geometric objects Geometric relations Combinatorial complexity Computational geometry Plane (two-dimensional), R 2 Space (three-dimensional),

More information

Math 5593 Linear Programming Lecture Notes

Math 5593 Linear Programming Lecture Notes Math 5593 Linear Programming Lecture Notes Unit II: Theory & Foundations (Convex Analysis) University of Colorado Denver, Fall 2013 Topics 1 Convex Sets 1 1.1 Basic Properties (Luenberger-Ye Appendix B.1).........................

More information

The Manifold of Planes that Intersect Four Straight Lines in Points of a Circle

The Manifold of Planes that Intersect Four Straight Lines in Points of a Circle Journal for Geometry and Graphics Volume 8 (2004), No. 1, 59 68. The Manifold of Planes that Intersect Four Straight Lines in Points of a Circle Hans-Peter Schröcker Institute of Discrete Mathematics and

More information

Lecture 16: Voronoi Diagrams and Fortune s Algorithm

Lecture 16: Voronoi Diagrams and Fortune s Algorithm contains q changes as a result of the ith insertion. Let P i denote this probability (where the probability is taken over random insertion orders, irrespective of the choice of q). Since q could fall through

More information

Section 2.5. Functions and Surfaces

Section 2.5. Functions and Surfaces Section 2.5. Functions and Surfaces ² Brief review for one variable functions and curves: A (one variable) function is rule that assigns to each member x in a subset D in R 1 a unique real number denoted

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

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

Geometry. Cluster: Experiment with transformations in the plane. G.CO.1 G.CO.2. Common Core Institute

Geometry. Cluster: Experiment with transformations in the plane. G.CO.1 G.CO.2. Common Core Institute Geometry Cluster: Experiment with transformations in the plane. G.CO.1: Know precise definitions of angle, circle, perpendicular line, parallel line, and line segment, based on the undefined notions of

More information

PS Computational Geometry Homework Assignment Sheet I (Due 16-March-2018)

PS Computational Geometry Homework Assignment Sheet I (Due 16-March-2018) Homework Assignment Sheet I (Due 16-March-2018) Assignment 1 Let f, g : N R with f(n) := 8n + 4 and g(n) := 1 5 n log 2 n. Prove explicitly that f O(g) and f o(g). Assignment 2 How can you generalize the

More information

Voronoi diagram and Delaunay triangulation

Voronoi diagram and Delaunay triangulation Voronoi diagram and Delaunay triangulation Ioannis Emiris & Vissarion Fisikopoulos Dept. of Informatics & Telecommunications, University of Athens Computational Geometry, spring 2015 Outline 1 Voronoi

More information

7 Voronoi Diagrams. The Post Office Problem

7 Voronoi Diagrams. The Post Office Problem 7 Voronoi Diagrams The Post Office Problem Suppose you are on the advisory board for the planning of a supermarket chain, and there are plans to open a new branch at a certain location. To predict whether

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

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

arxiv: v2 [math.ag] 8 Mar 2017

arxiv: v2 [math.ag] 8 Mar 2017 arxiv:1412.5313v2 [math.g] 8 Mar 2017 M-curves of degree 9 or 11 with one unique non-empty oval Séverine Fiedler-Le Touzé June 27, 2018 bstract In this note, we consider M-curves of odd degree m with real

More information

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

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

More information

1.6 Quadric Surfaces Brief review of Conic Sections 74 CHAPTER 1. VECTORS AND THE GEOMETRY OF SPACE. Figure 1.18: Parabola y = 2x 2

1.6 Quadric Surfaces Brief review of Conic Sections 74 CHAPTER 1. VECTORS AND THE GEOMETRY OF SPACE. Figure 1.18: Parabola y = 2x 2 7 CHAPTER 1. VECTORS AND THE GEOMETRY OF SPACE Figure 1.18: Parabola y = x 1.6 Quadric Surfaces Figure 1.19: Parabola x = y 1.6.1 Brief review of Conic Sections You may need to review conic sections for

More information

Substituting a 2 b 2 for c 2 and using a little algebra, we can then derive the standard equation for an ellipse centred at the origin,

Substituting a 2 b 2 for c 2 and using a little algebra, we can then derive the standard equation for an ellipse centred at the origin, Conics onic sections are the curves which result from the intersection of a plane with a cone. These curves were studied and revered by the ancient Greeks, and were written about extensively by both Euclid

More information

Math 734 Aug 22, Differential Geometry Fall 2002, USC

Math 734 Aug 22, Differential Geometry Fall 2002, USC Math 734 Aug 22, 2002 1 Differential Geometry Fall 2002, USC Lecture Notes 1 1 Topological Manifolds The basic objects of study in this class are manifolds. Roughly speaking, these are objects which locally

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

MATH 890 HOMEWORK 2 DAVID MEREDITH

MATH 890 HOMEWORK 2 DAVID MEREDITH MATH 890 HOMEWORK 2 DAVID MEREDITH (1) Suppose P and Q are polyhedra. Then P Q is a polyhedron. Moreover if P and Q are polytopes then P Q is a polytope. The facets of P Q are either F Q where F is a facet

More information

GEOMETRIC TOOLS FOR COMPUTER GRAPHICS

GEOMETRIC TOOLS FOR COMPUTER GRAPHICS GEOMETRIC TOOLS FOR COMPUTER GRAPHICS PHILIP J. SCHNEIDER DAVID H. EBERLY MORGAN KAUFMANN PUBLISHERS A N I M P R I N T O F E L S E V I E R S C I E N C E A M S T E R D A M B O S T O N L O N D O N N E W

More information

Efi Fogel, Dan Halperin, Lutz Kettner, Monique Teillaud, Ron Wein, and Nicola Wolpert

Efi Fogel, Dan Halperin, Lutz Kettner, Monique Teillaud, Ron Wein, and Nicola Wolpert 1 Arrangements Efi Fogel, Dan Halperin, Lutz Kettner, Monique Teillaud, Ron Wein, and Nicola Wolpert 1.1 Introduction Arrangements of geometric objects have been intensively studied in combinatorial and

More information

Geometric approximation of curves and singularities of secant maps Ghosh, Sunayana

Geometric approximation of curves and singularities of secant maps Ghosh, Sunayana University of Groningen Geometric approximation of curves and singularities of secant maps Ghosh, Sunayana IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you wish

More information

Lecture 25: Bezier Subdivision. And he took unto him all these, and divided them in the midst, and laid each piece one against another: Genesis 15:10

Lecture 25: Bezier Subdivision. And he took unto him all these, and divided them in the midst, and laid each piece one against another: Genesis 15:10 Lecture 25: Bezier Subdivision And he took unto him all these, and divided them in the midst, and laid each piece one against another: Genesis 15:10 1. Divide and Conquer If we are going to build useful

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

PITSCO Math Individualized Prescriptive Lessons (IPLs)

PITSCO Math Individualized Prescriptive Lessons (IPLs) Orientation Integers 10-10 Orientation I 20-10 Speaking Math Define common math vocabulary. Explore the four basic operations and their solutions. Form equations and expressions. 20-20 Place Value Define

More information

Orthogonal art galleries with holes: a coloring proof of Aggarwal s Theorem

Orthogonal art galleries with holes: a coloring proof of Aggarwal s Theorem Orthogonal art galleries with holes: a coloring proof of Aggarwal s Theorem Pawe l Żyliński Institute of Mathematics University of Gdańsk, 8095 Gdańsk, Poland pz@math.univ.gda.pl Submitted: Sep 9, 005;

More information

Quadric Surfaces. Six basic types of quadric surfaces: ellipsoid. cone. elliptic paraboloid. hyperboloid of one sheet. hyperboloid of two sheets

Quadric Surfaces. Six basic types of quadric surfaces: ellipsoid. cone. elliptic paraboloid. hyperboloid of one sheet. hyperboloid of two sheets Quadric Surfaces Six basic types of quadric surfaces: ellipsoid cone elliptic paraboloid hyperboloid of one sheet hyperboloid of two sheets hyperbolic paraboloid (A) (B) (C) (D) (E) (F) 1. For each surface,

More information

Cuts of the Hypercube

Cuts of the Hypercube Cuts of the Hypercube Neil Calkin, Kevin James, J. Bowman Light, Rebecca Myers, Eric Riedl, Veronica July 3, 8 Abstract This paper approaches the hypercube slicing problem from a probabilistic perspective.

More information

Pacific Journal of Mathematics

Pacific Journal of Mathematics Pacific Journal of Mathematics SIMPLIFYING TRIANGULATIONS OF S 3 Aleksandar Mijatović Volume 208 No. 2 February 2003 PACIFIC JOURNAL OF MATHEMATICS Vol. 208, No. 2, 2003 SIMPLIFYING TRIANGULATIONS OF S

More information

Lecture 0: Reivew of some basic material

Lecture 0: Reivew of some basic material Lecture 0: Reivew of some basic material September 12, 2018 1 Background material on the homotopy category We begin with the topological category TOP, whose objects are topological spaces and whose morphisms

More information

Figure 2.1: An example of a convex set and a nonconvex one.

Figure 2.1: An example of a convex set and a nonconvex one. Convex Hulls 2.1 Definitions 2 Convexity is the key to understanding and simplifying geometry, and the convex hull plays a role in geometry akin to the sorted order for a collection of numbers. So what

More information

EM225 Projective Geometry Part 2

EM225 Projective Geometry Part 2 EM225 Projective Geometry Part 2 eview In projective geometry, we regard figures as being the same if they can be made to appear the same as in the diagram below. In projective geometry: a projective point

More information