A Room Search Algorithm Based on Minimum Cycle in an Online Intelligent Home Decoration Design Platform

The intelligent home decoration design platform is more and more popular with the deepening of artificial intelligent. Room search is a key step of a design platform, which determines the flexibility, real-time and accuracy. What's more, an intelligent platform should allows any users even an unprofessional user to design home decoration easily. However, some existing algorithms of platform cannot meet the requirements, especially, when there are bridges and overhangs in the 2D floor plan. In this paper, based on the minimum cycle theory, we propose an algorithm to search all the rooms of any given or drawn graph real-time and correctly. This algorithm can deal with the graph containing Bridges and overhangs effectively, and search accurately to find the minimum cycle(that is, the room) where they are located. The algorithm is tested well in practice.