Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons (Q5404455)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons |
scientific article; zbMATH DE number 6272579
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons |
scientific article; zbMATH DE number 6272579 |
Statements
Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons (English)
0 references
24 March 2014
0 references
Steiner triangulations
0 references
approximation algorithms
0 references
computational geometry
0 references
polygons
0 references
rectangular decompositions
0 references
stabbing number
0 references
