Dear Dan Zeng,
are you looking for superlevel set components? In this case I would do the following:
1. Load the data (lets assume the scalar array is called S)
2. Simplify by Persistence (threshold will need to be adjusted manually)
3. Use the calculator to create a new scalar field: the component mask (0: background, 1: component). The expression can simply be: S > SomeIsoValue.
4. Either export the data and count vertex values manually, or you can use the histogram filter in paraview.
Regarding connectivity: TTK assumes that the underlying domain is a simplicial complex (so classical voxel-connectivity like 6 or 26 does not apply). Even if the data is a regular grid, TTK will assume an implicit triangulation behind the scenes. If you want to make sure that everything is consistent you can use the Tetrahedralize filter after loading the data. This will turn your domain into an explicit simplicial complex.
To compute connected components consistent with the neighborhood relationship maintained by TTK you can use the new filter that will be merged into TTK via this pull request:
https://github.com/topology-tool-kit/ttk/pull/730.
Best
Jonas Lukasczyk
> --
> You received this message because you are subscribed to the Google Groups "ttk-users" group.
> To unsubscribe from this group and stop receiving emails from it, send an email to
ttk-users+...@googlegroups.com.
> To view this discussion on the web visit
https://groups.google.com/d/msgid/ttk-users/CABRwK2etPVes3bg_WNXsTC5JVCZBhH9VUoKJ0Rs7Dm7K2qC-qA%40mail.gmail.com (
https://groups.google.com/d/msgid/ttk-users/CABRwK2etPVes3bg_WNXsTC5JVCZBhH9VUoKJ0Rs7Dm7K2qC-qA%40mail.gmail.com?utm_medium=email&utm_source=footer).
>