The hexagon theorem

Authors:
D. Newman
Affiliations:
-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 6

Chaos and Graphics: Halftoning with minimum spanning trees and its application to maze-like images

Computers and Graphics
The optimal centroidal Voronoi tessellations and the gersho's conjecture in the three-dimensional space

Computers & Mathematics with Applications
Centroidal Voronoi tessellation in universal covering space of manifold surfaces

Computer Aided Geometric Design
A mathematical optimization approach for cellular radio network planning with co-siting

Wireless Networks
Aesthetic placement of points using generalized Lloyd relaxation

Computational Aesthetics'09 Proceedings of the Fifth Eurographics conference on Computational Aesthetics in Graphics, Visualization and Imaging
A distributed delaunay triangulation algorithm based on centroidal voronoi tessellation for wireless sensor networks

Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing

Quantified Score

Hi-index	754.84

Visualization

Abstract

We wish toint_{S}|Z-f(Z)|^{2},Sthe unit square, over all choices off(Z)which take just n values. For large n it is shown thatf(Z)approaches that function which on each face of a "hexagonal mesh" has the value of the centroid of that face. This problem in the design of quantizers for a pulse-code modulation (PCM) system arose in which pairs of adjacent samples are quantized in an effort to capitalize on the correlation between samples and on the geometry of the plane.