Comparison of Node Insertion Algorithms for Delaunay Networks
Brown, M. and Ullrich, T. (1997) Comparison of Node Insertion Algorithms for Delaunay Networks. 2nd Mathematical Modelling Conference (MathMod) IMACS, 775-780.
Download
Full text not available from this repository.
Description/Abstract
This paper compares three different node insertion strategies which can be used to incrementally construct Delaunay triangulation models. Delaunay networks may be used to efficiently store low dimensional nonlinear models, and can therefore be used in a wide range of real-time applications. However, there are no direct node selection methods, and it can be shown that the network's generalisation abilities are strongly affected by the triangular partitioning of the input space. The three iterative, constructive node insertion algorithms (maximum error, local weighted error and one-step-ahead optimal search) are compared using two data sets, and conclusions are drawn about the quality of the extracted triangulation and the algorithms' computational costs.
| Item Type: | Conference or Workshop Item (UNSPECIFIED) |
|---|---|
| Additional Information: | Address: Vienna, Austria |
| Divisions: | Faculty of Physical and Applied Science > Electronics and Computer Science |
| Item ID: | 250068 |
| Date Deposited: | 04 May 1999 |
| Last Modified: | 01 Mar 2012 10:17 |
| Contributors: | Brown, M. (Author) Ullrich, T. (Author) |
| Date: | 1997 |
| Additional Information: | Address: Vienna, Austria |
| Status: | Published |
| Publisher: | IMACS |
| Further Information: | Google Scholar |
| URI: | http://eprints.soton.ac.uk/id/eprint/250068 |
Actions (login required)
 |
View Item |
