Efficient lattice width computation in arbitrary dimension

DOI10.1007/978-3-642-04397-0_5MaRDI QIDQ3648771zbMATH OpenOpenAlexFDO

Authors Émilie Charrier, Fabien Feschet, Lilian Buzer

Publication date 1 December 2009

Published in Discrete Geometry for Computer Imagery (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04397-0_5

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)

Recommendations

• Computing efficiently the lattice width in any dimension
• FPT-algorithm for computing the width of a simplex given by a convex hull
• Computing the width of a set
• A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
• Lattice size of plane convex bodies

Cites work

• scientific article; zbMATH DE number 3848644 (Why is no real title available?)
• scientific article; zbMATH DE number 1234104 (Why is no real title available?)
• scientific article; zbMATH DE number 1121921 (Why is no real title available?)
• scientific article; zbMATH DE number 1121922 (Why is no real title available?)
• scientific article; zbMATH DE number 1757949 (Why is no real title available?)
• scientific article; zbMATH DE number 1860211 (Why is no real title available?)
• scientific article; zbMATH DE number 1433426 (Why is no real title available?)
• A Polynomial Algorithm for the Two-Variable Integer Programming Problem
• A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
• A linear algorithm for integer programming in the plane
• Computing Two-Dimensional Integer Hulls
• Computing the width of a set
• Finding Extremal Polygons
• Finding a shortest vector in a two-dimensional lattice modulo m
• Higher dimensional continued fractions
• Integer Programming with a Fixed Number of Variables
• Minimal ellipsoids and maximal simplexes in 3D Euclidean space
• On integer points in polyhedra
• Production Sets with Indivisibilities, Part I: Generalities
• Simultaneous inner and outer approximation of shapes
• The Generalized Gauss Reduction Algorithm

Cited in

(5)

• Lattice size of plane convex bodies
• The minimal fibering degree of a toric variety equals the lattice width of its polytope
• FPT-algorithm for computing the width of a simplex given by a convex hull
• Computing efficiently the lattice width in any dimension
• Computing rank-width exactly

This page was built for publication: Efficient lattice width computation in arbitrary dimension

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