License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagRep.9.4.107
URN: urn:nbn:de:0030-drops-113064
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/11306/
Go back to Dagstuhl Reports

Cheng, Siu-Wing ; Driemel, Anne ; Erickson, Jeff
Weitere Beteiligte (Hrsg. etc.): Siu-Wing Cheng and Anne Driemel and Jeff Erickson

Computational Geometry (Dagstuhl Seminar 19181)

pdf-format:
dagrep_v009_i004_p107_19181.pdf (9 MB)

Abstract

This report documents the program and the outcomes of Dagstuhl Seminar 19181 "Computational Geometry". The seminar was held from April 28 to May 3, 2019 and 40 participants from various countries attended it. New advances and directions in computational geometry were presented and discussed. The report collects the abstracts of talks and open problems presented in the seminar.

BibTeX - Entry

@Article{cheng_et_al:DR:2019:11306,
  author =	{Siu-Wing Cheng and Anne Driemel and Jeff Erickson},
  title =	{{Computational Geometry (Dagstuhl Seminar 19181)}},
  pages =	{107--123},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2019},
  volume =	{9},
  number =	{4},
  editor =	{Siu-Wing Cheng and Anne Driemel and Jeff Erickson},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/11306},
  URN =		{urn:nbn:de:0030-drops-113064},
  doi =		{10.4230/DagRep.9.4.107},
  annote =	{Keywords: Computational geometry, polynomial partition, geometric data structures, approximation}
}

Keywords: Computational geometry, polynomial partition, geometric data structures, approximation
Collection: Dagstuhl Reports, Volume 9, Issue 4
Issue Date: 2019
Date of publication: 30.09.2019

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI