DELAUNAY AND DIAMOND TRIANGULATIONS CONTAIN SPANNERS OF BOUNDED DEGREE (Q3636312): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Constructing plane spanners of bounded degree and low weight / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximating geometric bottleneck shortest paths / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Online Routing in Triangulations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: There are planar graphs almost as good as the complete graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Delaunay graphs are almost as good as complete graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Classes of graphs which approximate the complete Euclidean graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: EFFICIENT CONSTRUCTION OF LOW WEIGHTED BOUNDED DEGREE PLANAR SPANNER / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Geometric Spanner Networks / rank | |||
Normal rank | |||
Latest revision as of 18:21, 1 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | DELAUNAY AND DIAMOND TRIANGULATIONS CONTAIN SPANNERS OF BOUNDED DEGREE |
scientific article |
Statements
DELAUNAY AND DIAMOND TRIANGULATIONS CONTAIN SPANNERS OF BOUNDED DEGREE (English)
0 references
30 June 2009
0 references
algorithm
0 references
Delaunay triangulation
0 references
spanner
0 references
bounded degree
0 references
diamond triangulation
0 references
