Skip to main navigation
Skip to search
Skip to main content
Israeli Research Community Portal Home
Help & FAQ
Link opens in a new tab
Search content at Israeli Research Community Portal
Home
Profiles
Research units
Research output
Optimal cover of points by disksin a simple polygon
Haim Kaplan
,
Matthew J. Katz
, Gila Morgenstern
, Micha Sharir
School of Computer Science and AI
Tel Aviv University
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Optimal cover of points by disksin a simple polygon'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Simple Polygon
100%
Optimal Cover
100%
Minimum Cover
100%
Covering Problem
50%
Compact Convex Set
50%
Lecture Notes
50%
Time Algorithm
50%
Descriptional Complexity
50%
Linear Algorithm
50%
Homothets
50%
Minimum Disk Cover
50%
Mathematics
Simple Polygon
100%
Convex Set
50%