English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Polyline Simplification has Cubic Complexity

MPS-Authors
/persons/resource/persons44182

Bringmann,  Karl
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons225687

Ray Chaudhury,  Bhaskar
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

Bringmann, K., & Ray Chaudhury, B. (2019). Polyline Simplification has Cubic Complexity. In G. Barequet, & Y. Wang (Eds.), 35th International Symposium on Computational Geometry (pp. 1-16). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.SoCG.2019.18.


Cite as: http://hdl.handle.net/21.11116/0000-0003-65C8-A
Abstract
There is no abstract available