Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

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.


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: