449 search results - page 19 / 90 » Degenerate crossing numbers |
JCT
2007
13 years 7 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...
SWAT
1998
Springer
13 years 11 months ago
1998
Springer
Let C be a collection of n Jordan regions in the plane in general position, such that each pair of their boundaries intersect in at most s points, where s is a constant. Let U den...
NIPS
2004
13 years 8 months ago
2004
We propose to selectively remove examples from the training set using probabilistic estimates related to editing algorithms (Devijver and Kittler, 1982). This heuristic procedure ...
COMPGEOM
2000
ACM
13 years 11 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
ASSETS
2000
ACM
13 years 11 months ago
2000
ACM
People with severe visual impairment need a means of remaining oriented to their environment as they move through it. Three wearable orientation interfaces were developed and eval...