This paper presents a parallel method of converting boundary to region quadtree. The method based on MIMD model has been implemented on DAWN1000 by comparing sequential results with the parallel results. The algorithm can be finished in O((B×logB)/P), where B is the number of chaincodes, and P is the number of processors. The algorithm can be applied widely in image processing, computer graphics, and pattern recognition etc.