Minkowski decomposition of convex lattice polygons

No abstract is available for this paper.

• Publication year

  2006

• Venue

  Algebraic Geometry and Geometric Modeling

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-540-33275-6_14
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Open problems around exact algorithms

  2008cited by this paper
• A Census of Convex Lattice Polygons with at most one

  2005cited by this paper
• Simplification of surface parametrizations - a lattice polygon approach

  2003cited by this paper
• Combinatorial optimization - Eureka, you shrink!

  2003cited by this paper
• An efficient fully polynomial approximation scheme for the Subset-Sum Problem

  2003cited by this paper
• Toric Surface Patches

  2002cited by this paper
• Exact Algorithms for NP-Hard Problems: A Survey

  2001cited by this paper
• Fast Absolute Irreducibility Testing via Newton Polytopes

  2000cited by this paper
• Handbook of Computational Geometry

  2000cited by this paper
• The n -sided toric patches and A -resultants

  2000cited by this paper
• Decomposition of Polytopes and Polynomials

  2000influential reference
• Handbook of computational geometry

  2000cited by this paper
• Fundamental problems of algorithmic algebra

  1999influential reference
• Introduction to algorithms

  1996cited by this paper
• Algorithms for Knapsack Problems

  1995cited by this paper
• On a Class of O(n2) Problems in Computational Geometry

  1995cited by this paper
• Lower bounds for linear satisfiability problems

  1995cited by this paper
• Randomized algorithms

  1995cited by this paper
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

  1975cited by this paper
• Computing Partitions with Applications to the Knapsack Problem

  1974cited by this paper

• Signed Minkowski decompositions of convex polygons into minimum simplices and factorization of max-plus functions

  2025cites this paper
• The solution to the initial value problem for the ultradiscrete Somos-4 and 5 equations

  2017cites this paper
• Approximating Multidimensional Subset Sum and Minkowski Decomposition of Polygons

  2017cites this paper
• Approximating Multidimensional Subset Sum and the Minkowski Decomposition of Polygons ∗

  2016cites this paper
• Minkowski Decomposition and Geometric Predicates in Sparse Implicitization

  2015cites this paper
• The compatibility of admissible Minkowski decompositions

  2014cites this paper
• Deconstruction of Approximate Offsets via Minkowski Sums

  2012cites this paper
• Deconstructing Approximate Offsets

  2011cites this paper
• Classification of Gorenstein Toric Del Pezzo Varieties in arbitrary dimension

  2009cites this paper
• Polynomial irreducibility testing through Minkowski summand computation

  2008cites this paper
• Combinatorial aspects of mirror symmetry

  2007cites this paper
• Algebraic algorithms and applications to geometry

  2006cites this paper