Detecting and approximating fault lines from randomly scattered data

Andrew Crampton, John C. Mason

Research output: Contribution to journalArticlepeer-review

16 Citations (Scopus)


Discretely defined surfaces that exhibit vertical displacements across unknown fault lines can be difficult to approximate accurately unless a representation of the faults is known. Accurate representations of these faults enable the construction of constrained approximation models that can successfully overcome common problems such as over-smoothing. In this paper we review an existing method for detecting fault lines and present a new detection approach based on data triangulations and discrete Gaussian curvature (DGC). Furthermore, we show that if the fault line can be described non-parametrically, then accurate support vector machine (SVM) models can be constructed that are independent of the type of triangulation used in the detection algorithms. We shall also see that SVM models are particularly effective when the data produced by the detection algorithms are noisy. We compare the performances of the various new and established models.

Original languageEnglish
Pages (from-to)115-130
Number of pages16
JournalNumerical Algorithms
Issue number1-3
Publication statusPublished - Jul 2005


Dive into the research topics of 'Detecting and approximating fault lines from randomly scattered data'. Together they form a unique fingerprint.

Cite this