Minimum constraint removal problem for line segments is NP-hard (Q6174134)
From MaRDI portal
scientific article; zbMATH DE number 7712527
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum constraint removal problem for line segments is NP-hard |
scientific article; zbMATH DE number 7712527 |
Statements
Minimum constraint removal problem for line segments is NP-hard (English)
0 references
14 July 2023
0 references
algorithm
0 references
computational geometry
0 references
line segments
0 references
MCR
0 references
motion planning
0 references
