Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q4060664> ?p ?o }
Showing triples 1 to 32 of
32
with 100 triples per page.
- Q4060664 subject Q7214699.
- Q4060664 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.".
- Q4060664 wikiPageExternalLink 31.pdf.
- Q4060664 wikiPageWikiLink Q1064349.
- Q4060664 wikiPageWikiLink Q117879.
- Q4060664 wikiPageWikiLink Q1244890.
- Q4060664 wikiPageWikiLink Q13222616.
- Q4060664 wikiPageWikiLink Q1410737.
- Q4060664 wikiPageWikiLink Q1709878.
- Q4060664 wikiPageWikiLink Q175263.
- Q4060664 wikiPageWikiLink Q2028293.
- Q4060664 wikiPageWikiLink Q230655.
- Q4060664 wikiPageWikiLink Q2372426.
- Q4060664 wikiPageWikiLink Q320357.
- Q4060664 wikiPageWikiLink Q4795848.
- Q4060664 wikiPageWikiLink Q506496.
- Q4060664 wikiPageWikiLink Q5249246.
- Q4060664 wikiPageWikiLink Q527381.
- Q4060664 wikiPageWikiLink Q547823.
- Q4060664 wikiPageWikiLink Q591310.
- Q4060664 wikiPageWikiLink Q6051350.
- Q4060664 wikiPageWikiLink Q623818.
- Q4060664 wikiPageWikiLink Q629283.
- Q4060664 wikiPageWikiLink Q6542691.
- Q4060664 wikiPageWikiLink Q6553330.
- Q4060664 wikiPageWikiLink Q7214699.
- Q4060664 wikiPageWikiLink Q752718.
- Q4060664 wikiPageWikiLink Q7661883.
- Q4060664 wikiPageWikiLink Q803847.
- Q4060664 wikiPageWikiLink Q874709.
- Q4060664 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).".
- Q4060664 label "Bentley–Ottmann algorithm".