"Linear-Time Algorithms for Visibility and Shortest Path Problems Inside ..."

Leonidas J. Guibas et al. (1987)

> Home

Details and statistics

DOI: 10.1007/BF01840360

access: closed

type: Journal Article

metadata version: 2018-01-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/GuibasHLST87
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/GuibasHLST87
Leonidas J. Guibas, John Hershberger, Daniel Leven, Micha Sharir, Robert Endre Tarjan:
Linear-Time Algorithms for Visibility and Shortest Path Problems Inside Triangulated Simple Polygons. Algorithmica 2: 209-233 (1987)

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.