Blocking visibility for points in general position
From MaRDI portal
Publication:2391198
DOI10.1007/s00454-009-9185-zzbMath1172.52010MaRDI QIDQ2391198
Publication date: 24 July 2009
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-009-9185-z
Related Items
Every large point set contains many collinear points or an empty pentagon, On the connectivity of visibility graphs, Grid obstacle representation of graphs, Graphs with Large Obstacle Numbers
Cites Work
- Unnamed Item
- Unnamed Item
- The grid revisited
- A statistical theorem of set addition
- Covering and coloring polygon-circle graphs
- On the number of directions determined by a three-dimensional points set
- On the chromatic number of some geometric type Kneser graphs
- On the chromatic number of the visibility graph of a set of points in the plane
- Midpoints of Diagonals of Convex n-Gons
- The Number of Intersection Points Made by the Diagonals of a Regular Polygon
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression