Blocking visibility for points in general position

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F09%3A00206289" target="_blank" >RIV/00216208:11320/09:00206289 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Blocking visibility for points in general position

Original language description

For a finite set P in the plane, let b(P) be the smallest possible size of a set Q, Q disjoint from P, such that every segment with both endpoints in P contains at least one point of Q. We raise the problem of estimating b(n), the minimum of b(P) over all n-point sets P with no three points collinear. We review results providing bounds on b(n) and mention some additional observations.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

<a href="/en/project/1M0545" target="_blank" >1M0545: Institute for Theoretical Computer Science</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2009

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Discrete and Computational Geometry

ISSN

0179-5376

e-ISSN

—

Volume of the periodical

42

Issue of the periodical within the volume

2

Country of publishing house

US - UNITED STATES

Number of pages

4

Pages from-to

—

UT code for WoS article

000266496100008

EID of the result in the Scopus database

—