Detecting and approximating fault lines from randomly scattered data

DOI10.1007/s11075-004-3624-yzbMath1068.65032MaRDI QIDQ1776173

John C. Mason, Andrew Crampton

Publication date: 20 May 2005

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-004-3624-y

zbMATH Keywords

numerical examples; support vector machines; performances; data triangulations; detection and approximation algorithms; discrete Gaussian curvature; discretely defined surfaces; fault lines

Mathematics Subject Classification ID

65D18: Numerical aspects of computer graphics, image analysis, and computational geometry

65Y20: Complexity and performance of numerical algorithms

Related Items

Edge detection methods based on RBF interpolation, On the reconstruction of discontinuous functions using multiquadric RBF-WENO local interpolation techniques, Fault and gradient fault detection and reconstruction from scattered data, CS-RBF interpolation of surfaces with vertical faults from scattered data, On a new characterization of finite jump discontinuities and its application to vertical fault detection

Uses Software

• LOQO
• Algorithm 478

Cites Work

• An interior-point algorithm for nonconvex nonlinear programming
• Approximating scattered data with discontinuities
• Detection of discontinuities in scattered data approximation
• A result about scale transformation families in approximation: application to surface fitting from rapidly varying data
• Vertical fault detection from scattered data
• LOQO:an interior point code for quadratic programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item