Reporting the crossing-free segments of a complete geometric graph

DOI10.1080/00207169608804534zbMATH Open0865.68124OpenAlexW2041287079MaRDI QIDQ4332449FDOQ4332449

Authors: 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

Recommendations

• Counting and enumerating crossing-free geometric graphs
• Counting and enumerating crossing-free geometric graphs
• On crossing families of complete geometric graphs
• Counting the number of crossings in geometric graphs
• Bounds on the crossing resolution of complete geometric graphs
• Number of crossing-free geometric graphs vs. Triangulations
• On the crossing number of complete graphs
• On the crossing number of complete graphs
• Crossing-free segments and triangles in point configurations
• scientific article; zbMATH DE number 2079388

zbMATH Keywords

complete geometric graphangular sortcrossing-free segments

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Constructing Arrangements of Lines and Hyperplanes with Applications
• The power of geometric duality revisited

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

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