English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

On the Complexity of Closest Pair via Polar-Pair of Point-Sets

MPS-Authors
/persons/resource/persons180826

Laekhanukit,  Bundit
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

David, R., Karthik, C. S., & Laekhanukit, B. (2018). On the Complexity of Closest Pair via Polar-Pair of Point-Sets. In B. Speckmann, & C. D. Tóth (Eds.), 34th International Symposium on Computational Geometry (pp. 1-15). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.SoCG.2018.28.


Cite as: http://hdl.handle.net/21.11116/0000-0002-A827-5
Abstract
There is no abstract available