The Contour Map Of Complex Constraints Filling Method Research And Implementation

Scientific computing visualization is based on the application of graphics and image processing technology., by which a series of effective data obtained by the experiment can be expressed by using different point, line and surface technology. As an important expression form of computer visualization, contour map, with its intuitive, becomes the focus of researchers. And among them, the isoline map of filling, because of its good description of the details and the ability to distinguish things, gradually caused the attention of people.In view of the contour map filling problem, we use graphics two-dimensional cutting methods and the topology relation recognition methods to carry out the research. Based on the tracking contour data,we use two-dimensional cutting methods to form the relatively independent basic graphics.And then according to the building of BSP tree we describe the topological relationship between basic graphics. Finally we complete the contour map visualization interaction system. The main content of the thesis are as follows:1. In view of the existing methods based on rectangular border area of the contour map of filling, We propose to use BSP trees to complete the area filling of the complex boundary contour map. In this paper, we implemented the closure of contour map borders, the search for complex polygons, the judgment of contour map topology, and then we bulit the contour map BSP tree table which is based on topological relation. Finally we selected an appropriate color table and accomplished the contour map filling according to the structures above.2. In view of the contour map containing fault,we analyze the basic characteristics of the fault. We use bounding box data processing method to judge the contour endpoint in fault. According to the minimum angle of rotation to boundary and outer boundary along the fault complex polygons, we can track the complex polygons and tell the polygon topology contains relations. According to the operation above, we can finally complete the filling of the contour map containing fault.3. According to the process of the contour map filling method, we implement a visual interactive contour filling system. Combined with human-computer interaction, we can choose the containing fault contour data and normal contour data. After choosing we compelte the contour map filling by using contour scanning method and area filling method. Through the effective validation of different data, this method has been proved to achieve good resultsTo sum up, this article aimed at solving the contour map filling problem. In order to achieve this goal,we propose BSP tree table to complete the filling of contour map with complicated boundary. On this basis we take the influence of the fault into consideration and complete the filling of contour map with fault. After the opertions above, we implement a visual interactive contour filling system. Through the effective validation of different datas, good experiment and application results have been achieved.