**Graph Reconstruction** Challenge Database (GRCD)

**Problem**: given a noisy sample of a planar graph G, find a graph that has the same homotopy/topology type as G and is geometrically close to G.**Input**: a point cloud as a txt file with a list of coordinates x y per row.**Output**: a reconstructed graph as a txt file with a list of coordinates x y (per row) of vertices indexed from 0 to n-1, then a list of edges as pairs u v (per row) of vertex indexes.- Available input data: hundreds of noisy samples of synthetic graphs and Egyptian hieroglyphs.
- Available ground truth: original polygonal line graphs (in the same form as input data)
- C++ code of the algorithm HoPeS extracting a suitable subgraph for reconstruction.
- The benchmarking C++ code for comparison with ground truth will be ready soon.
**Example**: hieroglyph -> noisy sample -> persistence diagram -> reconstruction

Back to Top of this page | Back to Home page