<div class="csl-bib-body">
<div class="csl-entry">Ausserhofer, M., Dann, S., Lángi, Z., & Tóth, G. (2019). An algorithm to find maximum area polygons circumscribed about a convex polygon. <i>Discrete Applied Mathematics</i>, <i>255</i>, 98–108. https://doi.org/10.1016/j.dam.2018.08.017</div>
</div>
-
dc.identifier.issn
0166-218X
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/142449
-
dc.language.iso
en
-
dc.publisher
ELSEVIER
-
dc.relation.ispartof
Discrete Applied Mathematics
-
dc.subject
Applied Mathematics
-
dc.subject
Discrete Mathematics and Combinatorics
-
dc.title
An algorithm to find maximum area polygons circumscribed about a convex polygon
en
dc.type
Artikel
de
dc.type
Article
en
dc.description.startpage
98
-
dc.description.endpage
108
-
dc.type.category
Original Research Article
-
tuw.container.volume
255
-
tuw.journal.peerreviewed
true
-
tuw.peerreviewed
true
-
tuw.researchTopic.id
A3
-
tuw.researchTopic.name
Fundamental Mathematics Research
-
tuw.researchTopic.value
100
-
dcterms.isPartOf.title
Discrete Applied Mathematics
-
tuw.publication.orgunit
E104-06 - Forschungsbereich Konvexe und Diskrete Geometrie
-
tuw.publisher.doi
10.1016/j.dam.2018.08.017
-
dc.identifier.eissn
1872-6771
-
dc.description.numberOfPages
11
-
wb.sci
true
-
wb.sciencebranch
Mathematik
-
wb.sciencebranch.oefos
1010
-
wb.facultyfocus
Diskrete Mathematik und Geometrie
de
wb.facultyfocus
Discrete Mathematics and Geometry
en
wb.facultyfocus.faculty
E100
-
item.grantfulltext
none
-
item.openairecristype
http://purl.org/coar/resource_type/c_2df8fbb1
-
item.openairetype
research article
-
item.languageiso639-1
en
-
item.cerifentitytype
Publications
-
item.fulltext
no Fulltext
-
crisitem.author.dept
E104 - Institut für Diskrete Mathematik und Geometrie