Skip Navigation

The Computer Journal 1993 36(5):504-514; doi:10.1093/comjnl/36.5.504
© 1993 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (9)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Canny, J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Computing Roadmaps of General Semi-Algebraic Sets

J. Canny §

Computer Science Division, University of California, Berkeley, CA 94720, USA

In this paper we study the problem of determining whether two points lie in the same connected component of a semi-algebraic set S. Although we are mostly concerned with sets S {subseteq} Rk, our algorithm can also decide if points in an arbitrary set S {subseteq} Rk can be joined by joined by a semi-algebraic path, for any real closed field R. Our algorithm computes a one-dimensional semi-algebraic subset R(S) of S (actually of an embedding of S in a space Rk for a certain real extension field R of the given field R. R(S) is called the roadmap of S. The basis of this work is the roadmap algorithm described in [3,4] which worked only for compact, regularly stratified sets.

We measure the complexity of the formula describing the set S by the number of polynomials n, their maximum degree d, the maximum length of their coefficients in bits c, and the number of variables k. With respect to the above measures, the bit complexity of our new algorithm is (nk log n)dO(k2))(c log n(1+) randomized, or (nk log n)dO(k4)c1+) deterministic, for any >0. Note that the combinatorial complexity (complexity in terms of n) in both cases is within a polylog factor of the worst-case lower bound for the number of connected components {Omega}(nk).

Received November 1992. revised May 1993.

* Computer Science Division, University of California, Berkeley, CA 94720, USA

§ Supported by a David and Lucile Packard Foundation Fellowship and by NSF Presidential Yound Investigator Grant IRI-8958577


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.