Name
Abstract | ||
|---|---|---|
Motivated by questions in location planning, we show for a set of colored point sites in the plane how to compute the smallest-- by perimeter or area--axis-parallel rectangle and the narrowest strip enclosing at least one site of each color. |
Year | Venue | Keywords |
|---|---|---|
2001 | ESA | smallest color-spanning objects,point site,axis-parallel rectangle,narrowest strip,location planning |
Field | DocType | ISBN |
Discrete mathematics,Singular point of a curve,Combinatorics,Colored,Steiner tree problem,Rectangle,Computational geometry,Perimeter,Voronoi diagram,Maximal element,Mathematics | Conference | 3-540-42493-8 |
Citations | PageRank | References |
15 | 1.06 | 15 |
Authors | ||
8 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Manuel Abellanas | 1 | 102 | 13.99 |
| Ferrán Hurtado | 2 | 43 | 4.16 |
| Christian Icking | 3 | 364 | 33.17 |
| Rolf Klein | 4 | 138 | 11.51 |
| Elmar Langetepe | 5 | 199 | 25.87 |
| Lihong Ma | 6 | 76 | 8.61 |
| Belén Palop | 7 | 99 | 9.44 |
| Vera Sacristan | 8 | 95 | 11.80 |