The following pages link to (Q5442589):
Displaying 18 items.
- A tight bound for the Delaunay triangulation of points on a polyhedron (Q443906) (← links)
- Delaunay refinement for piecewise smooth complexes (Q848856) (← links)
- Tetrahedral meshing via maximal Poisson-disk sampling (Q1632436) (← links)
- Delaunay meshing of piecewise smooth complexes without expensive predicates (Q1662514) (← links)
- Combining recursive spatial decompositions and domain Delaunay tetrahedrizations for meshing arbitrarily shaped curved solid models (Q1912141) (← links)
- Non-simplicial Delaunay meshing via approximation by radical partitions (Q2172340) (← links)
- A generic software design for Delaunay refinement meshing (Q2371339) (← links)
- A simple algorithm for higher-order Delaunay mosaics and alpha shapes (Q2700389) (← links)
- CGALmesh: a generic framework for Delaunay mesh generation (Q2828147) (← links)
- On Delaunay refinement for curved geometries (Q3019315) (← links)
- Delpsc (Q3602917) (← links)
- DOMAIN DELAUNAY TETRAHEDRIZATION OF SOLID MODELS (Q3987064) (← links)
- Fast and robust Delaunay tessellation in periodic domains (Q4805651) (← links)
- Out-of-core Constrained Delaunay Tetrahedralizations for Large Scenes (Q5020226) (← links)
- Delaunay Graph Based Inverse Distance Weighting for Fast Dynamic Meshing (Q5159073) (← links)
- Anisotropic Delaunay Mesh Generation (Q5252693) (← links)
- TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator (Q5270714) (← links)
- An algorithm for triangulating smooth three-dimensional domains immersed in universal meshes (Q6555263) (← links)