EFFICIENT ENUMERATION OF GRID POINTS IN A CONVEX POLYGON AND ITS APPLICATION TO INTEGER PROGRAMMING

DOI10.1142/S0218195994000069zbMath0807.90086MaRDI QIDQ4292531

Naoyoshi Kanamaru, Takao Nishizeki, Tetsuo Asano

Publication date: 1 March 1995

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

computational geometry problems

Mathematics Subject Classification ID

Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (2)

A linear algorithm for integer programming in the plane ⋮ On integer Chebyshev polynomials

This page was built for publication: EFFICIENT ENUMERATION OF GRID POINTS IN A CONVEX POLYGON AND ITS APPLICATION TO INTEGER PROGRAMMING