English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

A Probabilistic Approach to Reducing Algebraic Complexity of Delaunay Triangulations

MPS-Authors
/persons/resource/persons101795

Ghosh,  Arijit
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Ressource
No external resources are shared
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Boissonnat, J.-D., Dyer, R., & Ghosh, A. (2015). A Probabilistic Approach to Reducing Algebraic Complexity of Delaunay Triangulations. In N. Bansal, & I. Finocchi (Eds.), Algorithms -- ESA 2015 (pp. 595-606). Berlin: Springer. doi:10.1007/978-3-662-48350-3_50.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0028-6690-7
Abstract
There is no abstract available