Triangulations and a discrete Brunn-Minkowski inequality in the plane

Publication date 1 September 2020

Abstract: For a set

A

of points in the plane, not all collinear, we denote by

m t r (A)

the number of triangles in any triangulation of

A

; that is,

m t r (A) = 2 i + b - 2

where

b

and

i

are the numbers of points of

A

in the boundary and the interior of

[A]

(we use

[A]

to denote "convex hull of

A

"). We conjecture the following analogue of the Brunn-Minkowski inequality: for any two point sets

A, B s u b s e t {m a t h b b R}^{2}

one has [ { m tr}(A+B)^{frac12}geq { m tr}(A)^{frac12}+{ m tr}(B)^{frac12}. ] We prove this conjecture in several cases: if

[A] = [B]

, if

B = A c u p b

, if

| B | = 3

, or if none of

A

or

B

has interior points.

Recommendations

Cites work

Cited in

(3)

This page was built for publication: Triangulations and a discrete Brunn-Minkowski inequality in the plane