Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00870570n
Noun Concept
IT
No term available
EN
In computational geometry, the Bentley–Ottmann algorithm is a sweep line algorithm for listing all crossings in a set of line segments, i.e. it finds the intersection points of line segments. Wikipedia
Relations
Sources
IS A
algoritmo

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License