Meeting Summary: Amber, Bala, & Bei

We are interested in either extending or generalizing current work on contour boxplots. Current approaches make use of a notion of depth of a data point. For instance in , consider the points . The data point would have as it is contained in 3 intervals (, , and ) where as as it is contained in 4 intervals. One may view as a measure of centrality. Hence, we can view the median entry as the entry of maximal depth.

We would like to use this notion of depth in the case of a data set consisting of curves. However, identifying containment of a curve between two other curves is less clear as we see in the example below:

center

The red curve above doesn’t lie between the two curves, but most of the curve does. Perhaps we could modify the definition of depth to include some error parameter where we consider a curve being nested between two other curves and if it lies between them for all but some area . This leads to the following question:

Main Question: Can we apply flat norm curve simplification to contour boxplots?

Doing any sort of flat norm operation on the curves leaves us with two potential versions:

  1. Simplify curves and to form and and use the new curves to check if is nested between and .
  2. Transform input such that is nested between and .

We can also view the second version as finding the minimal amount of perturbation to “untangle” the input curve. This also would allow us to change from a single true/false binary in our check to a continuous weight. Where a smaller is given a higher weight (perhaps something like ). From here we could define the depth of a curve by the sum