We present an approach to robust geometric algorithms, which we call the principle of independence. In this approach, we distinguish between independent judgments and dependent judgments, and use numerical computation only for independent judgments. The result of judgments is always consistent and hence algorithms behave stably even in the presence of large numerical errors. The basic idea of this principle is described with three examples.