The following pages link to Guillaume Damiand (Q391205):
Displayed 37 items.
- Polynomial algorithms for open plane graph and subgraph isomorphisms (Q391207) (← links)
- Efficient search of combinatorial maps using signatures (Q630606) (← links)
- Region merging with topological control (Q967403) (← links)
- On the complexity of submap isomorphism and maximum common submap problems (Q1677051) (← links)
- Distributed combinatorial maps for parallel mesh processing (Q2287496) (← links)
- Homology of cellular structures allowing multi-incidence (Q2354674) (← links)
- \(n\)D generalized map pyramids: definition, representations and basic operations (Q2369581) (← links)
- Parallel Homology Computation of Meshes (Q2815188) (← links)
- Removal Operations in nD Generalized Maps for Efficient Homology Computation (Q2900554) (← links)
- Measuring the Distance of Generalized Maps (Q3003450) (← links)
- Combining Topological Maps, Multi-Label Simple Points, and Minimum-Length Polygons for Efficient Digital Partition Model (Q3003522) (← links)
- Frequent Submap Discovery (Q3011873) (← links)
- 2D Topological Map Isomorphism for Multi-Label Simple Transformation Definition (Q3190063) (← links)
- A Polynomial Algorithm for Submap Isomorphism (Q3637692) (← links)
- 3D Topological Map Extraction from Oriented Boundary Graph (Q3637710) (← links)
- Multi-Label Simple Points Definition for 3D Images Digital Deformable Model (Q3648782) (← links)
- Border Operator for Generalized Maps (Q3648793) (← links)
- Signatures of Combinatorial Maps (Q3651629) (← links)
- Split-and-merge algorithms defined on topological maps for 3D image segmentation (Q4421342) (← links)
- (Q4450791) (← links)
- (Q4471805) (← links)
- Combinatorial Maps for 2D and 3D Image Segmentation (Q4648758) (← links)
- (Q4738262) (← links)
- On the Complexity of Submap Isomorphism (Q4922143) (← links)
- Map Edit Distance vs. Graph Edit Distance for Matching Images (Q4922159) (← links)
- Combinatorial Maps (Q5175455) (← links)
- Computing Canonical Polygonal Schemata with Generalized Maps (Q5301025) (← links)
- Graph-Based Representations in Pattern Recognition (Q5316450) (← links)
- Discrete Geometry for Computer Imagery (Q5316556) (← links)
- Computing Homology Group Generators of Images Using Irregular Graph Pyramids (Q5325744) (← links)
- A New Contour Filling Algorithm Based on 2D Topological Map (Q5325750) (← links)
- Generalized Map Pyramid for Multi-level 3D Image Segmentation (Q5386056) (← links)
- Insertion and Expansion Operations for n-Dimensional Generalized Maps (Q5458882) (← links)
- First Results for 3D Image Segmentation with Topological Map (Q5458922) (← links)
- Discrete Geometry for Computer Imagery (Q5902449) (← links)
- Discrete Geometry for Computer Imagery (Q5902461) (← links)
- Persistent homology computation using combinatorial map simplification (Q6085959) (← links)