Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

PARA
2004
Springer

favoriteEmaildiscussreport

278views Applied Computing» more PARA 2004»

Counting the Number of Connected Components of a Set and Its Application to Robotics

13 years 10 months ago

Counting the Number of Connected Components of a Set and Its Application to Robotics

Download www.ensieta.fr

This paper gives a numerical algorithm able to compute the number of path-connected components of a set S deﬁned by nonlinear inequalities. This algorithm uses interval analysis to create a graph which has the same number of connected components as S. An example coming from robotics is presented to illustrate the interest of this algorithm for path-planning.

Nicolas Delanoue, Luc Jaulin, Bertrand Cottenceau

Real-time Traffic

Applied Computing | Nonlinear Inequalities | Numerical Algorithm | PARA 2004 | Path-connected Components |

claim paper

Related Content

» Hybrid object labelling in digital images

» Tracking hidden agents through shadow information spaces

» Helly numbers of acyclic families

» A Separator Theorem for Graphs with an Excluded Minor and its Applications

» Applications of graph theory to an English rhyming corpus

» A general algorithm for detecting faults under the comparison diagnosis model

» Maximum Bipartite Matching Size And Application to Cuckoo Hashing

» Workload Design Selecting Representative ProgramInput Pairs

» Quantifying Thread Vulnerability for Multicore Architectures

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	PARA
Authors	Nicolas Delanoue, Luc Jaulin, Bertrand Cottenceau

Comments (0)