Front Matter, Table of Contents, Foreword, Conference Organization, Additional Reviewers, Acknowledgement of Support, Invited Talks
DOI10.4230/LIPICS.SOCG.2018.0zbMATH Open1390.68027OpenAlexW2963329819MaRDI QIDQ4569656FDOQ4569656
Author name not available (Why is that?)
Publication date: 27 June 2018
Full work available at URL: http://drops.dagstuhl.de/opus/volltexte/lipics-complete/lipics-vol99-socg2018-complete.pdf
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)
Cites Work
- Hanani-Tutte for approximating maps of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- From a $(p,2)$-Theorem to a Tight $(p,q)$-Theorem
- Title not available (Why is that?)
- An optimal algorithm to compute the inverse beacon attraction region
- Title not available (Why is that?)
- On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance
- Title not available (Why is that?)
Cited In (2)
This page was built for publication: Front Matter, Table of Contents, Foreword, Conference Organization, Additional Reviewers, Acknowledgement of Support, Invited Talks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4569656)