Abstract: A system and method for concurrently operating multiple operating system environments on a hardware platform. A dominant personality server is provided to control basic system configuration and resources. Subdominant servers are provided to support applications for other operating systems. Binary compatibility is supported for each dominant and subdominant operating system personality. Personality neutral services are extracted from each operating system environment and coalesced in personality neutral servers. Interprocess communications are implemented using defined object oriented and procedural interfaces. Server response and conflict resolution are handled by the dominant personality neutral server. Any supported operating system can be the dominant server by selection of the operator.

Abstract: Two polygon fill algorithms are presented for filling polygons on a graphics display. The first polygon fill algorithm fills polygons that are strictly convex. The second polygon fill algorithm fills a larger class of polygons than the first polygon fill algorithm which includes polygons being concave in the x direction, and polygons having crossing lines. The first polygon fill algorithm tests the polygon for strict convexity by testing for a consistent turning direction, and by testing for once around in the y direction. The first polygon fill algorithm then stores the maximum and minimum value of the pel selected by the Bresenham algorithm for each scan line of the polygon. The fill line is drawn from the pel having the minimum value to the pel having the maximum value for each scan line of the polygon. The second polygon fill algorithm tests the polygon to ensure that it can be filled with one unique fill line for each scan line of the polygon.