Perbandingan Komputasional Beberapa Metode Triangulasi Delaunay
| Main Author: | sediyono, Eko |
|---|---|
| Format: | Article PeerReviewed |
| Terbitan: |
Binus University
, 2005
|
| Subjects: | |
| Online Access: |
http://eprints.binus.ac.id/26750/ http://library.binus.ac.id/Collections/journal_detail.aspx?subject=6&volnoed=Volume 02 / Nomor 01 / February 2005&title=Perbandingan Komputasional Beberapa Metode Triangulasi Delaunay |
Daftar Isi:
- 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.