Über das Kotziggewicht normaler Pflasterungen. (About the Kotzig weight of normal tilings.)

DOI10.1007/BF03323179zbMath0712.05022MaRDI QIDQ923091

Thomas Stehling

Publication date: 1990

Published in: Results in Mathematics (Search for Journal in Brave)

zbMATH Keywords

tilingslower boundscomputational geometryVoronoi diagramsconvex hullsrange searchDavenport-Schinzel sequencesalgebra computation tree modelminimal weight graphsspace partitions

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Combinatorial aspects of tessellation and tiling problems (05B45) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Descriptive geometry (51N05)

Related Items (1)

Light structures in infinite planar graphs without the strong isoperimetric property

Cites Work

• The theorems of Euler and Eberhard for tilings of the plane
• Analogues for Tilings of Kotzig'S Theorem on Minimal Weights of Edges
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Über das Kotziggewicht normaler Pflasterungen. (About the Kotzig weight of normal tilings.)