Guarding scenes against invasive hypercubes. (Q1405005)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1970592
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Guarding scenes against invasive hypercubes. |
scientific article; zbMATH DE number 1970592 |
Statements
Guarding scenes against invasive hypercubes. (English)
0 references
25 August 2003
0 references
In recent years realistic input models for geometric algorithms have been studied. The most important models are fathness, low density, undutteredness and small simple-cover complexity. The authors show that guardable scenes fit in between undutteredness and small simple-cover complexity. Properties of guardable scenes and heuristic algorithms to compute small guarding sets are given.
0 references
Input models
0 references
Guarding sets
0 references
Epsilon-nets
0 references
Geometric algorithms
0 references
0.7691176533699036
0 references
0.7347683310508728
0 references
0.7347683310508728
0 references
0.7255242466926575
0 references
