Counting problems relating to a theorem of Dirichlet

DOI10.1016/0925-7721(94)00013-1zbMath0816.68122OpenAlexW2041368538MaRDI QIDQ1841992

Evangelos Kranakis, Michel Pocchiola

Publication date: 9 April 1995

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/1435

zbMATH Keywords

computational geometryDirichlet's theorem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Primitive point packing ⋮ The diameter of lattice zonotopes ⋮ Primitive Points in Rational Polygons

Cites Work

• Extremal problems in discrete geometry
• Combinatorial complexity bounds for arrangements of curves and spheres
• Some results in combinatorial geometry
• Sets of visible points
• Évaluation de la différence entre l'aire d'une région plane convexe et le nombre des points aux coordonnées entières couverts par elle
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item