The following pages link to Triangulating a nonconvex polytope (Q914375):
Displaying 27 items.
- Straight skeletons and mitered offsets of nonconvex polytopes (Q331386) (← links)
- Efficiently hex-meshing things with topology (Q471135) (← links)
- Decomposing the boundary of a nonconvex polyhedron (Q675296) (← links)
- An iterative interface reconstruction method for PLIC in general convex grids as part of a coupled level set volume of fluid solver (Q725454) (← links)
- Exact Minkowksi sums of polyhedra and exact and efficient decomposition of polyhedra into convex pieces (Q834598) (← links)
- A singly exponential stratification scheme for real semi-algebraic varieties and its applications (Q1177933) (← links)
- On the difficulty of triangulating three-dimensional nonconvex polyhedra (Q1182990) (← links)
- Quasi-optimal upper bounds for simplex range searching and new zone theorems (Q1201746) (← links)
- Dynamic motion planning in low obstacle density environments (Q1276943) (← links)
- Provably good mesh generation (Q1329150) (← links)
- Erased arrangements of linear and convex decompositions of polyhedra (Q1384196) (← links)
- Overview and recent advances in natural neighbour Galerkin methods (Q1434802) (← links)
- A decomposition-based approach to layered manufacturing (Q1862118) (← 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)
- Tetrahedral meshes from planar cross-sections (Q1976169) (← links)
- Boundary-trimmed 3D triangular mesh segmentation based on iterative merging strategy (Q2369618) (← links)
- Approximating the minimum triangulation of convex 3-polytopes with bounded degrees (Q2387200) (← links)
- Strategies for polyhedral surface decomposition: an experimental study. (Q2482891) (← links)
- TOPOLOGY-PRESERVING WATERMARKING OF VECTOR GRAPHICS (Q2931162) (← links)
- 3D boundary recovery by constrained Delaunay tetrahedralization (Q3018042) (← links)
- Decomposing the boundary of a nonconvex polyhedron (Q5056155) (← links)
- Convex polygons made from few lines and convex decompositions of polyhedra (Q5056156) (← 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)
- SEARCHING POLYHEDRA BY ROTATING HALF-PLANES (Q5300000) (← links)
