Results 21 to 30 of about 69,312 (204)
Approximate Unions of Lines and Minkowski Sums [PDF]
Algorithmica, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
van Kreveld, M.J., van der Stappen, A.F.
openaire +5 more sources
A geometric approach for the upper bound theorem for Minkowski sums of convex polytopes [PDF]
, 2015 We derive tight expressions for the maximum number of $k$-faces, $0\le{}k\le{}d-1$, of the Minkowski sum, $P_1+...+P_r$, of $r$ convex $d$-polytopes $P_1,...,P_r$ in $\mathbb{R}^d$, where $d\ge{}2$ and ...
Karavelas, Menelaos I., Tzanaki, Eleni
core +2 more sources
A NOVEL LOOK AT THE MICHAEL LATTICE SUM RULES [PDF]
, 1995 We reconsider the derivation of the Michael lattice sum rules, which relate the energy and action stored in a flux tube of a quark-antiquark pair to the static interquark potential, and show that they require essential corrections.
Bali +15 more
core +3 more sources
The maximum number of faces of the Minkowski sum of three convex polytopes
Journal of Computational Geometry, 2015 We derive tight expressions for the maximum number of $k$-faces, $0\le{}k\le{}d-1$, of the Minkowski sum, $P_1+P_2+P_3$, of three $d$-dimensional convex polytopes $P_1$, $P_2$ and $P_3$ in $\mathbb{R}^d$, as a function of the number of vertices of the ...
Menelaos Karavelas +2 more
doaj +1 more source
On f-vectors of Minkowski additions of convex polytopes [PDF]
, 2005 The objective of this paper is to present two types of results on Minkowski sums of convex polytopes. The first is about a special class of polytopes we call perfectly centered and the combinatorial properties of the Minkowski sum with their own dual. In
Fukuda, Komei, Weibel, Christophe
core +6 more sources
Matroid Polytopes and Their Volumes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 We express the matroid polytope $P_M$ of a matroid $M$ as a signed Minkowski sum of simplices, and obtain a formula for the volume of $P_M$. This gives a combinatorial expression for the degree of an arbitrary torus orbit closure in the Grassmannian $Gr_{
Federico Ardila +2 more
doaj +1 more source
Evaluating the boundary and covering degree of planar Minkowski sums and other geometrical convolutions [PDF]
, 2007 Algorithms are developed, based on topological principles, to evaluate the boundary and “internal structure” of the Minkowski sum of two planar curves. A graph isotopic to the envelope curve is constructed by computing its characteristic points.
Rida T. Farouki +85 more
core +1 more source
Aggregation of Demand-Side Flexibilities: A Comparative Study of Approximation Algorithms
Energies, 2022 Traditional power grids are mainly based on centralized power generation and subsequent distribution. The increasing penetration of distributed renewable energy sources and the growing number of electrical loads is creating difficulties in balancing ...
Emrah Öztürk +4 more
doaj +1 more source
A lattice point counting generalisation of the Tutte polynomial [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 The Tutte polynomial for matroids is not directly applicable to polymatroids. For instance, deletion- contraction properties do not hold. We construct a polynomial for polymatroids which behaves similarly to the Tutte polynomial of a matroid, and in fact
Amanda Cameron, Alex Fink
doaj +1 more source
The maximum number of faces of the Minkowski sum of three convex polytopes [PDF]
, 2012 We derive tight expressions for the maximum number of $k$-faces, $0\le{}k\le{}d-1$, of the Minkowski sum, $P_1+P_2+P_3$, of three $d$-dimensional convex polytopes $P_1$, $P_2$ and $P_3$ in $\reals^d$, as a function of the number of vertices of the ...
Karavelas, Menelaos I. +2 more
core +4 more sources