scientific article; zbMATH DE number 1240687
From MaRDI portal
Publication:4225921
DOI<871::AID-CNM195>3.0.CO;2-6 10.1002/(SICI)1099-0887(199809)14:9<871::AID-CNM195>3.0.CO;2-6zbMath0916.65149MaRDI QIDQ4225921
Publication date: 17 January 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmsmeshless methodscomputational geometryDelaunay triangulationscircle testsVoronoi nearest neighbour
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items (2)
2D and 3D finite element meshing and remeshing ⋮ Algorithms for automatic generating interior nodal points and Delaunay triangulation using advancing front technique
Cites Work
- Unnamed Item
- The integrity of geometrical boundaries in the two-dimensional delaunay triangulation
- Selective refinement: A new strategy for automatic node placement in graded triangular meshes
- An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems
- Element‐free Galerkin methods
- Automatic triangulation of arbitrary planar domains for the finite element method
This page was built for publication:
