BibTeX records: W. Harry Plantinga

• > Home > Persons > W. Harry Plantinga

@inproceedings{DBLP:conf/jcdl/Plantinga01,
  author       = {W. Harry Plantinga},
  title        = {Digital facsimile editions and on-line editing},
  booktitle    = {{ACM/IEEE} Joint Conference on Digital Libraries, {JCDL} 2001, Roanoke,
                  Virginia, USA, June 24-28, 2001, Proceedings},
  pages        = {467},
  publisher    = {{ACM}},
  year         = {2001},
  url          = {https://doi.org/10.1145/379437.379802},
  doi          = {10.1145/379437.379802},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/jcdl/Plantinga01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ijcv/PlantingaD90,
  author       = {W. Harry Plantinga and
                  Charles R. Dyer},
  title        = {Visibility, occlusion, and the aspect graph},
  journal      = {Int. J. Comput. Vis.},
  volume       = {5},
  number       = {2},
  pages        = {137--160},
  year         = {1990},
  url          = {https://doi.org/10.1007/BF00054919},
  doi          = {10.1007/BF00054919},
  timestamp    = {Fri, 13 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ijcv/PlantingaD90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/focs/PlantingaD86,
  author       = {W. Harry Plantinga and
                  Charles R. Dyer},
  title        = {An Algorithm for Constructing the Aspect Graph},
  booktitle    = {27th Annual Symposium on Foundations of Computer Science, Toronto,
                  Canada, 27-29 October 1986},
  pages        = {123--131},
  publisher    = {{IEEE} Computer Society},
  year         = {1986},
  url          = {https://doi.org/10.1109/SFCS.1986.4},
  doi          = {10.1109/SFCS.1986.4},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/PlantingaD86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/compgeom/JosephP85,
  author       = {Deborah A. Joseph and
                  W. Harry Plantinga},
  editor       = {Joseph O'Rourke},
  title        = {On the complexity of reachability and motion planning questions (extended
                  abstract)},
  booktitle    = {Proceedings of the First Annual Symposium on Computational Geometry,
                  Baltimore, Maryland, USA, June 5-7, 1985},
  pages        = {62--66},
  publisher    = {{ACM}},
  year         = {1985},
  url          = {https://doi.org/10.1145/323233.323242},
  doi          = {10.1145/323233.323242},
  timestamp    = {Wed, 16 Jun 2021 12:03:34 +0200},
  biburl       = {https://dblp.org/rec/conf/compgeom/JosephP85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}