Comparison of Node Insertion Algorithms for Delaunay Networks
Comparison of Node Insertion Algorithms for Delaunay Networks
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.
775-780
Brown, M.
52cf4f52-6839-4658-8cc5-ec51da626049
Ullrich, T.
da1a7726-42f5-4be0-8130-79e058b682b2
1997
Brown, M.
52cf4f52-6839-4658-8cc5-ec51da626049
Ullrich, T.
da1a7726-42f5-4be0-8130-79e058b682b2
Brown, M. and Ullrich, T.
(1997)
Comparison of Node Insertion Algorithms for Delaunay Networks.
2nd Mathematical Modelling Conference (MathMod).
.
Record type:
Conference or Workshop Item
(Other)
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.
This record has no associated files available for download.
More information
Published date: 1997
Additional Information:
Address: Vienna, Austria
Venue - Dates:
2nd Mathematical Modelling Conference (MathMod), 1997-01-01
Organisations:
Electronics & Computer Science
Identifiers
Local EPrints ID: 250068
URI: http://eprints.soton.ac.uk/id/eprint/250068
PURE UUID: 983c17ff-d2eb-46e5-82e1-22ca11e5ed77
Catalogue record
Date deposited: 04 May 1999
Last modified: 10 Dec 2021 20:06
Export record
Contributors
Author:
M. Brown
Author:
T. Ullrich
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics