<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">469074973</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180323132932.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170328e19920901xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/BF02293050</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/BF02293050</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="2">
   <subfield code="a">A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[David Avis, Komei Fukuda]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">We present a new pivot-based algorithm which can be used with minor modification for the enumeration of the facets of the convex hull of a set of points, or for the enumeration of the vertices of an arrangement or of a convex polyhedron, in arbitrary dimension. The algorithm has the following properties: (a) Virtually no additional storage is required beyond the input data. (b) The output list produced is free of duplicates. (c) The algorithm is extremely simple, requires no data structures, and handles all degenerate cases. (d) The running time is output sensitive for nondegenerate inputs. (e) The algorithm is easy to parallelize efficiently. For example, the algorithm finds thev vertices of a polyhedron inR d defined by a nondegenerate system ofn inequalities (or, dually, thev facets of the convex hull ofn points inR d, where each facet contains exactlyd given points) in timeO(ndv) andO(nd) space. Thev vertices in a simple arrangement ofn hyperplanes inR d can be found inO(n 2 dv) time andO(nd) space complexity. The algorithm is based on inverting finite pivot algorithms for linear programming.</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">Avis</subfield>
   <subfield code="D">David</subfield>
   <subfield code="u">School of Computer Science, McGill University, 3480 University Street, H3A 2A7, Montreal, Quebec, Canada</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Fukuda</subfield>
   <subfield code="D">Komei</subfield>
   <subfield code="u">Graduate School of Systems Management, University of Tsukuba, Otsuka, Bunkyo-ku, 112, Tokyo, Japan</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">8/3(1992-09-01), 295-313</subfield>
   <subfield code="x">0179-5376</subfield>
   <subfield code="q">8:3&lt;295</subfield>
   <subfield code="1">1992</subfield>
   <subfield code="2">8</subfield>
   <subfield code="o">454</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/BF02293050</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/BF02293050</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">Avis</subfield>
   <subfield code="D">David</subfield>
   <subfield code="u">School of Computer Science, McGill University, 3480 University Street, H3A 2A7, Montreal, Quebec, Canada</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">Fukuda</subfield>
   <subfield code="D">Komei</subfield>
   <subfield code="u">Graduate School of Systems Management, University of Tsukuba, Otsuka, Bunkyo-ku, 112, Tokyo, Japan</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">8/3(1992-09-01), 295-313</subfield>
   <subfield code="x">0179-5376</subfield>
   <subfield code="q">8:3&lt;295</subfield>
   <subfield code="1">1992</subfield>
   <subfield code="2">8</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>
