Sciweavers

Share
477 search results - page 1 / 96
» Removing even crossings
Sort
View
GD
2009
Springer
12 years 6 months ago
Removing Independently Even Crossings
We show that cr(G) ≤ 2 iocr(G) 2 settling an open problem of Pach and T´oth [4, 1]. Moreover, iocr(G) = cr(G) if iocr(G) ≤ 2. 1 Crossing Numbers Pach and T´oth point out in ...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
ENDM
2007
106views more  ENDM 2007»
12 years 1 months ago
Removing Even Crossings on Surfaces
In this paper we investigate how certain results related to the HananiTutte theorem can be extended from the plane to surfaces. We give a simple topological proof that the weak Ha...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
JCT
2007
111views more  JCT 2007»
12 years 1 months ago
Removing even crossings
An edge in a drawing of a graph is called even if it intersects every other edge of the graph an even number of times. Pach and T´oth proved that a graph can always be redrawn so...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
VISSYM
2004
12 years 3 months ago
DTI Visualization with Streamsurfaces and Evenly-Spaced Volume Seeding
Experimental evidence has shown that water diffusion is anisotropic in organized tissues such as white matter or muscles. Diffusion Tensor Imaging (DTI) is a non invasive MR techn...
Anna Vilanova, G. Berenschot, C. van de Pul
DMTCS
2010
157views Mathematics» more  DMTCS 2010»
11 years 11 months ago
Edge-Removal and Non-Crossing Configurations in Geometric Graphs
A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...
Oswin Aichholzer, Sergio Cabello, Ruy Fabila Monro...
books