Pages that link to "Item:Q1182990"

The following pages link to On the difficulty of triangulating three-dimensional nonconvex polyhedra (Q1182990):

Displaying 32 items.

• An iterative interface reconstruction method for PLIC in general convex grids as part of a coupled level set volume of fluid solver (Q725454) (← links)
• Fourth order accurate evaluation of integrals in potential theory on exterior 3D regions (Q868250) (← links)
• Decompositions and boundary coverings of non-convex fat polyhedra (Q1037773) (← links)
• Spatial polyhedra without diagonals (Q1327516) (← links)
• Erased arrangements of linear and convex decompositions of polyhedra (Q1384196) (← links)
• On triangulating three-dimensional polygons (Q1392846) (← links)
• A fast solver for the Stokes equations with distributed forces in complex geometries. (Q1418702) (← links)
• Overview and recent advances in natural neighbour Galerkin methods (Q1434802) (← links)
• Local polyhedra and geometric graphs (Q1775780) (← links)
• Simplicial mesh of an arbitrary polyhedron. (Q1876839) (← links)
• Bounds on the size of tetrahedralizations (Q1906047) (← links)
• Optimal tetrahedralization of the 3D-region ``between'' a convex polyhedron and a convex polygon (Q1924710) (← links)
• Practical unstructured splines: algorithms, multi-patch spline spaces, and some applications to numerical analysis (Q2088347) (← links)
• Secondary polytope and secondary power diagram (Q2206384) (← links)
• Starshaped sets (Q2216442) (← links)
• Improved boundary constrained tetrahedral mesh generation by shell transformation (Q2294804) (← links)
• Fast segment insertion and incremental construction of constrained Delaunay triangulations (Q2354921) (← links)
• General-dimensional constrained Delaunay and constrained regular triangulations. I: Combinatorial properties (Q2482216) (← links)
• Strategies for polyhedral surface decomposition: an experimental study. (Q2482891) (← links)
• Redesign of a conformal boundary recovery algorithm for 3D Delaunay triangulation (Q2644502) (← links)
• 2D and 3D finite element meshing and remeshing (Q2777710) (← links)
• 3D boundary recovery by constrained Delaunay tetrahedralization (Q3018042) (← links)
• Adaptive tetrahedral mesh generation by constrained Delaunay refinement (Q3590399) (← links)
• (Q5009355) (← links)
• On Decomposition of Embedded Prismatoids in $$\mathbb {R}^3$$ Without Additional Points (Q5020223) (← links)
• A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points (Q5114888) (← links)
• TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator (Q5270714) (← links)
• Regular triangulations and Steiner points (Q5313281) (← links)
• Combinatorics of beacon-based routing in three dimensions (Q5896866) (← links)
• On nontriangulable polyhedra (Q5962892) (← links)
• Minimizing visible edges in polyhedra (Q6083182) (← links)
• Triangulation of simple arbitrarily shaped polyhedra by cutting off one vertex at a time (Q6569247) (← links)