## Abstract

A set L of points in the d-space E^{d}is said to illuminate a family F={S_{1}, ..., S_{n}} of n disjoint compact sets in E^{d}if for every set S_{i}in F and every point x in the boundary of S_{i}there is a point v in L such that v illuminates x, i.e. the line segment joining v to x intersects the union of the elements of F in exactly {x}. The problem we treat is the size of a set S needed to illuminate a family F={S_{1}, ..., S_{n}} of n disjoint compact sets in E^{d}. We also treat the problem of putting these convex sets in mutually disjoint convex polytopes, each one having at most a certain number of facets.

Original language | English |
---|---|

Pages (from-to) | 115-120 |

Number of pages | 6 |

Journal | Geometriae Dedicata |

Volume | 56 |

Issue number | 2 |

DOIs | |

State | Published - Jul 1995 |

## Keywords

- Mathematics Subject Classification (1991): 52-XX

## ASJC Scopus subject areas

- Geometry and Topology