AbstractA common problem in surveying practice is the partitioning of a land parcel into parts by lines of known direction. Part solutions have been based either on closed mathematical expressions or on approximate trial and error techniques and demand the use of semi-analytical methods. For this reason they are not appropriate in developing algorithms suitable for automation and the difficulties are more evident when the problem is to be solved repeatedly. An efficient algorithm is presented for application to convex polygons using coordinates. The algorithm does not require interactive manipulations and leads automatically to the exact solution. The main feature is a searching strategy in order to determine intersections between a clipping line and the polygon. An example is included in order to clarify the basic algorithmic steps, together with a program written in pseudo-code which facilitates the transformation of the algorithm into any specific computer language.