The maximal cliques of the intersection graph are obtained by first finding the cliques for the marginal data and then combining them using the algorithm in Gentleman and Vandal (1999).

1 2 |

`intvlx` |
The cliques for one marginal component, alternatively the marginal intervals can be supplied. |

`intvly` |
The cliques for the other marginal component, alternatively the marginal intervals can be supplied. |

`Lxopen` |
Boolean indicating whether the left end point in the x coordinate is open. |

`Rxopen` |
Boolean indicating whether the right end point in the x coordinate is open. |

`Lyopen` |
Boolean indicating whether the left end point in the y coordinate is open. |

`Ryopen` |
Boolean indicating whether the right end point in the y coordinate is open. |

A list of the maximal cliques of the intersection graph of the data.

A. Vandal and R. Gentleman

*Graphâ€“Theoretical Aspects of Bivariate Censored
Data*, R. Gentleman and A. Vandal, 1999, submitted.

`BVclmat`

, `BVsupport`

1 2 |

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

All documentation is copyright its authors; we didn't write any of that.