Efficient algorithms for computing one or two discrete centers hitting a set of line segments (Q2424732)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for computing one or two discrete centers hitting a set of line segments |
scientific article |
Statements
Efficient algorithms for computing one or two discrete centers hitting a set of line segments (English)
0 references
25 June 2019
0 references
one or two discrete centers problem
0 references
hit line segments
0 references
computational geometry
0 references
