"Optimal Linear-Time Algorithm for the Shortest Illuminating Line Segment ..."

Gautam Das, Giri Narasimhan (1994)

> Home

Details and statistics

DOI: 10.1145/177424.177984

access: closed

type: Conference or Workshop Paper

metadata version: 2024-02-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/compgeom/DasN94a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/compgeom/DasN94a
Gautam Das, Giri Narasimhan:
Optimal Linear-Time Algorithm for the Shortest Illuminating Line Segment in a Polygon. SCG 1994: 259-266

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.