K
Komei Fukuda
Researcher at Keio University
Publications - 111
Citations - 4316
Komei Fukuda is an academic researcher from Keio University. The author has contributed to research in topics: Polytope & Matroid. The author has an hindex of 27, co-authored 111 publications receiving 4085 citations. Previous affiliations of Komei Fukuda include McGill University & University of Tsukuba.
Papers
More filters
Journal ArticleDOI
Reverse search for enumeration
David Avis,Komei Fukuda +1 more
TL;DR: This paper develops the reverse search technique in a general framework and shows its broader applications to various problems in operations research, combinatorics, and geometry, and proposes new algorithms for listing.
Proceedings ArticleDOI
A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
David Avis,Komei Fukuda +1 more
TL;DR: 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 listing of the vertices of an arrangement or of a convex polyhedron, in arbitrary dimension is presented.
Book ChapterDOI
Double Description Method Revisited
Komei Fukuda,A. Prodon +1 more
TL;DR: This paper reinvestigate this method for enumerating all extreme rays of a general polyhedral cone in ℝd, introduces some new ideas for efficient implementations, and shows some empirical results indicating its practicality in solving highly degenerate problems.
Book ChapterDOI
Exact Volume Computation for Polytopes: A Practical Study
TL;DR: In this article, the authors study several known volume computation algorithms for convex d-polytopes by classifying them into two classes, triangulation methods and signed-decomposition methods.
Journal ArticleDOI
From the Zonotope Construction to the Minkowski Addition of Convex Polytopes
TL;DR: The main objective of the present work is to introduce an ecien t algorithm for variable d and k, a natural extension of a known algorithm for the zonotope construction, based on linear programming and reverse search that is compact, highly parallelizable and very easy to implement.