<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">46907521X</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180323132933.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170328e19920101xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/BF02187823</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/BF02187823</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Finding minimum area k -gons</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[David Eppstein, Mark Overmars, Günter Rote, Gerhard Woeginger]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">Given a setP ofn points in the plane and a numberk, we want to find a polygon with vertices inP of minimum area that satisfies one of the following properties: (1) is a convexk-gon, (2) is an empty convexk-gon, or (3) is the convex hull of exactlyk points ofP. We give algorithms for solving each of these three problems in timeO(kn 3). The space complexity isO(n) fork=4 andO(kn 2) fork≥5. The algorithms are based on a dynamic programming approach. We generalize this approach to polygons with minimum perimeter, polygons with maximum perimeter or area, polygons containing the maximum or minimum number of points, polygons with minimum weight (for some weights added to vertices), etc., in similar time bounds.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer-Verlag New York Inc., 1992</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Eppstein</subfield>
   <subfield code="D">David</subfield>
   <subfield code="u">Department of Computer Science, University of California, 92717, Irvine, CA, USA</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Overmars</subfield>
   <subfield code="D">Mark</subfield>
   <subfield code="u">Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB, Utrecht, The Netherlands</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Rote</subfield>
   <subfield code="D">Günter</subfield>
   <subfield code="u">Institut für Mathematik, Technische Universität Graz, Kopernikusgasse 24, A-8010, Graz, Austria</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Woeginger</subfield>
   <subfield code="D">Gerhard</subfield>
   <subfield code="u">Institut für Mathematik, Technische Universität Graz, Kopernikusgasse 24, A-8010, Graz, Austria</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Discrete &amp; Computational Geometry</subfield>
   <subfield code="d">Springer New York</subfield>
   <subfield code="g">7/1(1992-01-01), 45-58</subfield>
   <subfield code="x">0179-5376</subfield>
   <subfield code="q">7:1&lt;45</subfield>
   <subfield code="1">1992</subfield>
   <subfield code="2">7</subfield>
   <subfield code="o">454</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/BF02187823</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/BF02187823</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Eppstein</subfield>
   <subfield code="D">David</subfield>
   <subfield code="u">Department of Computer Science, University of California, 92717, Irvine, CA, USA</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Overmars</subfield>
   <subfield code="D">Mark</subfield>
   <subfield code="u">Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB, Utrecht, The Netherlands</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Rote</subfield>
   <subfield code="D">Günter</subfield>
   <subfield code="u">Institut für Mathematik, Technische Universität Graz, Kopernikusgasse 24, A-8010, Graz, Austria</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Woeginger</subfield>
   <subfield code="D">Gerhard</subfield>
   <subfield code="u">Institut für Mathematik, Technische Universität Graz, Kopernikusgasse 24, A-8010, Graz, Austria</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Discrete &amp; Computational Geometry</subfield>
   <subfield code="d">Springer New York</subfield>
   <subfield code="g">7/1(1992-01-01), 45-58</subfield>
   <subfield code="x">0179-5376</subfield>
   <subfield code="q">7:1&lt;45</subfield>
   <subfield code="1">1992</subfield>
   <subfield code="2">7</subfield>
   <subfield code="o">454</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
