On the largest convex subsets in Minkowski sums
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10282958" target="_blank" >RIV/00216208:11320/14:10282958 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.ipl.2014.02.013" target="_blank" >http://dx.doi.org/10.1016/j.ipl.2014.02.013</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ipl.2014.02.013" target="_blank" >10.1016/j.ipl.2014.02.013</a>
Alternative languages
Result language
angličtina
Original language name
On the largest convex subsets in Minkowski sums
Original language description
Given two point sets A, B in the plane of n points each, the Minkowski sum A + B has a quadratic number of points in general. How large can a subset S of A + B be if S is required to be convex? We prove that when A and B are both convex then S can have only O ( n log n ) points. This complements the existing results that are known when A and B are not in convex position or when B = A and A is convex.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Information Processing Letters
ISSN
0020-0190
e-ISSN
—
Volume of the periodical
114
Issue of the periodical within the volume
8
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
3
Pages from-to
405-407
UT code for WoS article
000336699200003
EID of the result in the Scopus database
—