Splitting a configuration in a simplex

  • Kazumiti Numata
  • Takeshi Tokuyama
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 450)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Aho, A. V., Hopcroft, J. E., and Ullman, J. D., The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.Google Scholar
  2. [2]
    Avis, D. and ElGindy, H., “Triangulating Point Sets in Space,” Discrete Comput. Geom. 2, pp. 99–111, 1987.Google Scholar
  3. [3]
    Blum, M. and Floyd, R.W., Pratt, V.R., Rivest, R.L., and Tarjan, R.E., “Time bounds for Selection,” J. Comput. System Sci. 7, pp. 448–461, 1972.Google Scholar
  4. [4]
    Edelsbrunner, H., Algorithms in Combinatorial Geometry, Springer Verlag, 1986.Google Scholar
  5. [5]
    Edelsbrunner, H. and Huber, F., “Dissecting Sets of Points in Two and Three Dimensions,” Rep. F138, Inst. Informationsverarb., Techn. Univ. Graz, Austria, 1984.Google Scholar
  6. [6]
    Megiddo, N., “Linear Time Algorithms for Linear Programming in ℝ3 and Related Problems,” SIAM J. Comput., 12 pp. 759–776, 1983.CrossRefGoogle Scholar
  7. [7]
    Numata, K., “Property of the Optimum Relaxed Solution for Problem to Schedule Independent Tasks on Unrelated Processors,” Journal of the Operations Research Society of Japan 32, pp. 233–259, 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Kazumiti Numata
    • 1
  • Takeshi Tokuyama
    • 2
  1. 1.Department of Computer Science and Information MathematicsThe Electro-Communication UniversityTokyoJapan
  2. 2.IBM ResearchTokyo Research LaboratoryTokyoJapan

Personalised recommendations