An optimal algorithm for the rectilinear link center of a rectilinear polygon (Q1917052): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0925-7721(95)00026-7 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2075041772 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4037425 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On rectilinear link distance / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An \(O(n\log n)\) algorithm for computing the link center of a simple polygon / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computing the link center of a simple polygon / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal parallel algorithms for rectilinear link-distance problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4035759 / rank | |||
Normal rank |
Latest revision as of 12:19, 24 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An optimal algorithm for the rectilinear link center of a rectilinear polygon |
scientific article |
Statements
An optimal algorithm for the rectilinear link center of a rectilinear polygon (English)
0 references
14 July 1996
0 references
link center
0 references