A benchmark set for the reconstruction of hvhv-convex discrete sets

In this paper we summarize the most important generation methods developed for the subclasses of hvhv-convex discrete sets. We also present some new generation techniques to complement the former ones thus making it possible to design a complete benchmark set for testing the performance of reconstruction algorithms on the class of hvhv-convex discrete sets and its subclasses. By using this benchmark set the paper also collects several statistics on hvhv-convex discrete sets, which are of great importance in the analysis of algorithms for reconstructing such kinds of discrete sets.