Preview
Unable to display preview. Download preview PDF.
References
Aho, A. V., Hopcroft, J. E., and Ullman, J. D., The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
Avis, D. and ElGindy, H., “Triangulating Point Sets in Space,” Discrete Comput. Geom. 2, pp. 99–111, 1987.
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.
Edelsbrunner, H., Algorithms in Combinatorial Geometry, Springer Verlag, 1986.
Edelsbrunner, H. and Huber, F., “Dissecting Sets of Points in Two and Three Dimensions,” Rep. F138, Inst. Informationsverarb., Techn. Univ. Graz, Austria, 1984.
Megiddo, N., “Linear Time Algorithms for Linear Programming in ℝ3 and Related Problems,” SIAM J. Comput., 12 pp. 759–776, 1983.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Numata, K., Tokuyama, T. (1990). Splitting a configuration in a simplex. In: Asano, T., Ibaraki, T., Imai, H., Nishizeki, T. (eds) Algorithms. SIGAL 1990. Lecture Notes in Computer Science, vol 450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52921-7_92
Download citation
DOI: https://doi.org/10.1007/3-540-52921-7_92
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52921-7
Online ISBN: 978-3-540-47177-6
eBook Packages: Springer Book Archive