default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuillaume Damiand
Person information
- affiliation: LIRS Lyon, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j31]Bastien Saillant
, Florence Zara, Guillaume Damiand, Fabrice Jaillet:
High-order elements in position-based dynamics. Vis. Comput. 40(7): 4737-4749 (2024)- 2022
- [j30]Pierre Bourquat, David Coeurjolly, Guillaume Damiand, Florent Dupont:
Hierarchical mesh-to-points as-rigid-as-possible registration. Comput. Graph. 102: 320-328 (2022) - [j29]Guillaume Damiand, Vincent Nivoliers:
Query-replace operations for topologically controlled 3D mesh editing. Comput. Graph. 106: 187-199 (2022) - 2021
- [j28]Guillaume Damiand, David Coeurjolly, Pierre Bourquat:
Stripped halfedge data structure for parallel computation of arrangements of segments. Vis. Comput. 37(9-11): 2461-2472 (2021) - 2020
- [j27]Guillaume Damiand, Florence Zara:
Merge-and-simplify operation for compact combinatorial pyramid definition. Pattern Recognit. Lett. 129: 48-55 (2020) - [j26]Guillaume Damiand, Eduardo Paluzo-Hidalgo, Ryan Slechta, Rocío González-Díaz:
Approximating lower-star persistence via 2D combinatorial map simplification. Pattern Recognit. Lett. 131: 314-321 (2020) - [j25]Karolina Golec, Jean-François Palierne, Florence Zara, Stéphane Nicolle, Guillaume Damiand:
Hybrid 3D mass-spring system for simulation of isotropic materials with any Poisson's ratio. Vis. Comput. 36(4): 809-825 (2020)
2010 – 2019
- 2019
- [c44]Guillaume Damiand, Rocío González-Díaz:
Persistent Homology Computation Using Combinatorial Map Simplification. CTIC 2019: 26-39 - 2018
- [j24]Guillaume Damiand, Aldo Gonzalez-Lorenzo, Florence Zara, Florent Dupont:
Distributed Combinatorial Maps for Parallel Mesh Processing. Algorithms 11(7): 105 (2018) - [j23]Guillaume Damiand, Aldo Gonzalez-Lorenzo, Jarek Rossignac, Florent Dupont:
Hierarchical representation for rasterized planar face complexes. Comput. Graph. 74: 161-170 (2018) - 2017
- [j22]Guillaume Damiand, Jarek Rossignac:
Rasterized Planar Face Complex. Comput. Aided Des. 90: 146-156 (2017) - 2016
- [c43]Guillaume Damiand, Rocío González-Díaz:
Parallel Homology Computation of Meshes. CTIC 2016: 53-64 - [c42]Benjamin Gorszczyk, Guillaume Damiand, Sylvie Servigne, Abdoulaye A. Diakité, Gilles Gesquière:
An Automatic Comparison Approach to Detect Errors on 3D City Models. UDMV 2016: 25-30 - 2015
- [j21]Sylvie Alayrangues, Guillaume Damiand, Pascal Lienhardt, Samuel Peltier:
Homology of Cellular Structures Allowing Multi-incidence. Discret. Comput. Geom. 54(1): 42-77 (2015) - [j20]Christine Solnon, Guillaume Damiand, Colin de la Higuera, Jean-Christophe Janodet:
On the complexity of submap isomorphism and maximum common submap problems. Pattern Recognit. 48(2): 302-316 (2015) - [c41]Guillaume Damiand, Sylvain Brandel, Donatello Conte:
Incremental Updating of 3D Topological Maps to Describe Videos. IWCIA 2015: 299-310 - [c40]Sébastien Horna, Guillaume Damiand, Abdoulaye A. Diakité, Daniel Méneveaux:
Combining Geometry, Topology and Semantics for Generic Building Description and Simulations. UDMV 2015: 13-18 - 2014
- [c39]Guillaume Damiand, Tristan Roussillon, Christine Solnon:
2D Topological Map Isomorphism for Multi-Label Simple Transformation Definition. DGCI 2014: 39-50 - [c38]Ken Arroyo Ohori, Guillaume Damiand, Hugo Ledoux:
Constructing an n-dimensional Cell Complex from a Soup of (n - 1)-Dimensional Faces. ICAA 2014: 37-48 - [c37]Donatello Conte, Guillaume Damiand:
Remove Noise in Video with 3D Topological Maps. S+SSPR 2014: 213-222 - [c36]Abdoulaye A. Diakité, Guillaume Damiand, Dirk Van Maercke:
Topological Reconstruction of Complex 3D Buildings and Automatic Extraction of Levels of Detail. UDMV 2014: 25-30 - [c35]Elsa Fléchon, Florence Zara, Guillaume Damiand, Fabrice Jaillet:
A Unified Topological-Physical Model for Adaptive Refinement. VRIPHYS 2014: 39-48 - [i1]Guillaume Damiand, Rocío González-Díaz, Samuel Peltier:
Removal and Contraction Operations in nD Generalized Maps for Efficient Homology Computation. CoRR abs/1403.3683 (2014) - 2013
- [j19]Colin de la Higuera, Jean-Christophe Janodet, Émilie Samuel, Guillaume Damiand, Christine Solnon:
Polynomial algorithms for open plane graph and subgraph isomorphisms. Theor. Comput. Sci. 498: 76-99 (2013) - [c34]Christine Solnon, Guillaume Damiand, Colin de la Higuera, Jean-Christophe Janodet:
On the Complexity of Submap Isomorphism. GbRPR 2013: 21-30 - [c33]Camille Combier, Guillaume Damiand, Christine Solnon:
Map Edit Distance vs. Graph Edit Distance for Matching Images. GbRPR 2013: 152-161 - [c32]Elsa Fléchon, Florence Zara, Guillaume Damiand, Fabrice Jaillet:
A generic topological framework for physical simulation. WSCG 2013: 104-113 - 2012
- [j18]Camille Combier, Guillaume Damiand, Christine Solnon:
From maximum common submaps to edit distances of generalized maps. Pattern Recognit. Lett. 33(15): 2020-2028 (2012) - [c31]Guillaume Damiand, Rocío González-Díaz, Samuel Peltier:
Removal Operations in nD Generalized Maps for Efficient Homology Computation. CTIC 2012: 20-29 - 2011
- [j17]Guillaume Damiand, Christine Solnon, Colin de la Higuera, Jean-Christophe Janodet, Émilie Samuel:
Polynomial algorithms for subisomorphism of nD open combinatorial maps. Comput. Vis. Image Underst. 115(7): 996-1010 (2011) - [j16]Romain Goffe, Luc Brun, Guillaume Damiand:
Tiled top-down combinatorial pyramids for large images representation. Int. J. Imaging Syst. Technol. 21(1): 28-36 (2011) - [j15]Guillaume Damiand, David Coeurjolly:
A generic and parallel algorithm for 2D digital curve polygonal approximation. J. Real Time Image Process. 6(3): 145-157 (2011) - [j14]Guillaume Damiand, Alexandre Dupas, Jacques-Olivier Lachaud:
Fully deformable 3D digital partition model with topological control. Pattern Recognit. Lett. 32(9): 1374-1383 (2011) - [j13]Stéphane Gosselin, Guillaume Damiand, Christine Solnon:
Efficient search of combinatorial maps using signatures. Theor. Comput. Sci. 412(15): 1392-1405 (2011) - [c30]Stéphane Gosselin, Guillaume Damiand, Christine Solnon:
Frequent Submap Discovery. CPM 2011: 429-440 - [c29]Camille Combier, Guillaume Damiand, Christine Solnon:
Measuring the Distance of Generalized Maps. GbRPR 2011: 82-91 - [c28]Romain Goffe, Luc Brun, Guillaume Damiand:
Tiled Top-Down Pyramids and Segmentation of Large Histological Images. GbRPR 2011: 255-264 - [c27]Guillaume Damiand, Alexandre Dupas, Jacques-Olivier Lachaud:
Combining Topological Maps, Multi-Label Simple Points, and Minimum-Length Polygons for Efficient Digital Partition Model. IWCIA 2011: 56-69 - 2010
- [b2]Guillaume Damiand:
Contributions aux Cartes Combinatoires et Cartes Généralisées : Simplification, Modèles, Invariants Topologiques et Applications. INSA de Lyon, Lyon - Villeurbanne, France, 2010 - [c26]Romain Goffe, Guillaume Damiand, Luc Brun:
A Causal Extraction Scheme in Top-Down Pyramids for Large Images Segmentation. SSPR/SPR 2010: 264-274
2000 – 2009
- 2009
- [j12]Sébastien Horna, Daniel Méneveaux, Guillaume Damiand, Yves Bertrand:
Consistency constraints and 3D building reconstruction. Comput. Aided Des. 41(1): 13-27 (2009) - [j11]Alexandre Dupas, Guillaume Damiand:
Region merging with topological control. Discret. Appl. Math. 157(16): 3435-3446 (2009) - [j10]Samuel Peltier, Adrian Ion, Walter G. Kropatsch, Guillaume Damiand, Yll Haxhimusa:
Directly computing the generators of image homology using graph pyramids. Image Vis. Comput. 27(7): 846-853 (2009) - [c25]Alexandre Dupas, Guillaume Damiand, Jacques-Olivier Lachaud:
Multi-Label Simple Points Definition for 3D Images Digital Deformable Model. DGCI 2009: 156-167 - [c24]Sylvie Alayrangues, Samuel Peltier, Guillaume Damiand, Pascal Lienhardt:
Border Operator for Generalized Maps. DGCI 2009: 300-312 - [c23]Guillaume Damiand, Colin de la Higuera, Jean-Christophe Janodet, Émilie Samuel, Christine Solnon:
A Polynomial Algorithm for Submap Isomorphism. GbRPR 2009: 102-112 - [c22]Fabien Baldacci, Achille J.-P. Braquelaire, Guillaume Damiand:
3D Topological Map Extraction from Oriented Boundary Graph. GbRPR 2009: 283-292 - [c21]Romain Goffe, Guillaume Damiand, Luc Brun:
Extraction of Tiled Top-down Irregular Pyramids from Large Images. IWCIA Special Track on Applications 2009: 123-137 - [c20]Stéphane Gosselin, Guillaume Damiand, Christine Solnon:
Signatures of Combinatorial Maps. IWCIA 2009: 370-382 - [c19]Romain Goffe, Luc Brun, Guillaume Damiand:
A Top Down Construction Scheme for Irregular Pyramids. VISAPP (1) 2009: 163-170 - 2008
- [j9]Guillaume Damiand:
Topological model for 3D image representation: Definition and incremental extraction algorithm. Comput. Vis. Image Underst. 109(3): 260-289 (2008) - [j8]Guillaume Damiand, Sylvie Alayrangues:
Computing Canonical Polygonal Schemata with Generalized Maps. Electron. Notes Discret. Math. 31: 287-292 (2008) - [c18]Mehdi Baba-ali, Guillaume Damiand, Xavier Skapin, David Marcheix:
Insertion and Expansion Operations for . DGCI 2008: 141-152 - [c17]Alexandre Dupas, Guillaume Damiand:
First Results for 3D Image Segmentation with Topological Map. DGCI 2008: 507-518 - [c16]Guillaume Damiand, David Coeurjolly:
A Generic and Parallel Algorithm for 2D Image Discrete Contour Reconstruction. ISVC (2) 2008: 792-801 - [c15]Guillaume Damiand, Samuel Peltier, Laurent Fuchs:
Computing Homology Generators for Volumes Using Minimal Generalized Maps. IWCIA 2008: 63-74 - [c14]Alexandre Dupas, Guillaume Damiand:
Comparison of Local and Global Region Merging in the Topological Map. IWCIA 2008: 420-431 - 2007
- [j7]Guillaume Damiand, Eric Andres:
Editorial. Image Vis. Comput. 25(10): 1519 (2007) - [c13]Samuel Peltier, Adrian Ion, Yll Haxhimusa, Walter G. Kropatsch, Guillaume Damiand:
Computing Homology Group Generators of Images Using Irregular Graph Pyramids. GbRPR 2007: 283-294 - [c12]Guillaume Damiand, Denis Arrivault:
A New Contour Filling Algorithm Based on 2D Topological Map. GbRPR 2007: 319-329 - [c11]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 - 2006
- [j6]Eric Andres, Guillaume Damiand, Pascal Lienhardt:
Introduction. Comput. Graph. 30(1): 29 (2006) - [j5]Carine Grasset-Simon, Guillaume Damiand, Pascal Lienhardt:
nD generalized map pyramids: Definition, representations and basic operations. Pattern Recognit. 39(4): 527-538 (2006) - [c10]Carine Grasset-Simon, Guillaume Damiand:
Generalized Map Pyramid for Multi-level 3D Image Segmentation. DGCI 2006: 530-541 - [c9]Guillaume Damiand, Samuel Peltier, Laurent Fuchs:
Computing Homology for Surfaces with Generalized Maps: Application to 3D Images. ISVC (2) 2006: 235-244 - [c8]Guillaume Damiand, Samuel Peltier, Laurent Fuchs, Pascal Lienhardt:
Topological Map: An Efficient Tool to Compute Incrementally Topological Features on 3D Images. IWCIA 2006: 1-15 - 2005
- [j4]Guillaume Damiand, Martine Dexet-Guiard, Pascal Lienhardt, Eric Andres:
Removal and contraction operations to define combinatorial pyramids: application to the design of a spatial modeler. Image Vis. Comput. 23(2): 259-269 (2005) - [c7]Carine Grasset-Simon, Guillaume Damiand, Pascal Lienhardt:
Receptive Fields for Generalized Map Pyramids: The Notion of Generalized Orbit. DGCI 2005: 56-67 - [c6]Carine Grasset-Simon, Guillaume Damiand, Pascal Lienhardt:
Pyramids of n-Dimensional Generalized Maps. GbRPR 2005: 142-152 - [e1]Eric Andres, Guillaume Damiand, Pascal Lienhardt:
Discrete Geometry for Computer Imagery, 12th International Conference, DGCI 2005, Poitiers, France, April 13-15, 2005, Proceedings. Lecture Notes in Computer Science 3429, Springer 2005, ISBN 3-540-25513-3 [contents] - 2004
- [j3]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) - 2003
- [j2]Guillaume Damiand, Patrick Resch:
Split-and-merge algorithms defined on topological maps for 3D image segmentation. Graph. Model. 65(1-3): 149-167 (2003) - [c5]Guillaume Damiand, Olivier Alata, Camille Bihoreau:
Using 2D Topological Map Information in a Markovian Image Segmentation. DGCI 2003: 288-297 - [c4]Guillaume Damiand, Pascal Lienhardt:
Removal and Contraction for n-Dimensional Generalized Maps. DGCI 2003: 408-419 - [c3]Achille J.-P. Braquelaire, Guillaume Damiand, Jean-Philippe Domenger, Frédéric Vidil:
Comparison and Convergence of Two Topological Models for 3D Image Segmenation. GbRPR 2003: 59-70 - 2002
- [c2]Guillaume Damiand, Patrick Resch:
Topological Map Based Algorithms for 3D Image Segmentation. DGCI 2002: 220-231 - 2001
- [b1]Guillaume Damiand:
Définition et étude d'un modèle topologique minimal de représentation d'images 2d et 3d. (Definition and study of a minimal topological model of 2d and 3d image representation). Montpellier 2 University, France, 2001 - [j1]Guillaume Damiand, Michel Habib, Christophe Paul:
A simple paradigm for graph recognition: application to cographs and distance hereditary graphs. Theor. Comput. Sci. 263(1-2): 99-111 (2001) - 2000
- [c1]Yves Bertrand, Guillaume Damiand, Christophe Fiorio:
Topological Encoding of 3D Segmented Images. DGCI 2000: 311-324
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-20 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
