2 Search Results for "Schulz, Sarah"

Document

Computational Creativity Meets Digital Literary Studies (Dagstuhl Seminar 19172)

Authors: Tarek Richard Besold, Pablo Gervás, Evelyn Gius, and Sarah Schulz

Published in: Dagstuhl Reports, Volume 9, Issue 4 (2019)

Abstract

This report documents the outcomes of Dagstuhl Seminar 19172 "Computational Creativity Meets Digital Literary Studies", held from April 22 to April 25, 2019. Computational Creativity and Digital Humanities are emerging, interdisciplinary fields still experiencing significant growth and development in terms of community, research questions, methods, and approaches. Computational Storytelling as a prominent subfield within Computational Creativity that has mostly focused on planning stories - thus simulating a logically coherent plot - could fruitfully extend its horizon to narrative concepts like narrative style, chronology of narratives, focalization and perspective. These narratological concepts have been investigated by literary scholars for a long time. Yet, operationalization of these concepts is required when used as the basis for computational modelling. This in turn sharpens the definitions of theoretical considerations and can feed back into theoretical discussions in the literary studies. Moreover, there are obvious connection points between Computational Creativity and Natural Language Processing on the one hand, and between Natural Language Processing and Digital Literary Studies on the other hand. However, these connections currently are not transitive. The goal of the seminar was to establish international links between all three disciplines and among involved researchers through presentations by participants and extensive group-work sessions.

Cite as

Tarek Richard Besold, Pablo Gervás, Evelyn Gius, and Sarah Schulz. Computational Creativity Meets Digital Literary Studies (Dagstuhl Seminar 19172). In Dagstuhl Reports, Volume 9, Issue 4, pp. 87-106, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)

Copy BibTex To Clipboard

@Article{besold_et_al:DagRep.9.4.87,
  author =	{Besold, Tarek Richard and Gerv\'{a}s, Pablo and Gius, Evelyn and Schulz, Sarah},
  title =	{{Computational Creativity Meets Digital Literary Studies (Dagstuhl Seminar 19172)}},
  pages =	{87--106},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2019},
  volume =	{9},
  number =	{4},
  editor =	{Besold, Tarek Richard and Gerv\'{a}s, Pablo and Gius, Evelyn and Schulz, Sarah},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.9.4.87},
  URN =		{urn:nbn:de:0030-drops-113054},
  doi =		{10.4230/DagRep.9.4.87},
  annote =	{Keywords: computational creativity, computational narrativity, digital humanities, digital literary studies, storytellin}
}

Document

DOI: 10.4230/LIPIcs.STACS.2013.269

Algorithms for Designing Pop-Up Cards

Authors: Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, André Schulz, Diane L. Souvaine, Giovanni Viglietta, and Andrew Winslow

Published in: LIPIcs, Volume 20, 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)

Abstract

We prove that every simple polygon can be made as a (2D) pop-up card/book that opens to any desired angle between 0 and 360°. More precisely, given a simple polygon attached to the two walls of the open pop-up, our polynomial-time algorithm subdivides the polygon into a single-degree-of-freedom linkage structure, such that closing the pop-up flattens the linkage without collision. This result solves an open problem of Hara and Sugihara from 2009. We also show how to obtain a more efficient construction for the special case of orthogonal polygons, and how to make 3D orthogonal polyhedra, from pop-ups that open to 90°, 180°, 270°, or 360°.

Cite as

Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, André Schulz, Diane L. Souvaine, Giovanni Viglietta, and Andrew Winslow. Algorithms for Designing Pop-Up Cards. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 269-280, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@InProceedings{abel_et_al:LIPIcs.STACS.2013.269,
  author =	{Abel, Zachary and Demaine, Erik D. and Demaine, Martin L. and Eisenstat, Sarah and Lubiw, Anna and Schulz, Andr\'{e} and Souvaine, Diane L. and Viglietta, Giovanni and Winslow, Andrew},
  title =	{{Algorithms for Designing Pop-Up Cards}},
  booktitle =	{30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)},
  pages =	{269--280},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-50-7},
  ISSN =	{1868-8969},
  year =	{2013},
  volume =	{20},
  editor =	{Portier, Natacha and Wilke, Thomas},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.269},
  URN =		{urn:nbn:de:0030-drops-39407},
  doi =		{10.4230/LIPIcs.STACS.2013.269},
  annote =	{Keywords: geometric folding, linkages, universality}
}

Refine by Author
1 Abel, Zachary
1 Besold, Tarek Richard
1 Demaine, Erik D.
1 Demaine, Martin L.
1 Eisenstat, Sarah
Show More...

Refine by Classification

Refine by Keyword
1 computational creativity
1 computational narrativity
1 digital humanities
1 digital literary studies
1 geometric folding
Show More...

Refine by Type
2 document

Refine by Publication Year
1 2013
1 2019

2 Search Results for "Schulz, Sarah"

Computational Creativity Meets Digital Literary Studies (Dagstuhl Seminar 19172)

Abstract

Cite as

Algorithms for Designing Pop-Up Cards

Abstract

Cite as

Thanks for your feedback!

Could not send message