142 research outputs found

    The intersection graph of the disks with diameters the sides of a convex n-gon

    Get PDF
    © 2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/Given a convex polygon of sides, one can draw disks (called side disks) where each disk has a different side of the polygon as diameter and the midpoint of the side as its center. The intersection graph of such disks is the undirected graph with vertices the disks and two disks are adjacent if and only if they have a point in common. We introduce the study of this graph by proving that it is planar for every convex polygon.Postprint (author's final draft

    On the multiple Borsuk numbers of sets

    Full text link
    The Borsuk number of a set S of diameter d >0 in Euclidean n-space is the smallest value of m such that S can be partitioned into m sets of diameters less than d. Our aim is to generalize this notion in the following way: The k-fold Borsuk number of such a set S is the smallest value of m such that there is a k-fold cover of S with m sets of diameters less than d. In this paper we characterize the k-fold Borsuk numbers of sets in the Euclidean plane, give bounds for those of centrally symmetric sets, smooth bodies and convex bodies of constant width, and examine them for finite point sets in the Euclidean 3-space.Comment: 16 pages, 3 figure

    Witness Gabriel Graphs

    Get PDF
    We consider a generalization of the Gabriel graph, the witness Gabriel graph. Given a set of vertices P and a set of witnesses W in the plane, there is an edge ab between two points of P in the witness Gabriel graph GG-(P,W) if and only if the closed disk with diameter ab does not contain any witness point (besides possibly a and/or b). We study several properties of the witness Gabriel graph, both as a proximity graph and as a new tool in graph drawing.Comment: 23 pages. EuroCG 200

    The geometry of flip graphs and mapping class groups

    Full text link
    The space of topological decompositions into triangulations of a surface has a natural graph structure where two triangulations share an edge if they are related by a so-called flip. This space is a sort of combinatorial Teichm\"uller space and is quasi-isometric to the underlying mapping class group. We study this space in two main directions. We first show that strata corresponding to triangulations containing a same multiarc are strongly convex within the whole space and use this result to deduce properties about the mapping class group. We then focus on the quotient of this space by the mapping class group to obtain a type of combinatorial moduli space. In particular, we are able to identity how the diameters of the resulting spaces grow in terms of the complexity of the underlying surfaces.Comment: 46 pages, 23 figure

    Capturing points with a rotating polygon (and a 3D extension)

    Get PDF
    This is a post-peer-review, pre-copyedit version of an article published in Theory of computing systems: an international journal. The final authenticated version is available online at: http://dx.doi.org/10.1007/s00224-018-9885-yWe study the problem of rotating a simple polygon to contain the maximum number of elements from a given point set in the plane. We consider variations of this problem where the rotation center is a given point or lies on a segment or a line. We also solve an extension to 3D where we rotate a polyhedron around a given point to contain the maximum number of elements from a set of points in the space.Peer ReviewedPostprint (author's final draft

    On the multiple Borsuk numbers of sets

    Get PDF
    The \emph{Borsuk number} of a set SS of diameter d>0d >0 in Euclidean nn-space is the smallest value of mm such that SS can be partitioned into mm sets of diameters less than dd. Our aim is to generalize this notion in the following way: The \emph{kk-fold Borsuk number} of such a set SS is the smallest value of mm such that there is a kk-fold cover of SS with mm sets of diameters less than dd. In this paper we characterize the kk-fold Borsuk numbers of sets in the Euclidean plane, give bounds for those of centrally symmetric sets, smooth bodies and convex bodies of constant width, and examine them for finite point sets in the Euclidean 33-space
    • …
    corecore