Rainbow polygons for colored point sets in the plane
Article in Discrete Mathematics (July 2021)
Discrete and Computational Geometry and Graphs
Overview of attention for book
Table of Contents
-
Altmetric BadgeBook Overview
-
Altmetric BadgeChapter 1 Covering Partial Cubes with Zones
-
Altmetric BadgeChapter 2 The Non-confusing Travel Groupoids on a Finite Connected Graph
-
Altmetric BadgeChapter 3 Decomposing Octilinear Polygons into Triangles and Rectangles
-
Altmetric BadgeChapter 4 On Wrapping Spheres and Cubes with Rectangular Paper
-
Altmetric BadgeChapter 5 On Polygonal Paths with Bounded Discrete-Curvature: The Inflection-Free Case
-
Altmetric BadgeChapter 6 Online Weight Balancing on the Unit Circle
-
Altmetric BadgeChapter 7 Transformability and Reversibility of Unfoldings of Doubly-Covered Polyhedra
-
Altmetric BadgeChapter 8 Computational Complexity of the $$r$$ -visibility Guard Set Problem for Polyominoes
-
Altmetric BadgeChapter 9 Properly Colored Geometric Matchings and 3-Trees Without Crossings on Multicolored Points in the Plane
-
Altmetric BadgeChapter 10 Generating Polygons with Triangles
-
Altmetric BadgeChapter 11 Cross-Intersecting Families of Vectors
-
Altmetric BadgeChapter 12 The Double Multicompetition Number of a Multigraph
-
Altmetric BadgeChapter 13 Computational Geometry in the Human Brain
-
Altmetric BadgeChapter 14 A Characterization of Link-2 LR-visibility Polygons with Applications
-
Altmetric BadgeChapter 15 Imaginary Hypercubes
-
Altmetric BadgeChapter 16 More Results on Clique-chromatic Numbers of Graphs with No Long Path
Attention for Chapter 8:
Computational Complexity of the $$r$$ -visibility Guard Set Problem for Polyominoes