Computing a centerpoint of a finite planar set of points in linear time (Q1338958): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Slowing down sorting networks to obtain faster sorting algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On <i>k</i>-Hulls and Related Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3772828 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Partitioning with two lines in the plane / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3278735 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2134711657 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:27, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computing a centerpoint of a finite planar set of points in linear time |
scientific article |
Statements
Computing a centerpoint of a finite planar set of points in linear time (English)
0 references
27 November 1994
0 references
linear-time algorithm
0 references
centerpoint
0 references