Publication

Convexly independent subsets of the Minkowski sum of planar point sets

János Pach, Friedrich Eisenbrand, Thomas Rothvoss
2008
Journal Articles

Abstract

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)).

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Convexly independent subsets of the Minkowski sum of planar point sets

Chat with Graph Search

Correspondence functors and duality

Early decoding of walking tasks with minimal set of EMG channels

Quadratic serendipity element shape functions on general planar polygons