Inverting Laguerre Tessellations

A Laguerre tessellation is a generalization of a Voronoi tessellation where the proximity between points is measured via a power distance rather than the Euclidean distance. Laguerre tessellations have found significant applications in materials science, providing improved modeling of (poly)crystalline microstructures and grain growth. There exist efficient algorithms to construct Laguerre tessellations from given sets of weighted generator points, similar to methods used for Voronoi tessellations. The purpose of this paper is to provide theory and methodology for the inverse construction; that is, to recover the weighted generator points from a given Laguerre tessellation. We show that, unlike the Voronoi case, the inverse problem is in general non-unique: different weighted generator points can create the same tessellation. To recover pertinent generator points, we formulate the inversion problem as a multimodal optimization problem and apply the cross-entropy method to solve it.

[1]  Dirk P. Kroese,et al.  The cross-entropy method for estimation , 2013 .

[2]  C. Lautensack,et al.  Fitting three-dimensional Laguerre tessellations to foam structures , 2008 .

[3]  Heiko Andrä,et al.  Laguerre tessellations for elastic stiffness simulations of closed foams with strongly varying cell sizes , 2012 .

[4]  Atsuyuki Okabe,et al.  Spatial Tessellations: Concepts and Applications of Voronoi Diagrams, Second Edition , 2000, Wiley Series in Probability and Mathematical Statistics.

[5]  David Hartvigsen,et al.  Recognizing Voronoi Diagrams with Linear Programming , 1992, INFORMS J. Comput..

[6]  Luc Oger,et al.  Voronoi and Radical Tessellations of Packings of Spheres , 2002, International Conference on Computational Science.

[7]  Volker Schmidt,et al.  Parametric Representation of 3D Grain Ensembles in Polycrystalline Microstructures , 2014 .

[8]  Dirk P. Kroese,et al.  The Cross-Entropy Method for Continuous Multi-Extremal Optimization , 2006 .

[9]  Jean-François Sadoc,et al.  The Laguerre polyhedral decomposition: application to protein folds , 2003 .

[10]  Lih-Yuan Deng,et al.  The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation, and Machine Learning , 2006, Technometrics.

[11]  Thomas M. Liebling,et al.  The Laguerre model of grain growth in two dimensions I. Cellular structures viewed as dynamical Laguerre tessellations , 1996 .

[12]  Hiroshi Ogawa,et al.  Molecular Dynamics Simulation of the Model Grain Boundary Structure of Polycrystalline Materials , 1996 .

[13]  Franziska Hoffmann,et al.  Spatial Tessellations Concepts And Applications Of Voronoi Diagrams , 2016 .

[14]  Sergei Zuyev,et al.  Random Laguerre tessellations , 2008, Advances in Applied Probability.

[15]  Franz Aurenhammer,et al.  Recognising Polytopical Cell Complexes and Constructing Projection Polyhedra , 1987, J. Symb. Comput..

[16]  D. G. Evans,et al.  Detecting Voronoi (area-of-influence) polygons , 1987 .

[17]  Ethan D. Bolker,et al.  Recognizing Dirichlet tessellations , 1985 .

[18]  Franz Aurenhammer,et al.  Power Diagrams: Properties, Algorithms and Applications , 1987, SIAM J. Comput..

[19]  Henning Friis Poulsen,et al.  On the Use of Laguerre Tessellations for Representations of 3D Grain Structures , 2011 .

[20]  C. Q. Lee,et al.  The Computer Journal , 1958, Nature.

[21]  Franz Aurenhammer,et al.  A criterion for the affine equivalence of cell complexes inRd and convex polyhedra inRd+1 , 1987, Discret. Comput. Geom..

[22]  Krzysztof J. Kurzydłowski,et al.  Structure of foams modeled by Laguerre–Voronoi tessellations , 2013 .

[23]  Dirk P. Kroese,et al.  Chapter 3 – The Cross-Entropy Method for Optimization , 2013 .

[24]  Hiroshi Imai,et al.  Revisiting Hyperbolic Voronoi Diagrams in Two and Higher Dimensions from Theoretical, Applied and Generalized Viewpoints , 2011, Trans. Comput. Sci..

[25]  A. Mocellin,et al.  The Laguerre model of grain growth in two dimensions II. Examples of coarsening simulations , 1996 .

[26]  Cheng Li,et al.  Inverting Dirichlet Tessellations , 2003, Comput. J..