"k-Pairs Non-Crossing Shortest Paths in a Simple Polygon."

Evanthia Papadopoulou (1999)

> Home

Details and statistics

DOI: 10.1142/S0218195999000315

access: closed

type: Journal Article

metadata version: 2021-07-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ijcga/Papadopoulou99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijcga/Papadopoulou99
Evanthia Papadopoulou:
k-Pairs Non-Crossing Shortest Paths in a Simple Polygon. Int. J. Comput. Geom. Appl. 9(6): 533-552 (1999)

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.