scientific article; zbMATH DE number 5130863

MaRDI QIDQ3424929zbMATH OpenFDO

Authors Ioannis Z. Emiris, Elias P. Tsigaridas

Publication date 5 March 2007

zbMATH Keywords

geometric modelingrandomized algorithms

Mathematics Subject Classification ID

Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Randomized algorithms (68W20)

Recommendations

• Polygon decomposition for efficient construction of Minkowski sums
• scientific article; zbMATH DE number 1670643
• Minkowski decomposition of convex polygons into their symmetric and asymmetric parts
• Exact Minkowksi sums of polyhedra and exact and efficient decomposition of polyhedra into convex pieces
• Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra in Convex Pieces
• scientific article; zbMATH DE number 1305341
• Convex decomposition of \(U\)-polygons
• Minkowski decompositions of associahedra
• Minkowski decomposition of associahedra and related combinatorics

Cited in

(5)

• Lattice points in Minkowski sums
• Approximating multidimensional subset sum and Minkowski decomposition of polygons
• Minkowski decomposition and geometric predicates in sparse implicitization
• A heuristic technique for decomposing multisets of non-negative integers according to the Minkowski sum
• Signed Minkowski decompositions of convex polygons into minimum simplices and factorization of max-plus functions

Describes a project that uses

Uses Software

• Knapsack

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3424929)