A New Triangulation for Simplicial Algorithms
From MaRDI portal
Recommendations
Cited in
(22)- Bounded flatness in Q-triangulated regular n-simplexes
- Triangulations and simplicial methods
- A better triangulation for Wright's \(2^n\)-ray algorithm
- LMT-skeleton heuristics for several new classes of optimal triangulations
- A triangulation and fill-reducing initialization procedure for the simplex algorithm
- On computation of triangulation with piecewise linearity and separability
- A modification of the Fourier-Motskin algorithm for constructing a triangulation and its star coloring
- scientific article; zbMATH DE number 4193076 (Why is no real title available?)
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
- scientific article; zbMATH DE number 4073956 (Why is no real title available?)
- Triangulate flat cones on simplices
- scientific article; zbMATH DE number 1329056 (Why is no real title available?)
- scientific article; zbMATH DE number 6384 (Why is no real title available?)
- scientific article; zbMATH DE number 1418042 (Why is no real title available?)
- A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- A new perspective on \(k\)-triangulations
- Improvement of fixed point algorithms from a triangulation
- An improved implementation and analysis of the Diaz and O'Rourke algorithm for finding the Simpson point of a convex polygon
- The \(D_ 2\)-triangulation for simplicial homotopy algorithms for computing solutions of nonlinear equations
- Computing optimal triangulations using simulated annealing
- Triangulations. Structures for algorithms and applications
This page was built for publication: A New Triangulation for Simplicial Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5285945)
