Pages that link to "Item:Q1183535"
From MaRDI portal
The following pages link to Delaunay triangulation of arbitrarily shaped planar domains (Q1183535):
Displaying 20 items.
- An upper bound for conforming Delaunay triangulations (Q685182) (← links)
- Generalized Delaunay triangulations of non-convex domains (Q922670) (← links)
- Generalized Delaunay triangulation for planar graphs (Q1078807) (← links)
- Automatic triangular mesh generation of trimmed parametric surfaces for finite element analysis (Q1128654) (← links)
- Approximating constrained tetrahedrizations (Q1208496) (← links)
- Point placement algorithms for Delaunay triangulation of polygonal domains (Q1330781) (← links)
- A novel model of conforming Delaunay triangulation for sensor network configuration (Q1669119) (← links)
- Combining recursive spatial decompositions and domain Delaunay tetrahedrizations for meshing arbitrarily shaped curved solid models (Q1912141) (← links)
- Automatic generation of transitional meshes. (Q2712690) (← links)
- Computer-aided triangulation algorithm for multiply connected domains with concentrated and rarefied nodes (Q2714085) (← links)
- 2D and 3D finite element meshing and remeshing. A bibliography (1990-2001) (Q2777710) (← links)
- (Q2933452) (← links)
- A new mesh generation scheme for arbitrary planar domains (Q3713541) (← links)
- DOMAIN DELAUNAY TETRAHEDRIZATION OF SOLID MODELS (Q3987064) (← links)
- (Q4208981) (← links)
- A note on finding nearest neighbours and constructing Delaunay triangulation in the plane (Q4225921) (← links)
- Sweepline algorithm for unstructured‐grid generation on two‐dimensional non‐convex domains (Q4271507) (← links)
- Robust boundary triangulation and delaunay triangulation of arbitrary planar domains (Q4305080) (← links)
- Almost regular Delaunay-triangulations (Q4398044) (← links)
- Fast and robust Delaunay tessellation in periodic domains (Q4805651) (← links)
