Minimal-Length Enclosing Polygon

Joseph O’Rourke () and Costin Vîlcu ()
Additional contact information
Joseph O’Rourke: Smith College
Costin Vîlcu: Romanian Academy

Chapter Chapter 14 in Reshaping Convex Polyhedra, 2024, pp 167-184 from Springer

Abstract: Abstract Recall that we aim to extend to convex polyhedra the planar model of a spiraling slitslittree tree developed in Chap. 12 and based on convex hulls. In the plane, the convex hullconvex hull of a finite set S is equivalently defined as (i) the smallest convex setconvex set containing S or (ii) the minimal-length enclosing polygonpolygonminimal length enclosing of S.

Date: 2024
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-031-47511-5_14

Ordering information: This item can be ordered from
http://www.springer.com/9783031475115

DOI: 10.1007/978-3-031-47511-5_14

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().