ONLINE ROUTING IN CONVEX SUBDIVISIONS (Q4818562): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Constructing competitive tours from local information / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Shortest paths without a map / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Triangulations intersect nicely / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An efficient algorithm for determining the convex hull of a finite planar set / rank | |||
Normal rank | |||
Latest revision as of 11:56, 7 June 2024
scientific article; zbMATH DE number 2104263
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | ONLINE ROUTING IN CONVEX SUBDIVISIONS |
scientific article; zbMATH DE number 2104263 |
Statements
ONLINE ROUTING IN CONVEX SUBDIVISIONS (English)
0 references
29 September 2004
0 references
online algorithms
0 references
routing
0 references
oblivious algorithms
0 references
computational geometry
0 references
