English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Polyline Simplification has Cubic Complexity

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.

Item is

Basic

show hide
Genre: Conference Paper

Files

show Files

Locators

show
hide
Description:
-
OA-Status:
Locator:
http://drops.dagstuhl.de/doku/urheberrecht1.html (Copyright transfer agreement)
Description:
-
OA-Status:

Creators

show
hide
 Creators:
Bringmann, Karl1, Author           
Ray Chaudhury, Bhaskar1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 20192019
 Publication Status: Published online
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: Bringmann_SoCG2019b
DOI: 10.4230/LIPIcs.SoCG.2019.18
URN: urn:nbn:de:0030-drops-104224
 Degree: -

Event

show
hide
Title: 35th International Symposium on Computational Geometry
Place of Event: Portland, OR, USA
Start-/End Date: 2019-06-18 - 2019-06-21

Legal Case

show

Project information

show

Source 1

show
hide
Title: 35th International Symposium on Computational Geometry
  Abbreviation : SoCG 2019
Source Genre: Proceedings
 Creator(s):
Barequet, Gill1, Editor
Wang, Yusu1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Wadern : Schloss Dagstuhl
Pages: - Volume / Issue: - Sequence Number: 18 Start / End Page: 1 - 16 Identifier: ISBN: 978-3-95977-104-7

Source 2

show
hide
Title: Leibniz International Proceedings in Informatics
  Abbreviation : LIPIcs
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 129 Sequence Number: - Start / End Page: - Identifier: -