home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.theory
- Path: sparky!uunet!cs.utexas.edu!torn!watserv2.uwaterloo.ca!watmath!neumann.uwaterloo.ca!alopez-o
- From: alopez-o@neumann.uwaterloo.ca (Alex Lopez-Ortiz)
- Subject: Re: A sorting Exercise
- Message-ID: <BtK5tM.DLF@math.uwaterloo.ca>
- Sender: news@math.uwaterloo.ca (News Owner)
- Organization: University of Waterloo
- References: <1992Aug25.184708.352@dartvax.dartmouth.edu>
- Date: Tue, 25 Aug 1992 21:17:45 GMT
- Lines: 38
-
- In article <1992Aug25.184708.352@dartvax.dartmouth.edu>, scot@moosilauke.dartmouth.edu (Scot Drysdale) writes:
- > The question about sorting a sequence on a closed loop with every crossing
- > labeled is called Jordan Sorting (from the Jordan Curve theorem, I assume).
- > It can be done in linear time. See
- >
- > K. Hoffman, K. Mehlhorn, P. Rosenstiehl, and R. E. Tarjan, "Sorting
- > Jordan Sequences in Linear Time," Proc. Symp. Computational Geometry,
- > pp. 196-203 (1985).
- >
-
- Jordan Sequences are a bit different than those proposed by the original
- posting. In fact 6 1 5 4 3 2 is a jordan sequence corresponding to a
- Jordan curve crossing the real line in 6 then at 1, 5, 4, 3, 2.
-
- This sequence does not have a Jorden sequence traversing through them
- in the sense of the original posting.
-
- > I-----------------------------------I
- > I I
- > I I-------------------I I
- > I I I I
- > I I I-----------I I I
- > I I I I I I
- > I I I I I---I I I I
- > I I I I I I I I I
- >=87==93===7==45==54==62==32==15=======I=====
- > I I I I I I I I I
- > I---I I I---I I I---I I
- > I I I
- > I I---------------I
- > I
-
- Hope it helps.
-
- --
- Alex Lopez-Ortiz alopez-o@maytag.UWaterloo.ca
- Deparment of Computer Science University of Waterloo
- Waterloo, Ontario Canada
-