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
 
Loading...
Thumbnail Image
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
Loading...
Thumbnail Image
Name

minkowski_final.pdf

Access type

openaccess

Size

94.84 KB

Format

Adobe PDF

Checksum (MD5)

f079dc733c9d72fb172dea269f2ba198

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