29 search results - page 1 / 6 » Removing Even Crossings on Surfaces |
ENDM
2007
13 years 5 months ago
2007
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...
GD
2009
Springer
13 years 9 months ago
2009
Springer
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 ...
JCT
2007
13 years 5 months ago
2007
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...
ICRA
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract— This paper describes a method for removing adherent noises from image sequences. In outdoor environments, it is often the case that scenes taken by a camera are deterio...
GRAPHICSINTERFACE
2007
13 years 6 months ago
2007
We introduce a point-based algorithm for computing and rendering stream surfaces and path surfaces of a 3D flow. The points are generated by particle tracing, and an even distrib...