Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Convexly independent subsets of the Minkowski sum of planar point sets
 
research article

Convexly independent subsets of the Minkowski sum of planar point sets

Eisenbrand, Friedrich  
•
Pach, János  
•
Rothvoß, Thomas  
Show more
2008
Electronic Journal of Combinatorics

Let P and Q be finite sets of points in the plane. In this note we consider the largest cardinality of a subset of the Minkowski sum S ⊆ P⊕Q which consist of convex independent points. We show that, if P and Q contain at most n points, then |S| = O(n^(4/3)).

  • Files
  • Details
  • Metrics
Type
research article
Web of Science ID

WOS:000254150200002

Author(s)
Eisenbrand, Friedrich  
Pach, János  
Rothvoß, Thomas  
Sopher, Nir B.
Date Issued

2008

Publisher

American Mathematical Society

Published in
Electronic Journal of Combinatorics
Volume

15

Issue

1

Article Number

Note 8, 4

Subjects

Minkowski sum

•

planar point sets

Note

Professor Pach's number: [224]

URL

URL

http://cs.anu.edu.au/publications/eljc/Volume_15/v15i1toc.html
Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
DISOPT  
DCG  
Available on Infoscience
August 21, 2008
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/27429
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés