Guillaume Damiand

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Yves Bertrand

> Home > Persons > Guillaume Damiand

Publications

2009
[j12]
- view
  authority control:
- export record
  dblp key:
  - journals/cad/HornaMDB09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cad/HornaMDB09
Sébastien Horna, Daniel Méneveaux, Guillaume Damiand, Yves Bertrand:
Consistency constraints and 3D building reconstruction. Comput. Aided Des. 41(1): 13-27 (2009)
2007
[c11]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/grapp/HornaDMB07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/grapp/HornaDMB07
Sébastien Horna, Guillaume Damiand, Daniel Méneveaux, Yves Bertrand:
Building 3D indoor scenes topology from 2D architectural plans. GRAPP (GM/R) 2007: 37-44
2004
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/cviu/DamiandBF04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cviu/DamiandBF04
Guillaume Damiand, Yves Bertrand, Christophe Fiorio:
Topological model for two-dimensional image representation: definition and optimal extraction algorithm. Comput. Vis. Image Underst. 93(2): 111-154 (2004)
2000
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/dgci/BertrandDF00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dgci/BertrandDF00
Yves Bertrand, Guillaume Damiand, Christophe Fiorio:
Topological Encoding of 3D Segmented Images. DGCI 2000: 311-324

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.