Various algorithms have been presented in the literature for contact detection between three-dimensional hi-convex objects, such as pharmaceutical tablets. Most are approximations to true hi-convex shapes, e.g., glued spheres, sphere-intersections, sphero-cylinders, and super-ellipsoids, and others, such as the discrete function representation, are computationally expensive. In this paper, algorithms are presented for determining if two, true hi-convex tablets, or a hi-convex tablet and an infinite plane, are in contact. A hi-convex tablet has two spherical caps and a cylindrical band. In all, ten contact scenarios are examined involving all components of the tablets, i.e., caps, band, and edges. In addition to checking for contact, relations for determining the contact location, overlap, and unit normal vector for the contact are presented for use in discrete element method computer simulations. These algorithms have been validated for single and multiple tablet scenarios: (a) comparing translational and angular velocities of a single hi-convex tablet impacting a flat plane, (b) comparing the fill fractions of hi-convex tablets in a container, and (c) comparing the dynamic angle of repose of hi-convex tablets in a rotating drum. (C) 2011 Elsevier Ltd. All rights reserved.