{"title":"Edge-unfolding nested prismatoids","authors":"Manuel Radons","doi":"10.1016/j.comgeo.2023.102033","DOIUrl":null,"url":null,"abstract":"<div><p>A 3-prismatoid is the convex hull of two convex polygons <em>A</em> and <em>B</em> which lie in parallel planes <span><math><msub><mrow><mi>H</mi></mrow><mrow><mi>A</mi></mrow></msub><mo>,</mo><msub><mrow><mi>H</mi></mrow><mrow><mi>B</mi></mrow></msub><mo>⊂</mo><msup><mrow><mi>R</mi></mrow><mrow><mn>3</mn></mrow></msup></math></span>. Let <span><math><mover><mrow><mi>A</mi></mrow><mrow><mo>˜</mo></mrow></mover></math></span> be the orthogonal projection of <em>A</em> onto <span><math><msub><mrow><mi>H</mi></mrow><mrow><mi>B</mi></mrow></msub></math></span>. A 3-prismatoid is called nested if <span><math><mover><mrow><mi>A</mi></mrow><mrow><mo>˜</mo></mrow></mover></math></span> is properly contained in <em>B</em>, or vice versa. We show that every nested 3-prismatoid has an edge-unfolding to a non-overlapping polygon in the plane.</p></div>","PeriodicalId":51001,"journal":{"name":"Computational Geometry-Theory and Applications","volume":null,"pages":null},"PeriodicalIF":0.4000,"publicationDate":"2023-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computational Geometry-Theory and Applications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0925772123000536","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 2
Abstract
A 3-prismatoid is the convex hull of two convex polygons A and B which lie in parallel planes . Let be the orthogonal projection of A onto . A 3-prismatoid is called nested if is properly contained in B, or vice versa. We show that every nested 3-prismatoid has an edge-unfolding to a non-overlapping polygon in the plane.
期刊介绍:
Computational Geometry is a forum for research in theoretical and applied aspects of computational geometry. The journal publishes fundamental research in all areas of the subject, as well as disseminating information on the applications, techniques, and use of computational geometry. Computational Geometry publishes articles on the design and analysis of geometric algorithms. All aspects of computational geometry are covered, including the numerical, graph theoretical and combinatorial aspects. Also welcomed are computational geometry solutions to fundamental problems arising in computer graphics, pattern recognition, robotics, image processing, CAD-CAM, VLSI design and geographical information systems.
Computational Geometry features a special section containing open problems and concise reports on implementations of computational geometry tools.