Determining an architectural layout

A non-transitory computer-readable medium having stored thereon a computer program comprising instructions for performing a computer-implemented method, the method comprising:

• obtaining a cycle of points that represents a planar cross section of a cycle of walls, and, assigned to each respective point, a respective first datum that represents a direction normal to the cycle of points at the respective point;
• minimizing a Markov Random Field (MRF) energy defined on the cycle of points with labels taking values in a set of second datum each representing a respective direction normal to an architectural layout, thereby assigning, to each respective point, a respective one of the set of second datum, the MRF energy comprising a unary term that penalizes, for each point, an angular distance between the direction represented by the assigned second datum and the direction represented by the assigned first datum, the MRF energy further comprising a binary term that increasingly penalizes, for each couple of consecutive points, an angular distance between the directions represented by the assigned second datum as an angular distance between the directions represented by the assigned first datum decreases;
• identifying maximal sets of consecutive points to which a same second datum is assigned;
• and
• determining a cycle of vertices bounding a cycle of segments that represents the architectural layout, each segment corresponding to a respective wall, each segment fitting a respective maximal set and being normal to the direction represented by the second datum assigned to respective consecutive points of the respective maximal set.

A computer system comprising

• a processor coupled a memory, the memory having stored thereon a computer program comprising instructions for performing a computer-implemented method that when implemented by the processor cause the processor to be configured to:
• obtain a cycle of points that represents a planar cross section of a cycle of walls, and, assigned to each respective point, a respective first datum that represents a direction normal to the cycle of points at the respective point,
• minimize a Markov Random Field (MRF) energy defined on the cycle of points with labels taking values in a set of second datum each representing a respective direction normal to an architectural layout, thereby assigning, to each respective point, a respective one of the set of second datum, the MRF energy comprising a unary term that penalizes, for each point, an angular distance between the direction represented by the assigned second datum and the direction represented by the assigned first datum, the MRF energy further comprising a binary term that increasingly penalizes, for each couple of consecutive points, an angular distance between the directions represented by the assigned second datum as an angular distance between the directions represented by the assigned first datum decreases, identify maximal sets of consecutive points to which a same second datum is assigned, and
• determine a cycle of vertices bounding a cycle of segments that represents the architectural layout, each segment corresponding to a respective wall, each segment fitting a respective maximal set and being normal to the direction represented by the second datum assigned to respective consecutive points of the respective maximal set.