Guarding scenes against invasive hypercubes. (Q1405005): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0925-7721(03)00016-6 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2142728440 / rank | |||
Normal rank |
Latest revision as of 11:18, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Guarding scenes against invasive hypercubes. |
scientific article |
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