ملخص: We show a new algorithm for computing in O(n) time a floor-plan of a given plane near-triangulation. We use modules which are the union of two rectangles and are T-, L- or I-shaped. Our algorithm has the following advantages: the number of T-shaped modules is at most , all T-shaped modules are uniformly directed, the size of the picture is at most n×n-1. A very important asset of our algorithm is its extraordinary simplicity.

لغة: إنجليزية