Summary: We discuss applications of quantum computation to geometric data processing. These applications include problems on convex hulls, minimum enclosing balls, linear programming, and intersection problems. Technically, we apply the well-known algorithm of \textit{L. K. Grover} [Proc. 28th annual ACM symposium 1996, 212--219 (1996; Zbl 0922.68044)] (and its variants) combined with geometric algorithms, and no further knowledge of quantum computing is required. However, revealing these applications and emphasizing potential usefulness of quantum computation in geometric data processing will promote research and development of quantum computers and algorithms.