On selecting a fraction of leaves with disjoint neighborhoods in a plane tree (Q2161244): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A linear-time algorithm for computing the Voronoi diagram of a convex polygon / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Forest-like abstract Voronoi diagrams in linear time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding the medial axis of a simple polygon in linear time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Deletion in Abstract Voronoi Diagrams in Expected Linear Time. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4525679 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On k-Nearest Neighbor Voronoi Diagrams in the Plane / rank | |||
Normal rank | |||
Latest revision as of 20:27, 29 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On selecting a fraction of leaves with disjoint neighborhoods in a plane tree |
scientific article |
Statements
On selecting a fraction of leaves with disjoint neighborhoods in a plane tree (English)
0 references
4 August 2022
0 references
binary tree
0 references
linear-time algorithm
0 references
Voronoi diagram
0 references
constant fraction of leaves
0 references
