In the field of distributed systems, the Arbitrary Pattern Formation (APF) problem is an extensively studied problem. The purpose of APF is to design an algorithm to move a swarm of robots to a particular position in an environment (discrete or continuous) such that the swarm can form a specific but arbitrary pattern given previously to every robot as an input. In this paper, the solvability of the APF problem on a continuous circle is discussed for a swarm of oblivious and silent robots without chirality under a semi-synchronous scheduler. Firstly a class of configurations (the initial placements of the robots on the circle) called Formable Configuration (FC) has been provided which is necessary to solve the APF problem on a continuous circle. Then considering the initial configuration to be an FC, a deterministic and distributed algorithm has been provided that solves the APF problem for n robots on a continuous circle of fixed radius within O(n) epochs without collision, where an epoch is considered to be a time interval in which all robots are activated at least once.