Rapid prototyping through scanned point data
From MaRDI portal
Publication:4674428
DOI10.1080/00207540110079743zbMath1060.90591OpenAlexW2069913886MaRDI QIDQ4674428
Publication date: 11 May 2005
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540110079743
Cites Work
- Computing optimal triangulations using simulated annealing
- A method for automating the construction of irregular computational grids for storm surge forecast models
- Vertex based data dependent triangulations
- Algorithm for Delaunay triangulation and convex-hull computation using a sparse matrix
- The side-vertex method for interpolation in triangles
- Geometric surface patches without twist constraints
- Triangulation of scattered data in 3D space
- Delaunay-based representation of surfaces defined over arbitrarily shaped domains
- AGTHOM—automatic generation of triangular and higher order meshes
- Design of a recursive, shape controlling mesh generator
- An apporach to automatic three-dimensional finite element mesh generation
- Two algorithms for constructing a Delaunay triangulation
- Optimal Triangular Mesh Generation by Coordinate Transformation
- Long and Thin Triangles Can Be Good for Linear Interpolation
This page was built for publication: Rapid prototyping through scanned point data
