### Abstract

Given a fixed distribution of point location queries among the regions of a triangulation of the plane, a data structure is presented that achieves, within constant multiplicative factors, the entropy bound on the expected point location query time.

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

Title of host publication | Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms |

Pages | 340-341 |

Number of pages | 2 |

State | Published - 2001 |

Event | 2001 Operating Section Proceedings, American Gas Association - Dallas, TX, United States Duration: Apr 30 2001 → May 1 2001 |

### Publication series

Name | Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms |
---|

### Other

Other | 2001 Operating Section Proceedings, American Gas Association |
---|---|

Country | United States |

City | Dallas, TX |

Period | 4/30/01 → 5/1/01 |

### Keywords

- Algorithms
- Theory

### ASJC Scopus subject areas

- Software
- Mathematics(all)

## Fingerprint Dive into the research topics of 'Optimal planar point location'. Together they form a unique fingerprint.

## Cite this

Iacono, J. (2001). Optimal planar point location. In

*Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms*(pp. 340-341). (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).