Skip to main navigation
Skip to search
Skip to main content
Ben-Gurion University Research Portal Home
Help & FAQ
Home
Profiles
Research output
Research units
Prizes
Press/Media
Student theses
Projects
Activities
Datasets
Research Labs / Equipment
Search by expertise, name or affiliation
On Visibility Problems with an Infinite Discrete Set of Obstacles
Michael Boshernitzan
,
Yaar Solomon
Department of Mathematics
Research output
:
Contribution to journal
›
Article
›
peer-review
1
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'On Visibility Problems with an Infinite Discrete Set of Obstacles'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Discrete Set
100%
Visibility Constraints
100%
Euclidean Space
33%
Light Source
33%
Ramsey
33%
Finding Pattern
33%
Dense Subset
33%
Relatively Dense
33%
Uniformly Separated
33%
Discrete Point Sets
33%
Mathematics
Set Point
100%
Euclidean Space
100%
Discrete Set
100%
Dense Subset
100%