"Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon."

Danny Z. Chen (1996)

> Home

SPARQL queries

Details and statistics

DOI: 10.1006/JAGM.1996.0023

access: open

type: Journal Article

metadata version: 2022-05-13

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jal/Chen96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/Chen96
Danny Z. Chen:
Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon. J. Algorithms 20(3): 459-478 (1996)

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.