Concept

Centroidal Voronoi tessellation

Publications associées (34)

Fast Euclidean distance transformations by propagation using multiple neighbourhoods

We propose a new exact Euclidean distance transformation (DT) by propagation, using bucket sorting. A fast but approximate DT is first computed using a coarse neighborhood. A sequence of larger neighborhoods is then used to gradually improve this approxima ...

1999

The Laguerre model of grain growth in two dimensions I. Cellular structures viewed as dynamical Laguerre tessellations

Thomas Liebling

The basic concepts of a deterministic model for simulating grain growth or foam coarsening in two dimensions are presented, and the fundamental tools necessary for its implementation into computer codes are provided. It is assumed that the actual cell stru ...

1996

The Laguerre model of grain growth in two dimensions II. Examples of coarsening simulations

Thomas Liebling

The basic concepts of a deterministic scheme for simulating grain growth or foam coarsening in two dimensions have been presented in Part I. Implementation of the corresponding Laguerre (or weighted Voronoi) diagram in computer manageable practical terms i ...

1996

Simulating and modelling grain growth as the motion of a weighted Voronoi diagram

Thomas Liebling

Laguerre (or weighted Voronoi) diagrams are used as geometric idealization of 2-d polycrytals. The approximation is satisfactory. These cell structures are entirely defined by a set of weighted sites, and their motion (including the induced topological tra ...

1992

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search