%0 Conference Paper %1 conf/compgeom/DasN94a %A Das, Gautam %A Narasimhan, Giri %B SCG %D 1994 %E Mehlhorn, Kurt %I ACM %K dblp %P 259-266 %T Optimal Linear-Time Algorithm for the Shortest Illuminating Line Segment in a Polygon. %U http://dblp.uni-trier.de/db/conf/compgeom/compgeom94.html#DasN94a %@ 0-89791-648-4

@inproceedings{conf/compgeom/DasN94a, added-at = {2024-02-05T00:00:00.000+0100}, author = {Das, Gautam and Narasimhan, Giri}, biburl = {https://www.bibsonomy.org/bibtex/285efbc31c7bf32dc04d7d6f50bed9d5a/dblp}, booktitle = {SCG}, crossref = {conf/compgeom/1994}, editor = {Mehlhorn, Kurt}, ee = {https://doi.org/10.1145/177424.177984}, interhash = {1580db0120fa57a7e2ea94de0e164e94}, intrahash = {85efbc31c7bf32dc04d7d6f50bed9d5a}, isbn = {0-89791-648-4}, keywords = {dblp}, pages = {259-266}, publisher = {ACM}, timestamp = {2024-04-09T14:34:45.000+0200}, title = {Optimal Linear-Time Algorithm for the Shortest Illuminating Line Segment in a Polygon.}, url = {http://dblp.uni-trier.de/db/conf/compgeom/compgeom94.html#DasN94a}, year = 1994 }