Hacker News new | ask | show | jobs
by eru 6295 days ago
Could you give me a source or the name of the algorithm, that allows this running time?
2 comments

The Wikipedia article on planarity testing cites, for instance, this paper: http://jgaa.info/accepted/2004/BoyerMyrvold2004.8.3.pdf which describes a not-insanely-complicated algorithm that constructs planar embeddings (or proves they don't exist) in linear time.
P.S. I found a O(n) running time for planarity testing - but not embedding.