VLDB 2026 Research / reviewers in the wild / expert
Guillaume Damiand
dblp:14/5261
· DBLP profile ↗
36ranked-venue papers
19as first author
6since 2021 · last 2025
0000-0003-1580-5517ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 20 · 10 first-author · 6 since 2021Artificial intelligence and machine learning · 12 · 8 first-authorTheory of computation · 4 · 1 first-author
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | A generic query-modify framework for volumetric mesh processing
Guillaume Damiand, Vincent Nivoliers, Romain Pascual |
Comput. Graph. | 1 |
| 2025 | Going Further With Vertex Block DescentabstractABSTRACT Vertex Block Descent (VBD) is a fast and robust method for the real‐time simulation of deformable objects using the finite element method. Originally, the method was designed for the popular linear tetrahedral elements. However, these elements have low accuracy and introduce locking artifacts. In this context, we propose an extension of VBD to: (i) support any isoparametric elements and shape function orders; (ii) improve its performance even for high‐order elements; and (iii) enhance convergence through the use of sub‐stepping. Overall, using other types of elements enables more accurate results while maintaining a computational cost comparable to linear tetrahedra. Bastien Saillant, Florence Zara, Fabrice Jaillet, Guillaume Damiand |
Comput. Animat. Virtual Worlds | 4 |
| 2024 | High-order elements in position-based dynamics
Bastien Saillant, Florence Zara, Guillaume Damiand, Fabrice Jaillet |
Vis. Comput. | 3 |
| 2022 | Hierarchical mesh-to-points as-rigid-as-possible registration
Pierre Bourquat, David Coeurjolly, Guillaume Damiand, Florent Dupont |
Comput. Graph. | 3 |
| 2022 | Query-replace operations for topologically controlled 3D mesh editing
Guillaume Damiand, Vincent Nivoliers |
Comput. Graph. | 1 |
| 2021 | Stripped halfedge data structure for parallel computation of arrangements of segments
Guillaume Damiand, David Coeurjolly, Pierre Bourquat |
Vis. Comput. | 1 |
| 2020 | Approximating lower-star persistence via 2D combinatorial map simplification
Guillaume Damiand, Eduardo Paluzo-Hidalgo, Ryan Slechta, Rocío González-Díaz |
Pattern Recognit. Lett. | 1 |
| 2020 | Merge-and-simplify operation for compact combinatorial pyramid definition
Guillaume Damiand, Florence Zara |
Pattern Recognit. Lett. | 1 |
| 2020 | Hybrid 3D mass-spring system for simulation of isotropic materials with any Poisson's ratio
Karolina Golec, Jean-François Palierne, Florence Zara, Stéphane Nicolle, Guillaume Damiand |
Vis. Comput. | 5 |
| 2018 | Hierarchical representation for rasterized planar face complexes
Guillaume Damiand, Aldo Gonzalez-Lorenzo, Jarek Rossignac, Florent Dupont |
Comput. Graph. | 1 |
| 2017 | Rasterized Planar Face Complex
Guillaume Damiand, Jarek Rossignac |
Comput. Aided Des. | 1 |
| 2015 | Incremental Updating of 3D Topological Maps to Describe Videos
Guillaume Damiand, Sylvain Brandel, Donatello Conte |
IWCIA | 1 |
| 2015 | Homology of Cellular Structures Allowing Multi-incidence
Sylvie Alayrangues, Guillaume Damiand, Pascal Lienhardt, Samuel Peltier |
Discret. Comput. Geom. | 2 |
| 2015 | On the complexity of submap isomorphism and maximum common submap problems
Christine Solnon, Guillaume Damiand, Colin de la Higuera, Jean-Christophe Janodet |
Pattern Recognit. | 2 |
| 2013 | Polynomial algorithms for open plane graph and subgraph isomorphisms
Colin de la Higuera, Jean-Christophe Janodet, Émilie Samuel, Guillaume Damiand, Christine Solnon |
Theor. Comput. Sci. | 4 |
| 2012 | From maximum common submaps to edit distances of generalized maps
Camille Combier, Guillaume Damiand, Christine Solnon |
Pattern Recognit. Lett. | 2 |
| 2011 | Frequent Submap Discovery
Stéphane Gosselin, Guillaume Damiand, Christine Solnon |
CPM | 2 |
| 2011 | Combining Topological Maps, Multi-Label Simple Points, and Minimum-Length Polygons for Efficient Digital Partition Model
Guillaume Damiand, Alexandre Dupas, Jacques-Olivier Lachaud |
IWCIA | 1 |
| 2011 | Polynomial algorithms for subisomorphism of nD open combinatorial maps
Guillaume Damiand, Christine Solnon, Colin de la Higuera, Jean-Christophe Janodet, Émilie Samuel |
Comput. Vis. Image Underst. | 1 |
| 2011 | Fully deformable 3D digital partition model with topological control
Guillaume Damiand, Alexandre Dupas, Jacques-Olivier Lachaud |
Pattern Recognit. Lett. | 1 |
| 2011 | Efficient search of combinatorial maps using signatures
Stéphane Gosselin, Guillaume Damiand, Christine Solnon |
Theor. Comput. Sci. | 2 |
| 2009 | Signatures of Combinatorial Maps
Stéphane Gosselin, Guillaume Damiand, Christine Solnon |
IWCIA | 2 |
| 2009 | Consistency constraints and 3D building reconstruction
Sébastien Horna, Daniel Meneveaux, Guillaume Damiand, Yves Bertrand |
Comput. Aided Des. | 3 |
| 2009 | Region merging with topological control
Alexandre Dupas, Guillaume Damiand |
Discret. Appl. Math. | 2 |
| 2009 | Directly computing the generators of image homology using graph pyramids
Samuel Peltier, Adrian Ion, Walter G. Kropatsch, Guillaume Damiand, Yll Haxhimusa |
Image Vis. Comput. | 4 |
| 2008 | Computing Homology Generators for Volumes Using Minimal Generalized Maps
Guillaume Damiand, Samuel Peltier, Laurent Fuchs |
IWCIA | 1 |
| 2008 | Comparison of Local and Global Region Merging in the Topological Map
Alexandre Dupas, Guillaume Damiand |
IWCIA | 2 |
| 2008 | Topological model for 3D image representation: Definition and incremental extraction algorithm
Guillaume Damiand |
Comput. Vis. Image Underst. | 1 |
| 2007 | Editorial
Guillaume Damiand, Eric Andres |
Image Vis. Comput. | 1 |
| 2006 | Topological Map: An Efficient Tool to Compute Incrementally Topological Features on 3D Images
Guillaume Damiand, Samuel Peltier, Laurent Fuchs, Pascal Lienhardt |
IWCIA | 1 |
| 2006 | Introduction
Eric Andres, Guillaume Damiand, Pascal Lienhardt |
Comput. Graph. | 2 |
| 2006 | nD generalized map pyramids: Definition, representations and basic operations
Carine Grasset-Simon, Guillaume Damiand, Pascal Lienhardt |
Pattern Recognit. | 2 |
| 2005 | Removal and contraction operations to define combinatorial pyramids: application to the design of a spatial modeler
Guillaume Damiand, Martine Dexet, Pascal Lienhardt, Eric Andres |
Image Vis. Comput. | 1 |
| 2004 | Topological model for two-dimensional image representation: definition and optimal extraction algorithm
Guillaume Damiand, Yves Bertrand, Christophe Fiorio |
Comput. Vis. Image Underst. | 1 |
| 2003 | Split-and-merge algorithms defined on topological maps for 3D image segmentation
Guillaume Damiand, Patrick Resch |
Graph. Model. | 1 |
| 2001 | A simple paradigm for graph recognition: application to cographs and distance hereditary graphs
Guillaume Damiand, Michel Habib, Christophe Paul |
Theor. Comput. Sci. | 1 |