Pages that link to "Item:Q3334982"
From MaRDI portal
The following pages link to Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm (Q3334982):
Displayed 36 items.
- Efficiently hex-meshing things with topology (Q471135) (← links)
- Graph problems arising from parameter identification of discrete dynamical systems (Q634788) (← links)
- Decomposing the boundary of a nonconvex polyhedron (Q675296) (← links)
- Exact Minkowksi sums of polyhedra and exact and efficient decomposition of polyhedra into convex pieces (Q834598) (← links)
- Triangulating a nonconvex polytope (Q914375) (← links)
- Polygon nesting and robustness (Q917303) (← links)
- The upper envelope of piecewise linear functions: Algorithms and applications (Q919830) (← links)
- Optimal complexity reduction of polyhedral piecewise affine systems (Q958262) (← links)
- Decompositions and boundary coverings of non-convex fat polyhedra (Q1037773) (← links)
- A singly exponential stratification scheme for real semi-algebraic varieties and its applications (Q1177933) (← links)
- Many-face complexity in incremental convex arrangements (Q1336754) (← links)
- Erased arrangements of linear and convex decompositions of polyhedra (Q1384196) (← links)
- Local polyhedra and geometric graphs (Q1775780) (← links)
- Simplicial mesh of an arbitrary polyhedron. (Q1876839) (← links)
- Bounds on the size of tetrahedralizations (Q1906047) (← links)
- Vertical decompositions for triangles in 3-space (Q1907609) (← links)
- Optimal tetrahedralization of the 3D-region ``between'' a convex polyhedron and a convex polygon (Q1924710) (← links)
- A two-level method for mimetic finite difference discretizations of elliptic problems (Q2006548) (← links)
- Geometrical discretisations for unfitted finite elements on explicit boundary representations (Q2137975) (← links)
- Removing depth-order cycles among triangles: an algorithm generating triangular fragments (Q2225657) (← links)
- Improved boundary constrained tetrahedral mesh generation by shell transformation (Q2294804) (← links)
- Locking-free compressible quadrilateral finite elements: Poisson's ratio-dependent vector interpolants (Q2435352) (← links)
- Strategies for polyhedral surface decomposition: an experimental study. (Q2482891) (← links)
- Using OXSIM for path planning (Q2745503) (← links)
- Parallel collision detection between moving robots for practical motion planning (Q2745513) (← links)
- 3D boundary recovery by constrained Delaunay tetrahedralization (Q3018042) (← links)
- Adaptive tetrahedral mesh generation by constrained Delaunay refinement (Q3590399) (← links)
- On Decomposition of Embedded Prismatoids in $$\mathbb {R}^3$$ Without Additional Points (Q5020223) (← 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)
- Convex Invariant Refinement by Control Node Splitting: a Heuristic Approach (Q5170180) (← links)
- TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator (Q5270714) (← links)
- SEARCHING POLYHEDRA BY ROTATING HALF-PLANES (Q5300000) (← links)
- Combinatorics of beacon-based routing in three dimensions (Q5896866) (← links)
- Minimizing visible edges in polyhedra (Q6083182) (← links)