How to optimize ETH smart contract size

PolygonCheckerV1.sol

contract PolygonChecker {
  struct PolygonData {
    int256[2][] points;
  }

  mapping(uint256 => PolygonData) polygons;

  function addPolygonPoint(uint256 polygonId, int256[2] memory point) public {
    polygons[polygonId].points.push(point);
  }

  function isInsidePolygonById(int256[2] memory _point, uint256 _polygonId) public view returns (bool) {
    return isInsidePolygon(polygons[_polygonId], _point);
  }

  function isInsidePolygon(PolygonData storage _polygon, int256[2] memory _point) internal view returns (bool) {
    bool inside = false;
    uint256 j = _polygon.points.length - 1;

    for (uint256 i = 0; i < _polygon.points.length; i++) {
      bool intersect = ((_polygon.points[i][1] > _point[1]) != (_polygon.points[j][1] > _point[1])) && (_point[0] < (_polygon.points[j][0] - _polygon.points[i][0]) * (_point[1] - _polygon.points[i][1]) / (_polygon.points[j][1] - _polygon.points[i][1]) + _polygon.points[i][0]);
      if (intersect) {
        inside = !inside;
      }
      j = i;
    }

    return inside;
  }
}