Efficient Neighbourhood Computing for Discrete Rigid Transformation Graph Search. Kenmochi, Y., Ngo, P., Talbot, H., & Passat, N. In Discrete Geometry for Computer Imagery - 18th IAPR International Conference, DGCI 2014, Siena, Italy, September 10-12, 2014. Proceedings, pages 99–110, 2014.
Efficient Neighbourhood Computing for Discrete Rigid Transformation Graph Search [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/dgci/KenmochiNTP14,
  author    = {Yukiko Kenmochi and
               Phuc Ngo and
               Hugues Talbot and
               Nicolas Passat},
  title     = {Efficient Neighbourhood Computing for Discrete Rigid Transformation
               Graph Search},
  booktitle = {Discrete Geometry for Computer Imagery - 18th {IAPR} International
               Conference, {DGCI} 2014, Siena, Italy, September 10-12, 2014. Proceedings},
  pages     = {99--110},
  year      = {2014},
  crossref  = {DBLP:conf/dgci/2014},
  url       = {https://doi.org/10.1007/978-3-319-09955-2\_9},
  doi       = {10.1007/978-3-319-09955-2\_9},
  timestamp = {Sun, 23 Dec 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/dgci/KenmochiNTP14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0