"A Divide-and-Conquer Algorithm for Two-Point L_1 Shortest Path Queries in ..."

Haitao Wang (2019)

> Home

Details and statistics

DOI: 10.4230/LIPICS.SOCG.2019.59

access: open

type: Conference or Workshop Paper

metadata version: 2021-06-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/compgeom/000119
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/compgeom/000119
Haitao Wang:
A Divide-and-Conquer Algorithm for Two-Point L_1 Shortest Path Queries in Polygonal Domains. SoCG 2019: 59:1-59:14

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.