Elementary set operations with d-dimensional polyhedra

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 333 LNCS, Issue , 1988, Pages 97-112

  Bieri, H ^a   Nef, W ^a  

^a UNIVERSITY OF BERN   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85034809502     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-50335-8_28     Document Type: Conference Paper

References (25)

1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Data structures and algorithms. Reading: Addison-Wes1ey 1983.
2. Bentley, J.L., Ottmann, T.A.: Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput. C-28, 643-647 (1979).
3. Bieri, H.S. Eine Charakterisierung der Polyeder. Elemente Math. 35, 143-144 (1980).
4. 01. Computing 28, 189-198 (1982).
5. Bieri, H., Nef, W.: A sweep-plane algorithm for computing the volume of polyhedra represented in Boolean form. Linear Algebra Appl. 52/53, 69-97 (1983).
6. Bieri, H., Nef, W.: A sweep-plane algorithm for computing the Euler-character istic of polyhedra represented in Boolean form. Computing 34, 287-302 (1985).
7. Bieri, H.: Wechselwirkung zwischen der Computergrafik und der Theorie der Polyeder. Informatik-Fachberichte 126, 441-455. Berlin: Springer 1986.
8. Brüderlin, B.D.: Rule-based geometric modelling. Dissertation, ETH Zürich. Zürichs Verlag der Fachvereine 1988.
9. Bruggesser, H.: Ein Programmsystem für die graphische Darstellung von Polyedern, Dissertation, Universität Bern 1975.
10. Chazelle, B., Dobkin, D.P.: Intersection of convex objects in two and three dimensions. J.ACM 34, 1-27 (1987).
11. Edelsbrunner, H., Orourke, J., Seidel, R.: Constructing arrangements of lines and hyperplanes with applications. SIAM J. Comput. 15, 341-363 (1986).
12. Edelsbrunner, H.: Algorithms in combinatoria1 geometry. Berlin: Springer 1987.
13. Hertel, S., Mäntylä, M., Mehlhorn, K., Nievergelt, J.: Space sweep solves intersection of convex polyhedra. Acta Informatica 21, 501-519 (1984).
14. Laidlaw, D.H., Trumbore, W.B., Hughes, J.F.: Constructive solid geometry for polyhedral objects. ACM SIGGRAPH’86 Proc., 161-170.
15. Maibach, B.; MATIP-Eine Benutzersprache und ein Interpreter für mathematische Anwendungen. Dissertation, Universität Bern 1982.
16. Mehlhorn, K., Simon, K.: Intersecting two polyhedra one of which is convex. Lecture Notes in Computer Science 199, 534-542. Berlin: Springer 1985.
17. Meier, A.: Methoden der grafischen und geometrischen Datenverarbeitung. Stuttgart: Teubner 1986.
18. Muller, D.E., Preparata, F.P.: Finding the intersection of two convex polyhedra. Theor. Comput. Sei. 7, 217-236 (1978).
19. Nef, W.: Beiträge zur Theorie der Polyeder, mit Anwendungen in der Computergraphik. Bern: Herbert Lang 1978.
20. Preparata, F.P., Shamos, M.I.: Computational geometry-An introduction. Berlin: Springer 1985.
21. Requicha, A.A.G.: Representations for rigid solids; Theory, methods, and systems. ACM Comput.Surv. 12, 437-464 (1980).
22. Schmidt, P.M.: Algorithm for constructing a sweep-plane which is in general position to a given point set. Manuskript, Friedrich-Schi1ler-Universitat Jena 1987.
23. Shamos, M.I., Hoey, D.: Geometric intersection problems. 17th Annual IEEE Symp. Foundations of Comput Sei. 1976, 208-215.
24. Six, H.W., Wood, D.: Counting and reporting intersections of d-ranges. IEEE Trans. Comput. C-31, 181-187 (1982).
25. Vogel, V.: Mathematische Modelle für die Geometr ieverarbei tung mengentheoretisch-algebraische Grundlagen und ein (Fleisch, Haut)-Model1. Technische Universität Dresden, Sektion Mathematik, Nr. 07-07-84.