Topics on line segments and polygons
type: Item
instance of: scholarly article
title: Topics on line segments and polygons
zbMATH Open document ID: 0866.51009
DOI: 10.1016/0012-365X(94)00087-Y
author: Kiyoshi Hosono
author: Mamoru Watanabe
author: Masatsugu Urabe
published in: Discrete Mathematics
publication date: 1997-07-27T00:00:00Z
review text: For finite sets of pairwise disjoint line segments in the plane, figures such as simple polygons, simple paths, or trees are considered, where the condition is that the figure may only use the endpoints of the line segments and may not intersect any line segment properly. An example is given that shows that a simple polygonal chain that uses all line segments as edges, but has no additional vertices than the endpoints, doesn't always exist. Other versions of this type of problem allow the line segments to be diagonals of a polygon, or require that the figure use exactly one endpoint of each line segment.
Mathematics Subject Classification ID: 51M20
Mathematics Subject Classification ID: 51A20
Mathematics Subject Classification ID: 52A10
zbMATH DE Number: 896532
zbMATH Keywords: simple polygons
zbMATH Keywords: finite sets of line segment
MaRDI profile type: Publication
cites work: Computing simple circuits from a set of line segments
cites work: On a counterexample to a conjecture of Mirzaian
full work available at URL: 0012-365x(94)00087-y
OpenAlex ID: W1997916781
Recommended article: Q4278195
Recommended article: Q3527316
Recommended article: Q4827579
Recommended article: Circles and polygons
Recommended article: Sections of triangles and circles
Recommended article: Q3121026
Recommended article: On circumscribing polygons for line segments
Recommended article: On subdivisions of polygons
description: scientific article; zbMATH DE number 896532