Pages that link to "Item:Q5370719"
From MaRDI portal
The following pages link to Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension (Q5370719):
Displaying 15 items.
- Faster geometric algorithms via dynamic determinant computation (Q283878) (← links)
- Efficient edge-skeleton computation for polytopes defined by oracles (Q491253) (← links)
- Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints (Q727384) (← links)
- Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints (Q727385) (← links)
- Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints (Q785630) (← links)
- Parallel geometric algorithms for multi-core computers (Q991179) (← links)
- An evaluation of point-insertion sequences for incremental Delaunay tessellations (Q1655402) (← links)
- Randomized incremental construction of Delaunay triangulations of nice point sets (Q2039315) (← links)
- PSI: constructing ad-hoc simplices to interpolate high-dimensional unstructured data (Q2162057) (← links)
- Simplex-stochastic collocation method with improved scalability (Q2375010) (← links)
- The Implementation of the Colored Abstract Simplicial Complex and Its Application to Mesh Generation (Q4960948) (← links)
- (Q5075759) (← links)
- TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator (Q5270714) (← links)
- (Q5743482) (← links)
- A Penalized Synthetic Control Estimator for Disaggregated Data (Q5881965) (← links)
