On circumscribing polygons for line segments

DOI10.1016/S0925-7721(97)00023-0zbMath0896.68147OpenAlexW1974432439MaRDI QIDQ1388139

Eduardo Rivera-Campo, János Pach

Publication date: 1 October 1998

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(97)00023-0

zbMATH Keywords

circumscribing polygon

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (5)

Circumscribing polygons and polygonizations for disjoint line segments ⋮ Compatible spanning trees ⋮ Compatible geometric matchings ⋮ Encompassing colored planar straight line graphs ⋮ Unnamed Item

Cites Work

• Hamiltonian triangulations and circumscribing polygons of disjoint line segments
• On a counterexample to a conjecture of Mirzaian
• Two segment classes with Hamiltonian visibility graphs

This page was built for publication: On circumscribing polygons for line segments