An optimal algorithm to compute the inverse beacon attraction region (Q5115823): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (5 intermediate revisions by 5 users not shown) | |||
| label / en | label / en | ||
An optimal algorithm to compute the inverse beacon attraction region | |||
| Property / DOI | |||
| Property / DOI: 10.4230/LIPIcs.SoCG.2018.55 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1803.05946 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Beacon-Based Algorithms for Geometric Routing / 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: Q2721968 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Visibility and intersection problems in plane geometry / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An optimal algorithm to compute the inverse beacon attraction region / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Routing in a polygonal terrain with the shortest beacon watchtower / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Euclidean shortest paths in the presence of rectilinear barriers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5077653 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Lower Bound to Finding Convex Hulls / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2963753111 / rank | |||
Normal rank | |||
| Property / title | |||
An optimal algorithm to compute the inverse beacon attraction region (English) | |||
| Property / title: An optimal algorithm to compute the inverse beacon attraction region (English) / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.4230/LIPICS.SOCG.2018.55 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 15:59, 30 December 2024
scientific article; zbMATH DE number 7236459
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal algorithm to compute the inverse beacon attraction region |
scientific article; zbMATH DE number 7236459 |
Statements
18 August 2020
0 references
beacon attraction
0 references
inverse attraction region
0 references
algorithm
0 references
optimality
0 references
0 references
An optimal algorithm to compute the inverse beacon attraction region (English)
0 references
