"On the Exact Worst Case Query Complexity of Planar Point Location."

Raimund Seidel, Udo Adamy (2000)

> Home

Details and statistics

DOI: 10.1006/JAGM.2000.1101

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jal/SeidelA00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/SeidelA00
Raimund Seidel, Udo Adamy:
On the Exact Worst Case Query Complexity of Planar Point Location. J. Algorithms 37(1): 189-217 (2000)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.