caa a22 4500 46907504X CHVBK 20180323132933.0 cr unu---uuuuu 170328e19921201xx s 000 0 eng 10.1007/BF02293056 doi (NATIONALLICENCE)springer-10.1007/BF02293056 Subdivision algorithms and the kernel of a polyhedron [Elektronische Daten] [R. Gardner, M. Kallay] The kernelK of a convex polyhedronP 0, as defined by L. Fejes Tóth, is the limit of the sequence (P n), whereP n is the convex hull of the midpoints of the edges ofP n−1. The boundary ∂K of the convex bodyK is investigated. It is shown that ∂K contains no two-dimensional faces and that ∂K need not belong toC 2. The connection with similar algorithms from CAD (computer aided design) is explained and utilized. Springer-Verlag New York Inc., 1992 Gardner R. Department of Mathematics, Western Washington University, 98225-9063, Bellingham, WA, USA aut Kallay M. Electronic Data Systems Corporation, C4 Technology West, Suite 300, 13555 SE 36th Street, 98006, Bellevue, WA, USA aut Discrete & Computational Geometry Springer New York 8/4(1992-12-01), 417-427 0179-5376 8:4<417 1992 8 454 https://doi.org/10.1007/BF02293056 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/BF02293056 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Gardner R. Department of Mathematics, Western Washington University, 98225-9063, Bellingham, WA, USA aut NATIONALLICENCE 700 1- Kallay M. Electronic Data Systems Corporation, C4 Technology West, Suite 300, 13555 SE 36th Street, 98006, Bellevue, WA, USA aut NATIONALLICENCE 773 0- Discrete & Computational Geometry Springer New York 8/4(1992-12-01), 417-427 0179-5376 8:4<417 1992 8 454 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer