sediyono, Eko (2005) Perbandingan Komputasional Beberapa Metode Triangulasi Delaunay. JURNAL TEKNOLOGI INFORMASI, 02 (01). ISSN 1693-8348Full text not available from this repository.
Delaunay triangulation is a method of piece-wise planar interpolation of surface. There are many algorithms in it, that can be classified into three groups, i.e. incremental construction, incremental insertion and divide-and-conquer. It is compared these three methods with four data distribution: uniform, normal, bubble, vertical belt uniform distribution. Parameter to be compare is computer processing time. The experiment shows that divide-and-conquer is the fastest algorithm, the second fastest is incremental construction, and the last is incremental insertion for all distribution.
|Additional Information:||6_Volume 02 / Nomor 01 / February 2005_Perbandingan Komputasional Beberapa Metode Triangulasi Delaunay|
|Divisions:||?? journal_45_6_Volume-02-Nomor-01-February-2005 ??|
|Depositing User:||Mr. Super Admin|
|Date Deposited:||30 May 2013 17:33|
|Last Modified:||03 Jun 2013 03:50|
Actions (login required)