Skip to main content
6 events
when toggle format what by license comment
Nov 15, 2020 at 12:11 comment added Emil Jeřábek No, it would require that the hull includes all of the original graph rather than just the boundary.
Nov 15, 2020 at 10:56 comment added Manfred Weis @EmilJeřábek so the term "hull" would require biconnectivity of the graph? Then addig the shortest edge(s) that restore biconnectivity would yield something that can serve as (shape) hull?
Nov 15, 2020 at 10:43 comment added Emil Jeřábek While there is no universal definition, in accordance with common terminology I’d expect the “hull of the planar points that ...” to include all those points, and then some. (Whatever the “hull” is, it should behave as a closure operator.) Thus, I don’t think this is a good choice of a term. If I understand correctly your definition, I’d use a word like “boundary”, “border”, or “front”.
Nov 15, 2020 at 10:22 comment added David Loeffler The pictures and allusions to your algorithm don't seem to be terribly relevant to your actual question. In general "X hull of Y" seems to be used to mean "simplest/best thing with property X that contains Y" (see en.wikipedia.org/wiki/Hull). However, I don't think it's reasonable to expect that there's a single, rigorous, universal definition of "hull" from which all others can be derived (and attempting to formulate one would probably lead to something so clumsy as to be virtually useless).
Nov 15, 2020 at 10:21 history edited Daniele Tampieri CC BY-SA 4.0
Typo and question mark in the title
Nov 15, 2020 at 9:38 history asked Manfred Weis CC BY-SA 4.0