A New Triangulation for Simplicial Algorithms
From MaRDI portal
Publication:5285945
DOI10.1137/0406013zbMATH Open0778.65038OpenAlexW1993570800MaRDI QIDQ5285945FDOQ5285945
Authors: Michael J. Todd, Levent Tunçel 
Publication date: 29 June 1993
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1813/8831
Recommendations
Cited In (17)
- The \(D_ 2\)-triangulation for simplicial homotopy algorithms for computing solutions of nonlinear equations
- On computation of triangulation with piecewise linearity and separability
- A modification of the Fourier-Motskin algorithm for constructing a triangulation and its star coloring
- Triangulations. Structures for algorithms and applications
- An improved implementation and analysis of the Diaz and O'Rourke algorithm for finding the Simpson point of a convex polygon
- Improvement of fixed point algorithms from a triangulation
- A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points
- Title not available (Why is that?)
- Triangulations and simplicial methods
- A new perspective on \(k\)-triangulations
- LMT-skeleton heuristics for several new classes of optimal triangulations
- A triangulation and fill-reducing initialization procedure for the simplex algorithm
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
- A better triangulation for Wright's \(2^n\)-ray algorithm
- Title not available (Why is that?)
- Computing optimal triangulations using simulated annealing
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)
