( en | de | ru )

 

Disambiguation of "Damiand, Guillaume"

Author of the publication

copydeleteadd this publication to your clipboard
nD generalized map pyramids: Definition, representations and basic operations.

, , and . Pattern Recognit., 39 (4): 527-538 (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Guillaume Pierre

Guillaume Klein

Guillaume Schurgers

Guillaume Weick

Guillaume Jacques

 

Other publications of authors with the same name

Editorial., and . Image Vis. Comput., 25 (10): 1519 (2007)Computing Canonical Polygonal Schemata with Generalized Maps., and . Electron. Notes Discret. Math., (2008)Rasterized Planar Face Complex., and . Comput. Aided Des., (2017)Removal and Contraction for n-Dimensional Generalized Maps., and . DGCI, volume 2886 of Lecture Notes in Computer Science, page 408-419. Springer, (2003)Topological Map Based Algorithms for 3D Image Segmentation., and . DGCI, volume 2301 of Lecture Notes in Computer Science, page 220-231. Springer, (2002)Constructing an n-dimensional Cell Complex from a Soup of (n - 1)-Dimensional Faces., , and . ICAA, volume 8321 of Lecture Notes in Computer Science, page 37-48. Springer, (2014)Comparison and Convergence of Two Topological Models for 3D Image Segmenation., , , and . GbRPR, volume 2726 of Lecture Notes in Computer Science, page 59-70. Springer, (2003)Receptive Fields for Generalized Map Pyramids: The Notion of Generalized Orbit., , and . DGCI, volume 3429 of Lecture Notes in Computer Science, page 56-67. Springer, (2005)Building 3D indoor scenes topology from 2D architectural plans., , , and . GRAPP (GM/R), page 37-44. INSTICC - Institute for Systems and Technologies of Information, Control and Communication, (2007)Split-and-merge algorithms defined on topological maps for 3D image segmentation., and . Graph. Model., 65 (1-3): 149-167 (2003)