A July 2007 symposium brought together researchers from many disciplines to present the latest developments and applications of Voronoi diagrams, a type of data structure in computational geometry. Key topics for the symposium were theoretical aspects of Voronoi diagrams, computational and implementation aspects of Voronoi diagrams, generalization of Voronoi diagrams, Voronoi art, and applications of the Voronoi/Delaunay methodology to other areas. Papers from the symposium are presented here, covering specific topics such as greedy beta-skeletons in three dimensions, high-order Voronoi sculpture, and the role of quasi-regular tetrahedra in dense ordered packings of hard spheres. Other subjects examined include a new algorithm in geometry of numbers, variants of a jump flooding algorithm for computing discrete Voronoi diagrams, and Voronoi tessellations, spatial patterns, and clustering across the universe. There is no subject index. Annotation ©2007 Book News, Inc., Portland, OR (booknews.com)
