Using interval arithmetic to prove that a set is path-connected

DOI10.1016/j.tcs.2005.09.055zbMath1087.68068OpenAlexW2141959453MaRDI QIDQ817868

Nicolas Delanoue, Bertrand Cottenceau, Jaulin, Luc

Publication date: 20 March 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.09.055

zbMATH Keywords

graph theoryinterval arithmetictopologyautomatic proofconnected setset computation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) General methods in interval analysis (65G40)

Related Items

Solving set-valued constraint satisfaction problems ⋮ Solving non-linear constraint satisfaction problems involving time-dependent functions ⋮ Guaranteeing the homotopy type of a set defined by non-linear inequalities ⋮ Robust set-membership state estimation; application to underwater robotics ⋮ Bracketing backward reach sets of a dynamical system

Cites Work

• Identification of parametric models from experimental data. Transl. from an upd. French version by the authors, with the help of John Norton
• Spatial Planning: A Configuration Space Approach
• Morse Theory. (AM-51)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item