Realizable quadruples for hex-polygons. Combinatorics of honeycombs

DOI10.1007/s00373-006-0688-6zbMath1121.52005OpenAlexW2067605785MaRDI QIDQ878059

Krzysztof Kołodziejczyk

Publication date: 26 April 2007

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-006-0688-6

zbMATH Keywords

Boundary characteristicH-pointHex-polygonHexagonal tilingLattice pointLattice polygonPick-type theorem

Mathematics Subject Classification ID

Convex sets in (2) dimensions (including convex curves) (52A10) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)

Related Items

A disproof of the conjecture about boundary \(H\)-points of \(H\)-triangles ⋮ \(H\)-triangles with \(k\) interior \(H\)-points ⋮ A note on the number of vertices of the Archimedean tiling ⋮ A note on area of lattice polygons in an Archimedean tiling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A proof of Coleman's conjecture
• The boundary characteristic and Pick's theorem in the Archimedean planar tilings
• A new Pick-type theorem on the hexagonal lattice
• Areas of lattice figures in the planar tilings with congruent regular polygons
• Primitive and mensurable hex-triangles
• Areas of generalized \(H\)-polygons
• The Fascination of the Elementary
• Minimal requirements for Minkowski's theorem in the plane I
• On convex lattice polygons
• Stretch: A Geoboard Game
• A Fast Pick-Type Approximation for Areas of H-Polygons

This page was built for publication: Realizable quadruples for hex-polygons. Combinatorics of honeycombs