On Envelopes of Arrangements of Lines

DOI10.1006/JAGM.1996.0040zbMATH Open0857.68114OpenAlexW1969673882MaRDI QIDQ4895801FDOQ4895801

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

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

zbMATH Keywords

geometry of envelope polygons

Mathematics Subject Classification ID

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

Cited In (7)

• Capturing crossings: convex hulls of segment and plane intersections
• Title not available (Why is that?)
• 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)