The University of Southampton
University of Southampton Institutional Repository

Comparison of Node Insertion Algorithms for Delaunay Networks

Record type: Conference or Workshop Item (Other)

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.

Full text not available from this repository.

Citation

Brown, M. and Ullrich, T. (1997) Comparison of Node Insertion Algorithms for Delaunay Networks At 2nd Mathematical Modelling Conference (MathMod). , pp. 775-780.

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: 18 Jul 2017 10:44

Export record

Contributors

Author: M. Brown
Author: T. Ullrich

University divisions

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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×