  In this work we solve the packing problem for complete (n,3)-arcs in
PG(2,16), determining that the maximum size is 28 and the minimum size is 15.
We also performed a partial classification of the extremal size of complete
(n,3)-arcs in PG(2,16).
