Polygon offsetting is a fundamental problem in the field of computer graphics

computational geometry

and computer-aided geometry design

and it has many applications. A pixel-based domain subdivision algorithm is proposed in this paper to deal with various types of polygon offsetting effectively. The given domain is subdivided with quadtree data structure

and the sets of all those pixels that are on polygon offsets are calculated with interval arithmetic. For polygons that are composed of line segments only

the shortest distance operator is used between point and line to speed up calculations. Pixel-based domain subdivision algorithm for polygon offsetting can handle different types of polygon offsetting problems

and it is compared with traditional pixel-based polygon offsetting expansion algorithm. The experimental results show that the proposed algorithm can deal with all kinds of polygon offsetting problems effectively. The performance of the proposed algorithm is better on the processing of vertices than that of traditional expansion algorithm. The proposed algorithm is also less time consuming than traditional expansion algorithm. Compared with traditional edge offsetting algorithm

the proposed algorithm has more extensive applicable scope

and it can effectively deal with various types of polygon offsetting problems that traditional edge offsetting algorithm fails. A new pixel-based domain subdivision algorithm for polygon offsetting is proposed in this paper. The proposed algorithm does not need to consider intersection and connection problems

and it can handle various types of polygon offsetting problems that many other conventional algorithms fail

such as when polygon contains arcs and islands.