In this thesis, we consider the problem of reconstructing rectilinear polygons with minimum area, from a sequence of angles of vertices. We provide two results: 1. Studying properties of n-vertex rectilinear polygons with minimum area, classifying those polygons into four types by these properties, and computing the number of polygons in each of three of them. 2. Given a sequence S of angles of a monotone rectilinear polygon, we propose a formula to compute the minimum of area of monotone rectilinear polygons with turn sequence S.