Summary: The theory and methods of linear algebra are a useful alternative to those of convex geometry in the framework of Voronoi cells and diagrams, which constitute basic tools of computational geometry. As shown by I. Voigt and S. Weis in [Beitr. Algebra Geom. 51, No. 2, 587–598 (2010; Zbl 1342.52021)], the Voronoi cells of a given set of sites \(T\), which provide a tesselation of the space called Voronoi diagram when \(T\) is finite, are solution sets of linear inequality systems indexed by \(T\). This paper exploits systematically this fact in order to obtain geometrical information on Voronoi cells from sets associated with \(T\) (convex and conical hulls, tangent cones and the characteristic cones of their linear representations). The particular cases of \(T\) being a curve, a closed convex set and a discrete set are analyzed in detail. We also include conclusions on Voronoi diagrams of arbitrary sets.