We present a property satisfied by a large variety of complex continued fraction algorithms (the "finite building property") and use it to explore the structure of bijectivity domains for natural extensions of Gauss maps. Specifically, we show that these domains can each be given as a finite union of Cartesian products in C × C. In one complex coordinate, the sets come from explicit manipulation of the continued fraction algorithm, while in the other coordinate the sets are determined by experimental means.2 ), respectively. In [15], Katok-Ugarcovici use the natural extension to calculate the invariant measure for any (a, b)-continued fraction Gauss map. In the complex setting, this method was applied by Tanaka [20] to the nearest even integer algorithm and by Ei et al. [7] to the nearest integer algorithm.In this paper, we investigate complex continued fractions and their Gauss maps' natural extensions G acting on C × C. In particular, we describe a substitute for Date: 23 October 2019.