Blocking visibility for points in general position

DOI10.1007/s00454-009-9185-zzbMath1172.52010OpenAlexW2044868365MaRDI QIDQ2391198

Ji{ří} Matoušek

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

zbMATH Keywords

visibilityBehrend's constructionvisibility-blocking set

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Extremal combinatorics (05D99)

Related Items (5)

Grid obstacle representation of graphs ⋮ Edge colorings avoiding patterns ⋮ Every large point set contains many collinear points or an empty pentagon ⋮ On the connectivity of visibility 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

This page was built for publication: Blocking visibility for points in general position