PROPERTIES OF ARRANGEMENT GRAPHS

DOI10.1142/S0218195903001281zbMath1062.68084MaRDI QIDQ4661879

Hazel Everett, Prosenjit Bose, Stephen K. Wismath

Publication date: 30 March 2005

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian pathinducing pathinducing polygon

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Structural characterization of families of graphs (05C75)

Related Items

On degree sequences and eccentricities in pseudoline arrangement graphs ⋮ Hamiltonicity and colorings of arrangement graphs ⋮ On inducing polygons and related problems ⋮ The Complexity of Drawing Graphs on Few Lines and Few Planes ⋮ Variants of the segment number of a graph ⋮ INDUCING POLYGONS OF LINE ARRANGEMENTS

Cites Work

• A simple algorithm for determining the envelope of a set of lines
• Finding Hamiltonian circuits in arrangements of Jordan curves is NP- complete
• Multidimensional Sorting
• Constructing Arrangements of Lines and Hyperplanes with Applications
• On Envelopes of Arrangements of Lines