With IDL Object Graphics, plotting two graphics with different data extents in the same graphic window requires normalizing the range of the second graphic to fit the extension of the first one. If not, the two graphics will not fit within the same view.

QHULL is an IDL routine to apply Quick Hull algorithm for various applications.

Bibliography: “The Quickhull Algorithm for Convex Hulls,” ACM Transactions on Mathematical Software, Vol. 22, No 4, December 1996, Pages 469-483, Barber, Dobkin and Huhdanpaa

One application consists in building the largest convex polygon around a set of random points. The example below is showing how to use QHULL in such context.

This article describes how to pass an IDL structure into an IDL-IDL bridge child process using a work-around via IDLDehydrate and JSON_SERIALIZE.