On the all-farthest-segments problem for a planar set of points (Q845846)
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: On the all-farthest-segments problem for a planar set of points |
scientific article; zbMATH DE number 5664703
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the all-farthest-segments problem for a planar set of points |
scientific article; zbMATH DE number 5664703 |
Statements
On the all-farthest-segments problem for a planar set of points (English)
0 references
29 January 2010
0 references
algorithms
0 references
computational geometry
0 references
analysis of algorithms
0 references
design of algorithms
0 references
computational complexity
0 references
0 references
0.933539628982544
0 references
0.7970129251480103
0 references
0.7966886758804321
0 references
0.7925466895103455
0 references
0.779565155506134
0 references
