Closed HalvesChen closed 1 year ago
Hi @HalvesChen, thanks for your interest in the project !
If you are interested in the superpoint-graphs computation as described in our paper, you will want to look into the following transforms:
CutPursuitPartition
- computes the hierarchical partitions, on point clouds equipped with point features and an adjacency graphRadiusHorizontalGraph
- computes the Superpoint-Graphs for each partition level. As stated in our paper, this implementation takes an approach different from SPG to circumvent the Delaunay triangulation bottleneck.For a better understanding of how the preprocessing works and which transforms are chained together, I invite you to have a look at the config/datamodule/*.yaml
of your dataset of interest.
Best,
Damien
Hi, thanks for your amazing job! I am interested in the implementation of Superpoint-Graphs Computation, could you tell me where the implementation please?