On Envelopes of Arrangements of Lines

DOI10.1006/jagm.1996.0040zbMath0857.68114OpenAlexW1969673882MaRDI QIDQ4895801

D. Eu, Eric Guévremont, Godfried T. Toussaint

Publication date: 16 December 1996

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/93420f90ef01ba2ec57da5feb911c9c8fd6b106b

zbMATH Keywords

geometry of envelope polygons

Mathematics Subject Classification ID

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

Related Items (6)

Finding Hamiltonian circuits in arrangements of Jordan curves is NP- complete ⋮ 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 ⋮ INDUCING POLYGONS OF LINE ARRANGEMENTS

This page was built for publication: On Envelopes of Arrangements of Lines