Digital Library
Close Browse articles from a journal
 
<< previous    next >>
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
           All articles of the corresponding issues
                                       Details for article 140 of 180 found articles
 
 
  Optimally computing a shortest weakly visible line segment inside a simple polygon
 
 
Title: Optimally computing a shortest weakly visible line segment inside a simple polygon
Author: Bhattacharya, Binay K.
Das, Gautam
Mukhopadhyay, Asish
Narasimhan, Giri
Appeared in: Computational geometry
Paging: Volume 23 (2002) nr. 1 pages 29 p.
Year: 2002
Contents:
Publisher: Elsevier Science B.V.
Source file: Elektronische Wetenschappelijke Tijdschriften
 
 

                             Details for article 140 of 180 found articles
 
<< previous    next >>
 
 Koninklijke Bibliotheek - National Library of the Netherlands