The point-in-polygon test is one of the most fundamental geometric tests and appears very frequently in geometric modeling and computer graphics. Many such algorithms dealing with the polygons of the linear edges, have been discussed. However, the algorithms dealing with the polygons including the curve edges are seldom discussed in the literatures. In this paper, by using the 4 x 4 determinant method and a sign correction technique, a parity algorithm dealing with the polygons including the curve edges is proposed, and a complete program for this algorithm is presented. By classifying an area surrounded by a curve edge and its corresponding virtual edge as a plus or minus one, and determining whether the test point is in the area or not, the curve edges can be processed in the same way as the linear edges.