Delaunay triangulation of imprecise points in linear time after preprocessing

An assumption of nearly all algorithms in computational geometry is that the input points are given precisely, so it is interesting to ask what is the value of imprecise information about points. We show how to preprocess a set of disjoint unit disks in the plane in time so that if one point per disk is specified with precise coordinates, the Delaunay triangulation can be computed in linear time. From the Delaunay, one can obtain the Gabriel graph and a Euclidean minimum spanning tree; it is interesting to note the roles that these two structures play in our algorithm to quickly compute the Delaunay

コロイド過冷却液体における構造的不均一性と動的不均一性：共焦点顕微鏡による研究

The glass transition is often thought as decoupled from any structural change. I show in this thesis that two types of local order can be detected in a simple experimental glass former. This order increases when approaching the glass transition and is spatially correlated with the dynamic heterogeneities of the supercooled liquid.On envisage souvent la transition vitreuse comme découplée de tout changement structurel. Dans cette thèse, je montre que deux types d'ordre local peuvent être détectée dans un système vitreux expérimental simple. Cet ordre croit à l'approche de la transition vitreuse et est corrélé spatialement avec les hétérogénéités dynamiques du liquide surfondu

Advanced Knowledge Application in Practice

The integration and interdependency of the world economy leads towards the creation of a global market that offers more opportunities, but is also more complex and competitive than ever before. Therefore widespread research activity is necessary if one is to remain successful on the market. This book is the result of research and development activities from a number of researchers worldwide, covering concrete fields of research