### Abstract

In the past ten years, there have been a number of data structures that, given a distribution of planar point location queries, produce a planar point location data structure that is tuned for the provided distribution. These structures all suffer from the requirement that the query distribution be provided in advance. For the problem of point location in a triangulation, a data structure is presented that performs asymptotically as well as these structures, but does not require the distribution to be provided in advance. This result is the 2-d analogue of the jump from the optimum binary search trees of Knuth in 1971 which required that the distribution be provided, to the splay trees of Sleator and Tarjan in 1985 where in the static optimality theorem it was proven that splay trees had the same asymptotic performance of optimum search trees without being provided the probability distribution.

Original language | English (US) |
---|---|

Title of host publication | Proceedings of the 27th Annual Symposium on Computational Geometry, SCG'11 |

Pages | 21-26 |

Number of pages | 6 |

DOIs | |

State | Published - 2011 |

Event | 27th Annual ACM Symposium on Computational Geometry, SCG'11 - Paris, France Duration: Jun 13 2011 → Jun 15 2011 |

### Other

Other | 27th Annual ACM Symposium on Computational Geometry, SCG'11 |
---|---|

Country | France |

City | Paris |

Period | 6/13/11 → 6/15/11 |

### Fingerprint

### Keywords

- Algorithms

### ASJC Scopus subject areas

- Computational Mathematics
- Geometry and Topology
- Theoretical Computer Science

### Cite this

*Proceedings of the 27th Annual Symposium on Computational Geometry, SCG'11*(pp. 21-26) https://doi.org/10.1145/1998196.1998200

**A static optimality transformation with applications to planar point location.** / John, Iacono.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proceedings of the 27th Annual Symposium on Computational Geometry, SCG'11.*pp. 21-26, 27th Annual ACM Symposium on Computational Geometry, SCG'11, Paris, France, 6/13/11. https://doi.org/10.1145/1998196.1998200

}

TY - GEN

T1 - A static optimality transformation with applications to planar point location

AU - John, Iacono

PY - 2011

Y1 - 2011

N2 - In the past ten years, there have been a number of data structures that, given a distribution of planar point location queries, produce a planar point location data structure that is tuned for the provided distribution. These structures all suffer from the requirement that the query distribution be provided in advance. For the problem of point location in a triangulation, a data structure is presented that performs asymptotically as well as these structures, but does not require the distribution to be provided in advance. This result is the 2-d analogue of the jump from the optimum binary search trees of Knuth in 1971 which required that the distribution be provided, to the splay trees of Sleator and Tarjan in 1985 where in the static optimality theorem it was proven that splay trees had the same asymptotic performance of optimum search trees without being provided the probability distribution.

AB - In the past ten years, there have been a number of data structures that, given a distribution of planar point location queries, produce a planar point location data structure that is tuned for the provided distribution. These structures all suffer from the requirement that the query distribution be provided in advance. For the problem of point location in a triangulation, a data structure is presented that performs asymptotically as well as these structures, but does not require the distribution to be provided in advance. This result is the 2-d analogue of the jump from the optimum binary search trees of Knuth in 1971 which required that the distribution be provided, to the splay trees of Sleator and Tarjan in 1985 where in the static optimality theorem it was proven that splay trees had the same asymptotic performance of optimum search trees without being provided the probability distribution.

KW - Algorithms

UR - http://www.scopus.com/inward/record.url?scp=79960193965&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79960193965&partnerID=8YFLogxK

U2 - 10.1145/1998196.1998200

DO - 10.1145/1998196.1998200

M3 - Conference contribution

SN - 9781450306829

SP - 21

EP - 26

BT - Proceedings of the 27th Annual Symposium on Computational Geometry, SCG'11

ER -