Skip to main content

Splitting a configuration in a simplex

  • Conference paper
  • First Online:
Algorithms (SIGAL 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 450))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A. V., Hopcroft, J. E., and Ullman, J. D., The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.

    Google Scholar 

  2. Avis, D. and ElGindy, H., “Triangulating Point Sets in Space,” Discrete Comput. Geom. 2, pp. 99–111, 1987.

    Google Scholar 

  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. Edelsbrunner, H., Algorithms in Combinatorial Geometry, Springer Verlag, 1986.

    Google Scholar 

  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. Megiddo, N., “Linear Time Algorithms for Linear Programming in ℝ3 and Related Problems,” SIAM J. Comput., 12 pp. 759–776, 1983.

    Article  Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Tetsuo Asano Toshihide Ibaraki Hiroshi Imai Takao Nishizeki

Rights and permissions

Reprints 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

Publish with us

Policies and ethics