A class of counting problems asks for the number regions a central hyperplane arrangement. By duality, this is same as vertices zonotope. Efficient algorithms are known that solve problem by computing zonotope from its set generators. Here, we give an efficient algorithm, based on linear optimization oracle, performs inverse task and recovers generators vertices. We also provide variation algor...