Description Usage Arguments Value Author(s) See Also Examples

Finds the partition generated by an evaluation tree. An evaluation tree makes a recursive partition of a rectangle. Functions "eval.cart", "densplit",... return evaluation trees.

1 |

`et` |
an evaluation tree; output of "eval.cart", "densplit", ... |

`grid` |
TRUE or FALSE; whether the true coordinates or relative coordinates are used |

`zerorecs` |
TRUE or FALSE; whether the rectangles where the density vanishes are included; (evaluation trees are used by package "delt" to represent density functions) |

Returns a list with the following elements.

`values ` |
vector whose lenght is equal to the number of rectangles in the partition; value of the function on the corresponding rectangle |

`recs` |
recnum*(2*d) matrix; recnum is the number of rectangles in the partition and d is the dimension of the observations. The rows of "recs" describe the rectangles. Column (2*j-1) gives the lower value for the j:th interval and (2*j):th column gives upper value for the j:th interval, j=1,...,d. |

`support` |
the rectangle which is partitioned |

Jussi Klemela

1 2 3 4 5 6 7 |

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.