There has been much attention on sophisticated algorithm design to compute geometric arrangements with both time and space efficiency. The issue of robustness and reliability has also been the subject of some interest, although mostly at the level of theory rather than practice and commercial grade implementation. What seems to have received very little attention is the need to prepare the data for successful processing. It is almost universally assumed that the data are valid and well presented and the only real challenge is to come up with a clever way of computing the results with progressively smaller time and space bounds. The aim of this paper is to narrow this gap by focusing entirely on input data anomalies, how to prepare the data for error free computation and how to post process the results for dowstream computing. The medial axis computation, using VRONI (Held, 2001, “VRONI: An Engineering Approach to the Reliable and Efficient Computation of Voronoi Diagram of Points and Line Segments,” Comput. Geom.—Theory Appl., 18, pp. 95–123), is singled out as an example and it is shown that based on how the data are prepared, the results can be vastly different. We argue in this paper that the success of geometric computing depends equally on algorithm design as well as on data processing. VRONI (and most geometric algorithms) does not understand the concept of noise, gaps, or aliasing. It only sees a polygon and generates the medial axis accordingly. It is the job of the applications engineer to prepare the data so that the output is acceptable.