פריקות של פאונים קמורים (Decomposibility of convex polytopes.). - Michael Kallay (1979)

The Complexity of Incremental Convex Hull Algorithms in Rd. - Michael Kallay (Inf. Process. Lett., 1984)

Convex Hull Made Easy. - Michael Kallay (Inf. Process. Lett., 1986)

Plane curves of minimal energy. - Michael Kallay (ACM Trans. Math. Softw., 1986)

Optimal twist vectors as a tool for interpolating a network of curves with a minimum energy surface. - Michael Kallay; Bahram Ravani (Comput. Aided Geom. Des., 1990)

General b-spline hermite interpolation. - Michael Kallay (Comput. Aided Geom. Des., 1991)

Computing the unit normal on a degenerate edge. - Damien N. Berger; Michael Kallay (Comput. Aided Des., 1992)

Monotone linear rational spline interpolation. - Richard D. Fuhr; Michael Kallay (Comput. Aided Geom. Des., 1992)

Subdivision Algorithms and the Kernel of a Polyhedron. - R. J. Gardner; Michael Kallay (Discret. Comput. Geom., 1992)

Constrained Optimization in Surface Design. - Michael Kallay (Modeling in Computer Graphics, 1993)

Object-oriented paradigm for curve and surface design. - Richard D. Fuhr; Lwo Hsieh; Michael Kallay (Comput. Aided Des., 1995)

A geometric Newton-Raphson strategy. - Michael Kallay (Comput. Aided Geom. Des., 2001)

Computing Tight Bounds for a Bézier Curve. - Michael Kallay (J. Graphics, GPU, & Game Tools, 2002)

Improving the Two-Pass Resampling Algorithm. - Michael Kallay; Jason Lawrence (J. Graphics, GPU, & Game Tools, 2003)

Computing the Moment of Inertia of a Solid Defined by a Triangle Mesh. - Michael Kallay (J. Graph. Tools, 2006)

Defining edges on a round earth. - Michael Kallay (GIS, 2007)

Geometric algorithms on an ellipsoid earth model. - Michael Kallay (GIS, 2008)

Defining circular arcs on a round earth. - Michael Kallay (COM.Geo, 2010)