Some computational aspects of Helly-type theorems

zbMATH Open1168.52006MaRDI QIDQ3622641FDOQ3622641

Authors:

Publication date: 28 April 2009

Recommendations

• COMPUTATIONAL ASPECTS OF HELLY’S THEOREM AND ITS RELATIVES
• Quantitative combinatorial geometry for concave functions
• On Helly's theorem: Algorithms and extensions
• scientific article; zbMATH DE number 3996525
• Some computational aspects of geodesic convex sets in a simple polygon

zbMATH Keywords

set of constant widthHelly's theoremset of width

Mathematics Subject Classification ID

Helly-type theorems and geometric transversal theory (52A35)

Cited In (6)

• An optimized explicit Runge-Kutta-Nyström method for the numerical solution of orbital and related periodical initial value problems
• Some computational aspects of geodesic convex sets in a simple polygon
• On the computational content of the Bolzano-Weierstraß Principle
• COMPUTATIONAL ASPECTS OF HELLY’S THEOREM AND ITS RELATIVES
• Construction of an optimized explicit Runge-Kutta-Nyström method for the numerical solution of oscillatory initial value problems
• An optimized explicit Runge-Kutta method with increased phase-lag order for the numerical solution of the Schrödinger equation and related problems

This page was built for publication: Some computational aspects of Helly-type theorems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3622641)