Let Ω be a compact convex set in Euclidean n-space with nonempty interior. Random triangles are defined here by selecting three independent uniformly distributed points in Ω to be vertices. Generating such points for (n,Ω) = (2,unit square) or (n,Ω) = (3,unit cube) is straightforward. For (n,Ω) = (2,unit disk) or (n,Ω) = (3,unit ball), we use the following result [1]. Let X1, X2, X3, Y1, Y2, Y3...