Fast enumeration algorithms for non-crossing geometric graphs. Katoh, N. & Tanigawa, S. Discrete and Computational Geometry, 42(3):443--468, ACM Press, New York, New York, USA, April, 2009.
Fast enumeration algorithms for non-crossing geometric graphs [link]Paper  doi  bibtex   
@article{ Katoh2009a,
  address = {New York, New York, USA},
  author = {Katoh, Naoki and Tanigawa, Shin-ichi},
  doi = {10.1007/s00454-009-9164-4},
  file = {:Users/KunihiroWASA/Dropbox/paper/2009/Katoh, Tanigawa, Fast enumeration algorithms for non-crossing geometric graphs, 2009(2).pdf:pdf},
  isbn = {9781605580715},
  issn = {01795376},
  journal = {Discrete and Computational Geometry},
  keywords = {Enumeration,Non-crossing geometric graphs,Triangulations},
  month = {April},
  number = {3},
  pages = {443--468},
  publisher = {ACM Press},
  title = {{Fast enumeration algorithms for non-crossing geometric graphs}},
  url = {http://link.springer.com/10.1007/s00454-009-9164-4},
  volume = {42},
  year = {2009}
}

Downloads: 0