Farthest-Point Queries with Geometric and Combinatorial Constraints

Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexander Wolff. Farthest-Point Queries with Geometric and Combinatorial Constraints. In Jin Akiyama, Mikio Kano, Xuehou Tan, editors, Discrete and Computational Geometry, Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004, Revised Selected Papers. Volume 3742 of Lecture Notes in Computer Science, pages 62-75, Springer, 2004. [doi]

@inproceedings{DaescuMSW04,
  title = {Farthest-Point Queries with Geometric and Combinatorial Constraints},
  author = {Ovidiu Daescu and Ningfang Mi and Chan-Su Shin and Alexander Wolff},
  year = {2004},
  doi = {10.1007/11589440_7},
  url = {http://dx.doi.org/10.1007/11589440_7},
  tags = {constraints},
  researchr = {https://researchr.org/publication/DaescuMSW04},
  cites = {0},
  citedby = {0},
  pages = {62-75},
  booktitle = {Discrete and Computational Geometry, Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004, Revised Selected Papers},
  editor = {Jin Akiyama and Mikio Kano and Xuehou Tan},
  volume = {3742},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-30467-3},
}