Results 11 to 20 of about 69,312 (204)
Minkowski Sum Selection and Finding [PDF]
International Journal of Computational Geometry & Applications, 2008 Let P,Q ⊆ ℝ2 be two n-point multisets and Ar ≥ b be a set of λ inequalities on x and y, where A ∈ ℝλ×2, [Formula: see text], and b ∈ ℝλ. Define the constrained Minkowski sum(P ⊕ Q)Ar≥ b as the multiset {(p + q)|p ∈ P, q ∈ Q,A(p + q) ≥ b }. Given P, Q, Ar ≥ b , an objective function f : ℝ2 → ℝ, and a positive integer k, the MINKOWSKI SUM SELECTION ...
Luo, Cheng-Wei +3 more
openaire +3 more sources
TWO APPROXIMATE MINKOWSKI SUM ALGORITHMS [PDF]
International Journal of Computational Geometry & Applications, 2010 We present two approximate Minkowski sum algorithms for planar regions bounded by line and circle segments. Both algorithms form a convolution curve, construct its arrangement, and use winding numbers to identify sum cells. The first uses the kinetic convolution and the second uses our monotonic convolution.
Milenkovic, Victor, Sacks, Elisha P.
openaire +2 more sources
On Minkowski Sums of Simplices [PDF]
Annals of Combinatorics, 2009 We investigate the structure of the Minkowski sum of standard simplices in ${\reals}^r$. In particular, we investigate the one-dimensional structure, the vertices, their degrees and the edges in the Minkowski sum polytope.
Agnarsson, Geir, Morris, Walter D.
openaire +2 more sources
Lattice Points in Minkowski Sums [PDF]
The Electronic Journal of Combinatorics, 2008 Fakhruddin has proved that for two lattice polygons $P$ and $Q$ any lattice point in their Minkowski sum can be written as a sum of a lattice point in $P$ and one in $Q$, provided $P$ is smooth and the normal fan of $P$ is a subdivision of the normal fan of $Q$.
Haase, Christian +3 more
openaire +3 more sources
Intent Arabic text categorisation based on different machine learning and term frequency
IET Networks, EarlyView., 2022 Abstract The complexity of Internet network configurations has made managing networks a complicated undertaking. Intent‐Based Networking (IBN) is a potential solution to this issue. In contrast to conventional networks, where a concrete description of the settings typically conveys a network administrator's goal kept on each device, an administrator's ...
Mohammad Fadhil Mahdi +1 more
wiley +1 more source
Minkowski’s inequality and sums of squares [PDF]
Open Mathematics, 2013 Abstract Positive polynomials arising from Muirhead’s inequality, from classical power mean and elementary symmetric mean inequalities and from Minkowski’s inequality can be rewritten as sums of squares.
Frenkel Péter, Horváth Péter
openaire +4 more sources
Toric Surface Codes and Minkowski Sums [PDF]
SIAM Journal on Discrete Mathematics, 2006 15 pages, 7 figures; This version contains some minor editorial revisions -- to appear SIAM Journal on Discrete ...
Little, John, Schenck, Hal
openaire +2 more sources
Generating Integrally Indecomposable Newton Polygons with Arbitrary Many Vertices
Mathematics, 2022 In this paper we shall give another proof of a special case of Gao’s theorem for generating integrally indecomposable polygons in the sense of Minkowski.
Petar Ðapić +3 more
doaj +1 more source
Substituting the typical compact sets into a power series [PDF]
, 2020 The Minkowski sum and Minkowski product can be considered as the addition and multiplication of subsets of $\mathbb{R}$. If we consider a compact subset $K\subseteq[0,1]$ and a power series $f$ which is absolutely convergent on $[0,1]$, then we may use ...
Nagy, Donát
core +2 more sources
Cayley Sums and Minkowski Sums of Lattice Polytopes
SIAM Journal on Discrete Mathematics, 2023 In this paper, we discuss the integer decomposition property for Cayley sums and Minkowski sums of lattice polytopes. In fact, we characterize when Cayley sums have the integer decomposition property in terms of Minkowski sums. Moreover, by using this characterization, we consider when Cayley sums and Minkowski sums of $2$-convex-normal lattice ...
openaire +3 more sources