Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Bentley–Ottmann_algorithm> ?p ?o }
Showing triples 1 to 60 of
60
with 100 triples per page.
- Bentley–Ottmann_algorithm abstract "In computational geometry, the Bentley–Ottmann algorithm is a sweep line algorithm for listing all crossings in a set of line segments. It extends the Shamos–Hoey algorithm, a similar previous algorithm for testing whether or not a set of line segments has any crossings. For an input consisting of n line segments with k crossings, the Bentley–Ottmann algorithm takes time O((n + k) log n). In cases where k = o(n2 / log n), this is an improvement on a naïve algorithm that tests every pair of segments, which takes O(n2).The algorithm was initially developed by Jon Bentley and Thomas Ottmann (1979); it is described in more detail in the textbooks Preparata & Shamos (1985), O'Rourke (1998), and de Berg et al. (2000). Although asymptotically faster algorithms are now known, the Bentley–Ottman algorithm remains a practical choice due to its simplicity and low memory requirements.".
- Bentley–Ottmann_algorithm wikiPageExternalLink 31.pdf.
- Bentley–Ottmann_algorithm wikiPageID "16329810".
- Bentley–Ottmann_algorithm wikiPageLength "21453".
- Bentley–Ottmann_algorithm wikiPageOutDegree "30".
- Bentley–Ottmann_algorithm wikiPageRevisionID "706419636".
- Bentley–Ottmann_algorithm wikiPageWikiLink Arbitrary-precision_arithmetic.
- Bentley–Ottmann_algorithm wikiPageWikiLink Arrangement_of_lines.
- Bentley–Ottmann_algorithm wikiPageWikiLink Asymptotic_analysis.
- Bentley–Ottmann_algorithm wikiPageWikiLink Binary_heap.
- Bentley–Ottmann_algorithm wikiPageWikiLink Binary_search_tree.
- Bentley–Ottmann_algorithm wikiPageWikiLink Category:Computational_geometry.
- Bentley–Ottmann_algorithm wikiPageWikiLink Closed_set.
- Bentley–Ottmann_algorithm wikiPageWikiLink Computational_geometry.
- Bentley–Ottmann_algorithm wikiPageWikiLink Connectivity_(graph_theory).
- Bentley–Ottmann_algorithm wikiPageWikiLink Data_structure.
- Bentley–Ottmann_algorithm wikiPageWikiLink Decision_tree_model.
- Bentley–Ottmann_algorithm wikiPageWikiLink Deterministic_algorithm.
- Bentley–Ottmann_algorithm wikiPageWikiLink Fibonacci_heap.
- Bentley–Ottmann_algorithm wikiPageWikiLink Floating_point.
- Bentley–Ottmann_algorithm wikiPageWikiLink General_position.
- Bentley–Ottmann_algorithm wikiPageWikiLink International_Journal_of_Computational_Geometry_and_Applications.
- Bentley–Ottmann_algorithm wikiPageWikiLink Iterated_logarithm.
- Bentley–Ottmann_algorithm wikiPageWikiLink Journal_of_the_ACM.
- Bentley–Ottmann_algorithm wikiPageWikiLink Library_of_Efficient_Data_types_and_Algorithms.
- Bentley–Ottmann_algorithm wikiPageWikiLink Line_segment_intersection.
- Bentley–Ottmann_algorithm wikiPageWikiLink Planar_graph.
- Bentley–Ottmann_algorithm wikiPageWikiLink Priority_queue.
- Bentley–Ottmann_algorithm wikiPageWikiLink Rational_number.
- Bentley–Ottmann_algorithm wikiPageWikiLink Red–black_tree.
- Bentley–Ottmann_algorithm wikiPageWikiLink Shamos–Hoey_algorithm.
- Bentley–Ottmann_algorithm wikiPageWikiLink Sweep_line_algorithm.
- Bentley–Ottmann_algorithm wikiPageWikiLink Symposium_on_Foundations_of_Computer_Science.
- Bentley–Ottmann_algorithm wikiPageWikiLink Upper_and_lower_bounds.
- Bentley–Ottmann_algorithm wikiPageWikiLinkText "Bentley–Ottmann algorithm".
- Bentley–Ottmann_algorithm author1Link "Jon Bentley".
- Bentley–Ottmann_algorithm first "Jon".
- Bentley–Ottmann_algorithm first "Thomas".
- Bentley–Ottmann_algorithm last "Bentley".
- Bentley–Ottmann_algorithm last "Ottmann".
- Bentley–Ottmann_algorithm wikiPageUsesTemplate Template:Citation.
- Bentley–Ottmann_algorithm wikiPageUsesTemplate Template:Harvs.
- Bentley–Ottmann_algorithm wikiPageUsesTemplate Template:Harvtxt.
- Bentley–Ottmann_algorithm wikiPageUsesTemplate Template:Log-star.
- Bentley–Ottmann_algorithm wikiPageUsesTemplate Template:Reflist.
- Bentley–Ottmann_algorithm wikiPageUsesTemplate Template:Sfnp.
- Bentley–Ottmann_algorithm year "1979".
- Bentley–Ottmann_algorithm subject Category:Computational_geometry.
- Bentley–Ottmann_algorithm hypernym Algorithm.
- Bentley–Ottmann_algorithm type Software.
- Bentley–Ottmann_algorithm type Algorithm.
- Bentley–Ottmann_algorithm type Redirect.
- Bentley–Ottmann_algorithm comment "In computational geometry, the Bentley–Ottmann algorithm is a sweep line algorithm for listing all crossings in a set of line segments. It extends the Shamos–Hoey algorithm, a similar previous algorithm for testing whether or not a set of line segments has any crossings. For an input consisting of n line segments with k crossings, the Bentley–Ottmann algorithm takes time O((n + k) log n).".
- Bentley–Ottmann_algorithm label "Bentley–Ottmann algorithm".
- Bentley–Ottmann_algorithm sameAs Q4060664.
- Bentley–Ottmann_algorithm sameAs m.03wg_g7.
- Bentley–Ottmann_algorithm sameAs Алгоритм_Бентли_—_Оттмана.
- Bentley–Ottmann_algorithm sameAs Q4060664.
- Bentley–Ottmann_algorithm wasDerivedFrom Bentley–Ottmann_algorithm?oldid=706419636.
- Bentley–Ottmann_algorithm isPrimaryTopicOf Bentley–Ottmann_algorithm.