Centre de documentation
scientifique

Discrete Geometry for Computer Imagery, 8th International Conference, DGCI'99, Marne-la-Vallée, France, March 1999 / Gilles Bertrand (1999)  

Public Titre : Discrete Geometry for Computer Imagery, 8th International Conference, DGCI'99, Marne-la-Vallée, France, March 1999 : Proceedings Type de document : Actes de congrès Auteurs : Gilles Bertrand, Éditeur scientifique ; Michel Couprie, Éditeur scientifique ; Laurent Perroton, Éditeur scientifique Editeur : Berlin, Heidelberg, Vienne, New York, ... : Springer Année de publication : 1999 Collection : Lecture notes in Computer Science, ISSN 0302-9743 num. 1568 Conférence : DGCI 1999, 8th International Conference Discrete Geometry for Computer Imagery 17/03/1999 19/03/1999 Champs-sur-Marne [Paris Marne-la-Vallée] France Importance : 458 p. Format : 15 x 24 cm ISBN/ISSN/EAN : 978-3-540-65685-2 Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image [Termes IGN] quantité discrète [Termes IGN] représentation discrète [Termes IGN] topologie [Termes IGN] visualisation de données Résumé : (éditeur) These proceedings contain papers presented at the 8th Discrete Geometry for Computer Imagery conference, held 17-19, March 1999 at ESIEE, Marne-la-Vallee. The domains of discrete geometry and computer imagery are closely related. Discrete geometry provides both theoretical and algorithmic models for the processing, analysis and synthesis of images; in return computer imagery, in its variety of applications, constitutes a remarkable experimentational eld and is a source of challenging problems. The number of returning participants, the arrival each year of contributions from new laboratories and new researchers, as well as the quality and originality of the results have contributed to the success of the conference and are an - dication of the dynamism of this eld. The DGCI has become one of the major conferences related to this topic, including participating researchers and la- ratories from all over the world. Of the 41 papers received this year, 24 have been selected for presentation and 7 for poster sessions. In addition to these, four invited speakers have contributed to the conference. The site of Marne-la-Vallee, just 20 min away from Paris, is particularly well suited to hold the conference. Indeed, as a newly built city, it showcases a great amount of modern creative architecture, whose pure lines and original shapes offer a favorable context for the topic of Geometry. Numéro de notice : 19833 Affiliation des auteurs : non IGN Thématique : IMAGERIE/INFORMATIQUE Nature : Actes DOI : 10.1007/3-540-49126-0 En ligne : http://dx.doi.org/10.1007/3-540-49126-0 Format de la ressource électronique : URL Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=85929

Contient

• Rounding Voronoi diagrams / Olivier Devillers (1999)  

Exemplaires(1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
19833-01	CG.99	Livre	Centre de documentation	Congrès	Disponible

Rounding Voronoi diagrams / Olivier Devillers (1999)  

Public contenu dans Discrete Geometry for Computer Imagery, 8th International Conference, DGCI'99, Marne-la-Vallée, France, March 1999 / Gilles Bertrand (1999)   Titre : Rounding Voronoi diagrams Type de document : Article/Communication Auteurs : Olivier Devillers, Auteur ; Pierre-Marie Gandoin, Auteur Editeur : Berlin, Heidelberg, Vienne, New York, ... : Springer Année de publication : 1999 Collection : Lecture notes in Computer Science, ISSN 0302-9743 num. 1568 Conférence : DGCI 1999, 8th International Conference Discrete Geometry for Computer Imagery 17/03/1999 19/03/1999 Champs-sur-Marne [Paris Marne-la-Vallée] France Importance : pp 375 - 387 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Informatique [Termes IGN] diagramme de Voronoï [Termes IGN] géomètrie algorithmique Résumé : (auteur) Computational geometry classically assumes real-number arithmetic which does not exist in actual computers. A solution consists in using integer coordinates for data and exact arithmetic for computations. This approach implies that if the results of an algorithm are the input of another, these results must be rounded to match this hypothesis of integer coordinates. In this paper, we treat the case of two-dimensional Voronoi diagrams and are interested in rounding the Voronoi vertices to grid points while interesting properties of the Voronoi diagram are preserved. These properties are the planarity of the embedding and the convexity of the cells. We give a condition on the grid size to ensure that rounding to the nearest grid point preserves the properties. We also present heuristics to round vertices (not to the nearest grid point) and preserve these properties. Numéro de notice : C1999-076 Affiliation des auteurs : non IGN Thématique : INFORMATIQUE/MATHEMATIQUE Nature : Communication DOI : 10.1007/3-540-49126-0_29 En ligne : http://dx.doi.org/10.1007/3-540-49126-0_29 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=99619