A New Triangulation for Simplicial Algorithms

DOI10.1137/0406013MaRDI QIDQ5285945zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

performancetriangulationssimplicial algorithmssemicontinuous mappings

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Triangulating manifolds (57Q15)

Recommendations

• Improvement of fixed point algorithms from a triangulation
• scientific article; zbMATH DE number 4193076
• The D1-Triangulation of Rn for Simplicial Algorithms for Computing Solutions of Nonlinear Equations
• scientific article; zbMATH DE number 4073956
• Triangulations and simplicial methods

Cited in

(17)

• scientific article; zbMATH DE number 4073956 (Why is no real title available?)
• Triangulations and simplicial methods
• A triangulation and fill-reducing initialization procedure for the simplex algorithm
• On computation of triangulation with piecewise linearity and separability
• A better triangulation for Wright's \(2^n\)-ray algorithm
• scientific article; zbMATH DE number 1418042 (Why is no real title available?)
• A new perspective on \(k\)-triangulations
• Triangulations. Structures for algorithms and applications
• Computing optimal triangulations using simulated annealing
• The \(D_ 2\)-triangulation for simplicial homotopy algorithms for computing solutions of nonlinear equations
• An improved implementation and analysis of the Diaz and O'Rourke algorithm for finding the Simpson point of a convex polygon
• A modification of the Fourier-Motskin algorithm for constructing a triangulation and its star coloring
• A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• Improvement of fixed point algorithms from a triangulation
• LMT-skeleton heuristics for several new classes of optimal triangulations
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg

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)