Reporting the crossing-free segments of a complete geometric graph

DOI10.1080/00207169608804534zbMath0865.68124OpenAlexW2041287079MaRDI QIDQ4332449

Masahiko Furukata, Kouhei Asano

Publication date: 21 April 1997

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169608804534

zbMATH Keywords

complete geometric graphangular sortcrossing-free segments

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• The power of geometric duality revisited
• Constructing Arrangements of Lines and Hyperplanes with Applications

This page was built for publication: Reporting the crossing-free segments of a complete geometric graph