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

Péter Balázs
2009 Discrete Applied Mathematics  
In this paper we summarize the most important generation methods developed for the subclasses of hv-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 hv-convex discrete sets and its subclasses. By using this benchmark set the paper also collects several statistics on hv-convex discrete sets, which are of great
more » ... nce in the analysis of algorithms for reconstructing such kinds of discrete sets.
doi:10.1016/j.dam.2009.02.019 fatcat:455iya3j2vaozjnootgdxgl3qm