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 98 of 108 found articles
 
 
  The greedy triangulation can be computed from the Delaunay triangulation in linear time
 
 
Title: The greedy triangulation can be computed from the Delaunay triangulation in linear time
Author: Levcopoulos, Christos
Krznaric, Drago
Appeared in: Computational geometry
Paging: Volume 14 (1999) nr. 4 pages 24 p.
Year: 1999
Contents:
Publisher: Elsevier Science B.V.
Source file: Elektronische Wetenschappelijke Tijdschriften
 
 

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