Finding the maximum bounded intersection of \(k\) out of \(n\) halfplanes (Q990126): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Minimum area circumscribing polygons / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computing a Minimum Weightk-Link Path in Graphs with the Concave Monge Property / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding Extremal Polygons / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding the smallest triangles containing a given convex polygon / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An optimal algorithm for finding minimal enclosing triangles / rank | |||
Normal rank | |||
Latest revision as of 04:25, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding the maximum bounded intersection of \(k\) out of \(n\) halfplanes |
scientific article |
Statements
Finding the maximum bounded intersection of \(k\) out of \(n\) halfplanes (English)
0 references
2 September 2010
0 references
computational geometry
0 references
algorithms
0 references
maximum intersection
0 references
