M. Karavelas

activity

20112015

most citedA geometric approach for the upper bound theorem for Minkowski sums of convex polytopes

2 citations · 2 across the 3 of their papers we have counts for

collaborators

3 papers

cs.CG2015★ 2 cited

A geometric approach for the upper bound theorem for Minkowski sums of convex polytopes

Menelaos I. Karavelas, Eleni Tzanaki

We derive tight expressions for the maximum number of $k$ -faces, $0 \leq k \leq d - 1$ , of the Minkowski sum, $P_{1} + ... + P_{r}$ , of $r$ convex $d$ -polytopes $P_{1}, ..., P_{r}$ in $R^{d}$ …

cs.CG2012

The maximum number of faces of the Minkowski sum of three convex polytopes

Menelaos I. Karavelas, Christos Konaxis, Eleni Tzanaki

We derive tight expressions for the maximum number of $k$ -faces, $0 \leq k \leq d - 1$ , of the Minkowski sum, $P_{1} + P_{2} + P_{3}$ , of three $d$ -dimensional convex polytopes $P_{1}$ , $P_{2}$ and $P…

cs.CG2011

Analysis of the Incircle predicate for the Euclidean Voronoi diagram of axes-aligned line segments

Manos N. Kamarianakis, Menelaos I. Karavelas

In this paper we study the most-demanding predicate for computing the Euclidean Voronoi diagram of axes-aligned line segments, namely the Incircle predicate. Our contribution is tw…