Abstract
A Nef polyhedron is any set in ād(dā ā0) which can be obtained by applying a finite number of Boolean set operations cpl and ā© to (open) linear halfspaces. This paper summarizes the fundamentals of the theory of Nef polyhedra and illustrates them by means of simple 2D examples. The notions of Nef polyhedron, locally adjoined pyramid and face of a Nef polyhedron are carefully explained. Data structures for representing Nef polyhedra are discussed, and an implemented test-system is presented with the aid of a small application.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abramowski, S., MĆ¼ller, H.: Geometrisches Modellieren. Wissenschaftsverlag 1991.
Bieri, H.: Eine Charakterisierung der Polyeder. Elem. Math. 35, 143ā144 (1980).
Bieri, H.: Computing the Euler characteristic and related additive functionals of digital objects from their bintree representation. Comput. Vis. Graphics, Image Proc. 40, 115ā126 (1987).
Bieri, H.: Hyperimagesāan alternative to the conventional digital images. In: Eurographicsā 90 (Vandoni, C. E., Duce, D. A., eds.), pp. 341ā352. Amsterdam: North-Holland 1990.
Bieri, H.: Boolean and topological operations for Nef polyhedra. CSG 94 Set-theoretic solid modelling: techniques and applications, pp. 35-53. Information Geometers 1994.
Bieri, H., Mayor, D.: A ternary tree representation of generalized digital images. In: Virtual worlds and multimedia (Magnenat Thalmann, N., Thalmann, D., eds.), pp. 23ā35. New York: J. Wiley 1993.
Bieri, H., Nef, W.: A sweep-plane algorithm for computing the volume of polyhedra represented in Boolean form. Lin. Alg. Appl. 52/53, 69ā97 (1983).
Bieri, H., Nef, W.: Algorithms for the Euler characteristic and related additive functionals of digital objects. Comput. Vis. Graphics, Image Proc. 28, 166ā175 (1984).
Bieri, H., Nef, W.: A sweep-plane algorithm for computing the Euler characteristic of polyhedra represented in Boolean form. Computing 34, 287ā302 (1985).
Bieri, H., Nef, W.: Elementary set operations with d-dimensional polyhedra. In: Computational geometry and its applications (Noltemeier, H., Ć©d.), pp. 97ā112. Berlin Heidelberg New York Tokyo: Springer 1988 (Lecture Notes in Computer Science vol. 333).
Brisson, E.: Representing geometric structures in d dimensions: topology and order. Proceedings of the 5th Annual ACM Symposium on Computational Geometry, pp. 218ā227. New York: ACM Press 1989.
Dobrindt, K., Melhorn, K., Yvinec, M.: A complete and efficient algorithm for the intersection of a general and a convex polyhedron. In: Algorithms and data structures. (Dehne, F., Sack J.-R., Santoro N., Whitesides S., eds.), pp. 314ā324. Berlin Heidelberg New York Tokyo: Springer 1993 (Lecture Notes in Computer Science 709).
DĆ¼rst, M. J., Bieri, H., Kunii, T. L.: Two linear time algorithms for the Euler number of hierarchically represented digital pictures. Department of Information Science, University of Tokyo, Technical Report 90-007 (1990).
Edelsbrunner, H.: Algorithms in combinatorial geometry. Berlin Heidelberg New York Tokyo: Springer 1987.
Ferrucci, V., Paoluzzi, A.: Extrusion and boundary evaluation for multidimensional polyhedra. Comput. Aided Des. 23, 40ā50 (1991).
Gomes, J., Velho, L.: Abstraction paradigms for computer graphics. To appear in: Vis. Comput. (1995).
Grunbaum, B.: Convex polytopes. New York: Wiley 1967.
Hansen, H. O., Christensen, N. J.: A model for n-dimensional boundary topology. In: Second symposium on solid modeling and applications (Rossignac, J., Turner, J., Allen, G., eds.), pp. 65-73. ACM Press 1993.
Hadwiger, H.: Vorlesungen Ć¼ber Inhalt, OberflƤche und Isoperimetrie. Berlin Heidelberg: Springer 1957.
Hoffmann, C. M.: Geometric and solid modelingāan introduction. Morgan Kaufmann 1989.
Lienhardt, P.: Topological models for boundary representation: a comparison with n-dimensional generalized maps. Comput. Aided Des. 23, 59ā82 (1991).
MƤntylƤ, M.: An introduction to solid modeling. Computer Science Press 1988.
Nef, W.: BeitrƤge zur Theorie der Polyederāmit Anwendungen in der Computergraphik (Contributions to the theory of polyhedraāwith applications in computer graphics). Herbert Lang 1978.
Okino, N., Kakazu, Y., Kubo, H.: TIPS-1: technical information processing system for computer-aided design, drawing and manufacturing. In: Computer languages for numerical control (Hatvany, J., ed.), pp. 141ā150. Amsterdam: North-Holland 1973.
Paoluzzi, A., Bernardini, F., Cattani, C, Ferrucci, V.: Dimension-independent modeling with simplicial complexes. ACM Trans. Graphics 12, 56ā102 (1993).
Rappoport, A.: Then n-dimensional extended convex difference tree (ECDT) for representing polyhedra. Proceedings of the Symposium on Solid Modeling Foundations and CAD/CAM Applications, pp. 139-147. New York: ACM Press 1991.
Requicha, A. A. G.: Representations for rigid solids: theory, methods, and systems. ACM Comput. Surv. 12, 437ā464 (1980).
Requicha, A. A. G., Rossignac, J. R.: Solid modeling and beyond. IEEE Comput. Graphics Appl. 12, 31ā44 (1992).
Rossignac, J. R.: Through the cracks of the solid modeling milestone. Eurographicsā 91 State of The Art Report on Solid Modeling. In: From object modelling to advanced visualization (Coquillart, S., Strasser, W., Stucki, P., eds.), pp. 1ā75. Berlin Heidelberg New York Tokyo: Springer 1994.
Rossignac, J. R., OāConnor, M. A.: SGC: a dimension-independent model for pointsets with internal structure and incomplete boundaries. In: Geometric modeling for product engineering (Wozny, M. J., Turner, J. U, Preiss, K., eds.), pp. 145ā180. Amsterdam: North-Holland 1989.
Rossignac, J. R., Requicha, A. A. G.: Constructive non-regularized geometry. Comput. Aided Des. 23, 21ā32 (1991).
Rossignac, J. R., Voelcker, H. B.: Active zones in CSG for accelerating boundary evaluation, redundancy elimination, interference detection, and shading algorithms. ACM Trans. Graphics 8, 51ā87 (1989).
Sobhanpanath, C.: Extension of a boundary representation technique for the description of n-dimensional polytopes. Comput. Graphics 13, 17ā23 (1989).
Tilove, R. B.: Set membership classification: a unified approach to geometric intersection problems. IEEE Trans. Comput. C-29, 847ā883 (1980).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 1995 Springer-Verlag/Wien
About this paper
Cite this paper
Bieri, H. (1995). Nef Polyhedra: A Brief Introduction. In: Hagen, H., Farin, G., Noltemeier, H. (eds) Geometric Modelling. Computing Supplement, vol 10. Springer, Vienna. https://doi.org/10.1007/978-3-7091-7584-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-7091-7584-2_3
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-82666-9
Online ISBN: 978-3-7091-7584-2
eBook Packages: Springer Book Archive