Spanning trees with low crossing number
Jiří Matoušek (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Computing the connected components of simple rectilinear geometrical objects in -space”
Spanning trees with low crossing number
One-to-one continuous images of a line
F. Jones (1970)
Fundamenta Mathematicae
Similarity:
An application of -ary trees to the design of data structures for geometric searching problems
M. Talamo, G. Gambosi (1989)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Parallel algorithms on interval graphs
V. B. Balayogan, C. Pandu Rangan (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Concerning connectedness im kleinen and a related property
R. Moore (1922)
Fundamenta Mathematicae
Similarity:
Sierpinski has shown (Wacław Sierpiński Sur une condition pour qu'un continu soit une courbe jordanienne, Fundamenta Mathematicae I (1920), pp. 44-60) that in order that a closed and connected set of points M should be a continuous curve it is necessary and sufficient that, for every positive number ϵ, the connected point-set M should be the sum of a finite number of closed and connected point-sets each of diameter less than ϵ. It follows that, as applied to point-sets which are closed,...
Using persistent data structures for adding range restrictions to searching problems
Hans-Peter Lenhof, Michiel Smid (1994)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Polygon placement under translation and rotation
Francis Avnaim, Jean-Daniel Boissonnat (1989)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A generalization of Darboux theorem.
Dugošija, Đorđe (2001)
Matematichki Vesnik
Similarity: