Conference paper
Geometric algorithms for a minimum cost assignment problem
Takeshi Tokuyama, Jun Nakano
SCG 1991
It is known that for simple arrangements in the d-dimensional Euclidean space RdThe average number of j-dimensional subfaces of a k-dimensional face is less than {Mathematical expression}. In this paper, we show that this is also true for all arrangements in Rd and for all oriented matroids, and we give combinatorial proofs. © 1993 Kluwer Academic Publishers.
Takeshi Tokuyama, Jun Nakano
SCG 1991
Komei Fukuda, Shigemasa Saito, et al.
Discrete Applied Mathematics
Yasuhiko Morimoto, Takeshi Fukuda, et al.
IEEE Transactions on Knowledge and Data Engineering
Naoki Katoh, Takeshi Tokuyama, et al.
FOCS 1992