A Short Proof of a Gauss Problem

De Fraysseix, Hubert and Ossona de Mendez, Patrice (1998) A Short Proof of a Gauss Problem. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997 , pp. 230-235(Official URL: http://dx.doi.org/10.1007/3-540-63938-1_65).

Full text not available from this repository.

Abstract

A traversal of a self crossing closed plane curve, with points of multiplicity at most two, defines a double occurrence sequence. C.F. Gauss conjectured [2] that such sequences could be characterized by their interlacement properties. This conjecture was proved by P. Rosenstiehl in 1976 [15]. We shall give here a simple self-contained proof of his characterization. This new proof relies on the D-switch operation.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-63938-1_65
Classifications: G Algorithms and Complexity > G.420 Crossings
G Algorithms and Complexity > G.560 Geometry
URI: http://gdea.informatik.uni-koeln.de/id/eprint/82

Actions (login required)

View Item View Item