A simple algorithm for determining the envelope of a set of lines

DOI10.1016/0020-0190(91)90106-RzbMath0735.68085OpenAlexW2080276023MaRDI QIDQ1182080

S. Singh

Publication date: 27 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90106-r

zbMATH Keywords

envelope of a set of n lines

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (7)

Optimally computing a shortest weakly visible line segment inside a simple polygon ⋮ Efficient algorithms for maximum regression depth ⋮ Capturing crossings: convex hulls of segment and plane intersections ⋮ PROPERTIES OF ARRANGEMENT GRAPHS ⋮ DETECTING COMMUTING PATTERNS BY CLUSTERING SUBTRAJECTORIES ⋮ Rotationally monotone polygons ⋮ COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON

Cites Work

• On-line construction of the convex hull of a simple polyline

This page was built for publication: A simple algorithm for determining the envelope of a set of lines