Abstract
The preclassification of the vertices of a polyhedron is the central part of a recently proposed point-in-polyhedron algorithm [HT89]. We show that this preclassification is related to the convex hull on a sphere. This allows an unified approach for very general polyhedra of arbitrary dimensions and for all boundary entities (vertices, edges, faces). It also reduces the time complexity of preclassification in 3D. Replacing preclassification by delayed classification leads to an additional reduction of time complexity.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Berger, M. Geometry II, Springer-Verlag, Berlin, 1987.
Bieri, H., and Nef, W. Elementary set operations with d-dimensional polyhedra. Proc. 4th Workshop for Computational Geometry, March 1988.
Crocker, Gary A., and Reinke, William A. An editable nonmanifold boundary representation. IEEE Comp. Graph. and Appl. 11, 2 (March 1991), 39–50.
Dobkin, D., Guibas, L., Hershberger, J., and Snoeyink, J. An efficient algorithm for finding the CSG representation of a simple polygon. Computer Graphics (Proc. SIGGRAPH) 22, 4 (1988), 31–40.
Dürst, Martin J., and Kunii, Tosiyasu L. Vertex classification using the convex hull on a sphere. Proc. Intern. Workshop on Discrete Algorithms and Complexity, H. Imai, Ed. IPSJ, Tokyo, 1989, pp. 25–32.
Guibas, L., Ramshaw, L., and Stolfi, J. A kinetic framework for computational geometry. Proc. 24th Annual IEEE Symposium on the Foundations of Computer Science. IEEE, 1983, pp. 100–111.
Horn, William P., and Taylor, Dean L. A theorem to determine the spatial containement of a point in a planar polyhedron. Comput. Vision Graphics Image Process. 45 (1989), 106–116.
Kalay, Y. E. Determining the spatial containment of a point in general polyhedra. Comput. Graphics Image Process. 19 (1982), 303–334.
Lane, J., Magedson, B., and Rarick, M. An efficient point in polyhedron algorithm. Comput. Vision Graphics Image Process. 26 (1984), 118–125.
Melkman, A.A. On-line construction of the convex hull of a simple polyline. Information Processing Letters 25 (April 1987), 11–12.
Nef, W. Beiträge zur Theorie der Polyeder, mit Anwendungen in der Computergraphik. Herbert Lang, Berne, Switzerland, 1979.
Nordbeck, S., and Rystedt, B. Computer cartography point-in-polygon programs. BIT 7 (1967), 39–64.
Prenowitz, W., and Jantosciak, J. Join Geometries: A Theory of Convex Sets and Linear Geometry. Springer-Verlag, New York, 1979.
Putnam, L.K., and Subrahmanyam, P.A. Boolean operations on n-dimensional objects. IEEE Comp. Graph. and Appl. 6, 6 (June 1986), 43–51.
Requicha, Aristides A. Representations for rigid solids: theory, methods, and systems. Comp. Surv. 12, 4 (Dec. 1980), 437–464.
Samet, Hanan. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, 1990.
Tamminen, Markku, Karonen, Olli, and Mäntylä, Martti. Ray-casting and block model conversion using a spatial index. Computer-Aided Design 16, 4 (July 1984), 203–208.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dürst, M.J. (1991). Preclassification and delayed classification of boundary entities in arbitrary dimensions. In: Bieri, H., Noltemeier, H. (eds) Computational Geometry-Methods, Algorithms and Applications. CG 1991. Lecture Notes in Computer Science, vol 553. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54891-2_5
Download citation
DOI: https://doi.org/10.1007/3-540-54891-2_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54891-1
Online ISBN: 978-3-540-46459-4
eBook Packages: Springer Book Archive