Sciweavers

29 search results - page 1 / 6
» Removing Even Crossings on Surfaces
Sort
View
ENDM
2007
106views more  ENDM 2007»
13 years 9 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...
GD
2009
Springer
14 years 2 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...
JCT
2007
111views more  JCT 2007»
13 years 9 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...
ICRA
2008
IEEE
156views Robotics» more  ICRA 2008»
14 years 3 months ago
Removal of adherent noises from image sequences by spatio-temporal image processing
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...
Atsushi Yamashita, Isao Fukuchi, Toru Kaneko, Kenj...
GRAPHICSINTERFACE
2007
13 years 10 months ago
Point-based stream surfaces and path surfaces
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...
Tobias Schafhitzel, Eduardo Tejada, Daniel Weiskop...