Add to ORKGAbstract. In this paper a measure of non-convexity for a simple polygonal region in the plane is introduced. It is proved that for “not far from convex ” regions this measure does not decrease under the Minkowski sum operation, and guarantees that the Minkowski sum has no “holes”. 1
In 2000 Bezdek asked which plane convex bodies have the property that whenever an annulus, consistin...
The classical Brunn-Minkowski theory for convex bodies was developed from a few basic concepts: supp...
Algorithmic problems in geometry often become tractable with the assumption of convexity. Optimizati...
International audienceLet us define for a compact set A⊂Rn the sequenceA(k)={(a1+⋯+ak)/k : a1, …, ak...
Abstract The Minkowski condition for convex polytopes is equivalent to the divergence theorem of cla...
The objective of this dissertation is the application of Minkowskian cross-section measures (i.e., s...
This paper is devoted to similarity and symmetry measures for convex shapes whose definition is base...
AbstractThe traditional solution to the Minkowski problem for polytopes involves two steps. First, t...
In 2000 A. Bezdek asked which plane convex bodies have the property that whenever an annulus, consis...
Let us define for a compact set A ⊂ R n the sequence A(k) = a 1 + · · · + a k k : a 1 ,. .. , a k ∈ ...
Let us define for a compact set A ⊂ R n the sequence A(k) = a 1 + · · · + a k k : a 1 ,. .. , a k ∈ ...
Abstract We describe a trivial solution to the Minkowski problem for polygons in the Euclidean plane...
Consider a convex polygon P in the plane, and denote by U a homothetical copy of the vector sum of P...
Abstract The Minkowski existence Theorem for polytopes follows from Cramer’s Rule when attention is ...
This bachelor's thesis deals with the Minkowski sum of two non-convex polygons in the plane. Specifi...
In 2000 Bezdek asked which plane convex bodies have the property that whenever an annulus, consistin...
The classical Brunn-Minkowski theory for convex bodies was developed from a few basic concepts: supp...
Algorithmic problems in geometry often become tractable with the assumption of convexity. Optimizati...
International audienceLet us define for a compact set A⊂Rn the sequenceA(k)={(a1+⋯+ak)/k : a1, …, ak...
Abstract The Minkowski condition for convex polytopes is equivalent to the divergence theorem of cla...
The objective of this dissertation is the application of Minkowskian cross-section measures (i.e., s...
This paper is devoted to similarity and symmetry measures for convex shapes whose definition is base...
AbstractThe traditional solution to the Minkowski problem for polytopes involves two steps. First, t...
In 2000 A. Bezdek asked which plane convex bodies have the property that whenever an annulus, consis...
Let us define for a compact set A ⊂ R n the sequence A(k) = a 1 + · · · + a k k : a 1 ,. .. , a k ∈ ...
Let us define for a compact set A ⊂ R n the sequence A(k) = a 1 + · · · + a k k : a 1 ,. .. , a k ∈ ...
Abstract We describe a trivial solution to the Minkowski problem for polygons in the Euclidean plane...
Consider a convex polygon P in the plane, and denote by U a homothetical copy of the vector sum of P...
Abstract The Minkowski existence Theorem for polytopes follows from Cramer’s Rule when attention is ...
This bachelor's thesis deals with the Minkowski sum of two non-convex polygons in the plane. Specifi...
In 2000 Bezdek asked which plane convex bodies have the property that whenever an annulus, consistin...
The classical Brunn-Minkowski theory for convex bodies was developed from a few basic concepts: supp...
Algorithmic problems in geometry often become tractable with the assumption of convexity. Optimizati...