The relative neighbourhood graph is a part of every \(30^\circ \)-triangulation (Q975537): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4947407 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Routing with guaranteed delivery in ad hoc wireless networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: LMT-skeleton heuristics for several new classes of optimal triangulations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On exclusion regions for optimal triangulations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimal Triangulations of Polygonal Domains / rank | |||
Normal rank | |||
Latest revision as of 22:26, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The relative neighbourhood graph is a part of every \(30^\circ \)-triangulation |
scientific article |
Statements
The relative neighbourhood graph is a part of every \(30^\circ \)-triangulation (English)
0 references
9 June 2010
0 references
computational geometry
0 references
triangulation
0 references
relative neighbourhood graph
0 references
angular restriction
0 references
exclusion region
0 references
