Fast enumeration algorithms for non-crossing geometric graphs

Naoki Katoh, Shin-ichi Tanigawa. Fast enumeration algorithms for non-crossing geometric graphs. In Monique Teillaud, editor, Proceedings of the 24th ACM Symposium on Computational Geometry, College Park, MD, USA, June 9-11, 2008. pages 328-337, ACM, 2008. [doi]

Abstract

Abstract is missing.