Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Line_segment_intersection> ?p ?o }
Showing triples 1 to 47 of
47
with 100 triples per page.
- Line_segment_intersection abstract "In computational geometry, the line segment intersection problem supplies a list of line segments in the Euclidean plane and asks whether any two of them intersect, or cross.Simple algorithms examine each pair of segments. However, if a large number of possibly intersecting segments are to be checked, this becomes increasingly inefficient since most pairs of segments are not close to one another in a typical input sequence. The most common, more efficient way to solve this problem for a high number of segments is to use a sweep line algorithm, where we imagine a line sliding across the line segments and we track which line segments it intersects at each point in time using a dynamic data structure based on binary search trees. The Shamos–Hoey algorithm applies this principle to solve the line segment intersection detection problem, as stated above, of determining whether or not a set of line segments has an intersection; the Bentley–Ottmann algorithm works by the same principle to list all intersections in logarithmic time per intersection.".
- Line_segment_intersection wikiPageExternalLink intersect.
- Line_segment_intersection wikiPageExternalLink x06-sweepline.pdf.
- Line_segment_intersection wikiPageExternalLink a05-_intersect-1.html.
- Line_segment_intersection wikiPageExternalLink Chapter_main.html.
- Line_segment_intersection wikiPageExternalLink l4.html.
- Line_segment_intersection wikiPageID "3194098".
- Line_segment_intersection wikiPageLength "3003".
- Line_segment_intersection wikiPageOutDegree "16".
- Line_segment_intersection wikiPageRevisionID "635200999".
- Line_segment_intersection wikiPageWikiLink Bentley–Ottmann_algorithm.
- Line_segment_intersection wikiPageWikiLink Binary_search_tree.
- Line_segment_intersection wikiPageWikiLink CGAL.
- Line_segment_intersection wikiPageWikiLink Category:Geometric_algorithms.
- Line_segment_intersection wikiPageWikiLink Charles_E._Leiserson.
- Line_segment_intersection wikiPageWikiLink Clifford_Stein.
- Line_segment_intersection wikiPageWikiLink Computational_geometry.
- Line_segment_intersection wikiPageWikiLink Euclidean_plane.
- Line_segment_intersection wikiPageWikiLink Introduction_to_Algorithms.
- Line_segment_intersection wikiPageWikiLink Line-line_intersection.
- Line_segment_intersection wikiPageWikiLink Line_segment.
- Line_segment_intersection wikiPageWikiLink Line–line_intersection.
- Line_segment_intersection wikiPageWikiLink Ron_Rivest.
- Line_segment_intersection wikiPageWikiLink Ronald_L._Rivest.
- Line_segment_intersection wikiPageWikiLink Shamos–Hoey_algorithm.
- Line_segment_intersection wikiPageWikiLink Sweep_line_algorithm.
- Line_segment_intersection wikiPageWikiLink Thomas_H._Cormen.
- Line_segment_intersection wikiPageWikiLink Two-dimensional_space.
- Line_segment_intersection wikiPageWikiLink Washington_University_in_St._Louis.
- Line_segment_intersection wikiPageWikiLinkText "Line segment intersection".
- Line_segment_intersection wikiPageWikiLinkText "crossings in a set of line segments".
- Line_segment_intersection wikiPageWikiLinkText "line arrangement intersection".
- Line_segment_intersection wikiPageWikiLinkText "line segment intersection".
- Line_segment_intersection hasPhotoCollection Line_segment_intersection.
- Line_segment_intersection wikiPageUsesTemplate Template:Algorithm-stub.
- Line_segment_intersection wikiPageUsesTemplate Template:Cite_book.
- Line_segment_intersection wikiPageUsesTemplate Template:Reflist.
- Line_segment_intersection subject Category:Geometric_algorithms.
- Line_segment_intersection type Algorithm.
- Line_segment_intersection comment "In computational geometry, the line segment intersection problem supplies a list of line segments in the Euclidean plane and asks whether any two of them intersect, or cross.Simple algorithms examine each pair of segments. However, if a large number of possibly intersecting segments are to be checked, this becomes increasingly inefficient since most pairs of segments are not close to one another in a typical input sequence.".
- Line_segment_intersection label "Line segment intersection".
- Line_segment_intersection sameAs Intersección_de_segmentos_de_recta.
- Line_segment_intersection sameAs m.08ydlb.
- Line_segment_intersection sameAs Q6553330.
- Line_segment_intersection sameAs Q6553330.
- Line_segment_intersection wasDerivedFrom Line_segment_intersection?oldid=635200999.
- Line_segment_intersection isPrimaryTopicOf Line_segment_intersection.