Detecting and approximating fault lines from randomly scattered data
From MaRDI portal
Publication:1776173
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
numerical examples; support vector machines; performances; data triangulations; detection and approximation algorithms; discrete Gaussian curvature; discretely defined surfaces; fault lines
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
65Y20: Complexity and performance of numerical algorithms
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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