How to replace recursion in my code on Java?

This code calculates the number of permutations for four points by 3 (no repetitions).
Arranged with recursion, but this is awkward for me.

import java.util.*;

public class Main {

    static int TOTAL_POINTS = 4, POINTS_ON_LINE = 3;

    static int[] temp = new int[POINTS_ON_LINE];

    public static void main(String[] args) {
        int[] points = new int[]{1,2,3,4};

        System.out.println("no repetitions:");
        p1(0,0, points);
    }

    static void p1(int nowPosition, int sizeArray, int[] points) {
        if (nowPosition == POINTS_ON_LINE) {
            System.out.println("Output:");
            System.out.println(Arrays.toString(temp));
        } else {
            for(int i = sizeArray + 1; i <= TOTAL_POINTS; i++) {
                temp[nowPosition] = points[i-1];
                p1(nowPosition + 1, i, points);
            }
        }
    }
}

Output:

no repetitions:
Output:
[1, 2, 3]
Output:
[1, 2, 4]
Output:
[1, 3, 4]
Output:
[2, 3, 4]

It is necessary to get rid of the recursive method call p1.
I tried to do so:

import java.util.*;

public class Main {

    static int TOTAL_POINTS = 4, POINTS_ON_LINE = 3;

    static int[] temp = new int[POINTS_ON_LINE];

    public static void main(String[] args) {
        int[] points = new int[]{1,2,3,4};

        System.out.println("no repetitions:");
        p1(points);
    }

    static void p1(int[] points) {
        int sizeArray = points.length;

        for(int i = sizeArray + 1; i < TOTAL_POINTS; i++, sizeArray = i) {
            int nowPosition = 0;

            if(nowPosition == POINTS_ON_LINE) {
                System.out.println("Output: " + Arrays.toString(temp));
            } else {
                temp[nowPosition] = points[i-1];
                nowPosition++;
            }
        }
    }
}

Result - Output on console - empty.
It didn't work for me.
How to replace recursion?

Method # 1 (thanks for the suggested option - @deadshot)

package com.company;

import java.util.*;
import java.util.stream.Collectors;
import java.util.stream.IntStream;

public class Main {

    static int TOTAL_POINTS = 4, POINTS_ON_LINE = 3;
    static int[] temp = new int[POINTS_ON_LINE];

    public static void main(String[] args) {
        int[] points = new int[]{1, 2, 3, 4};

        System.out.println("no repetitions:");
        p1(points, POINTS_ON_LINE);
    }

    public static void p1(int[] arr, int base) {
        int SIZE_ARRAY = arr.length;

        List<Integer> indices = IntStream.range(0, base).boxed().collect(Collectors.toList());

        for(Integer i : indices) {
            System.out.println("- " + i);
        }

        if (base < SIZE_ARRAY) {
            System.out.println("first");


            System.out.println(indices.stream().map(idx -> arr[idx]).collect(Collectors.toList()));
            boolean flag;
            int i;

            while (true) {
                flag = false;
                for (i = base - 1; i >= 0; i--)
                    if (indices.get(i) != i + SIZE_ARRAY - base) {
                        flag = true;
                        break;
                    }
                if (!flag)
                    return;
                indices.set(i, indices.get(i) + 1);
                for (int j = i + 1; j < base; j++)
                    indices.set(j, indices.get(j - 1) + 1);
                System.out.println(indices.stream().map(idx -> arr[idx]).collect(Collectors.toList()));

                for(Integer x : indices) {
                    System.out.println("- " + x);
                }
            }
        }
    }
}

I have used python itertools.combinations code as reference to implement the method.

public class Main {
static int TOTAL_POINTS = 4, POINTS_ON_LINE = 3;
static int[] temp = new int[POINTS_ON_LINE];
public static void main(String[] args) {
int[] points = new int[]{1, 2, 3, 4};
System.out.println("no repetitions:");
p1(points, POINTS_ON_LINE);
}
public static void p1(int[] arr, int r) {
int n = arr.length, i;
int[] indices = new int[r];
for (i = 0; i < r; i++)
indices[i] = i;
if (r < n) {
for (int idx : indices)
temp[idx] = arr[idx];
System.out.println(Arrays.toString(temp));
boolean flag;
while (true) {
flag = false;
for (i = r - 1; i >= 0; i--)
if (indices[i] != i + n - r) {
flag = true;
break;
}
if (!flag)
return;
indices[i] += 1;
for (int j = i + 1; j < r; j++)
indices[j] = indices[j - 1] + 1;
for (i = 0; i < r; i++)
temp[i] = arr[indices[i]];
System.out.println(Arrays.toString(temp));
}
}
}
}