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

DOI10.1016/J.TCS.2005.09.055MaRDI QIDQ817868zbMATH OpenOpenAlexFDO

Authors Nicolas Delanoue, Bertrand Cottenceau, L. Jaulin

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

topologygraph theoryinterval arithmeticautomatic proofconnected setset computation

Mathematics Subject Classification ID

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

Recommendations

• Path planning using intervals and graphs
• Computing Roadmaps of General Semi-Algebraic Sets
• scientific article; zbMATH DE number 589123
• Publication:4892225
• scientific article; zbMATH DE number 3854311

Cites work

• scientific article; zbMATH DE number 1595639 (Why is no real title available?)
• scientific article; zbMATH DE number 3649911 (Why is no real title available?)
• scientific article; zbMATH DE number 3905413 (Why is no real title available?)
• scientific article; zbMATH DE number 4102053 (Why is no real title available?)
• scientific article; zbMATH DE number 1748069 (Why is no real title available?)
• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• scientific article; zbMATH DE number 3103212 (Why is no real title available?)
• Identification of parametric models from experimental data. Transl. from an upd. French version by the authors, with the help of John Norton
• Morse Theory. (AM-51)
• Spatial Planning: A Configuration Space Approach

Cited in

(5)

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

This page was built for publication: Using interval arithmetic to prove that a set is path-connected

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