On Envelopes of Arrangements of Lines

DOI10.1006/JAGM.1996.0040MaRDI QIDQ4895801zbMATH OpenOpenAlexFDO

Authors D. Eu, Eric Guévremont, Godfried 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)

Recommendations

• Topologically sweeping an arrangement
• A simple algorithm for determining the envelope of a set of lines
• Finding the upper envelope of n line segments in O(n log n) time
• PROPERTIES OF ARRANGEMENT GRAPHS
• Constructing Arrangements of Lines and Hyperplanes with Applications

Cited in

(7)

• Capturing crossings: convex hulls of segment and plane intersections
• scientific article; zbMATH DE number 4017770 (Why is no real title available?)
• INDUCING POLYGONS OF LINE ARRANGEMENTS
• Finding Hamiltonian circuits in arrangements of Jordan curves is NP- complete
• Efficient algorithms for maximum regression depth
• PROPERTIES OF ARRANGEMENT GRAPHS
• Detecting commuting patterns by clustering subtrajectories

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4895801)