Vertex enumeration problem: Difference between revisions

Revision as of 21:50, 3 October 2013

Revision as of 14:13, 31 January 2014

Line 7:

The [[computational complexity]] of the problem is a subject of research in [[computer science]].

A 1992 article by [[David Avis]] and Komei Fukuda<ref>{{cite journal|url=http://www.springerlink.com/content/m7440v7p3440757u/ |author1=David Avis |author2=Komei Fukuda |title=A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra |journal=[[Discrete and Computational Geometry]] |volume=8 |number=1 |monthdate=December |year=1992 |pages=295-313 |doi=10.1007/BF02293050}}</ref> presents an algorithm which finds the ''v'' vertices of a polytope defined by a nondegenerate system of ''n'' inequalities in ''d'' dimensions (or, dually, the ''v'' [[facet]]s of the [[convex hull]] of ''n'' points in ''d'' dimensions, where each facet contains exactly ''d'' given points) in time [[Big Oh notation|O]](''ndv'') and [[space complexity|space]] O(''nd''). The ''v'' vertices in a simple arrangement of ''n'' [[hyperplane]]s in ''d'' dimensions can be found in O(''n''²''dv'') time and O(''nd'') space complexity. The Avis–Fukuda algorithm adapted the [[criss-cross algorithm]] for oriented matroids.

==Notes==

{{reflist}}

==References==

* {{cite journal|url=http://www.springerlink.com/content/m7440v7p3440757u/|first1=David|last1=Avis|first2=Komei|last2=Fukuda|authorlink2=Komei Fukuda|authorlink1=David Avis|title=A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra|journal=[[Discrete and Computational Geometry]]|volume=8|number=1|monthdate=December|year= 1992|pages=295–313

|doi=10.1007/BF02293050|mr=1174359|ref=harv}}