Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware 80 pp. Englisch. Bestandsnummer des Verkäufers 9786133246430
Anzahl: 2 verfügbar
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. In computationalgeometry, the line segment intersection problem supplies a list of linesegments in the plane and asks us to determine whether any two of themintersect, or cross. Naive algorithms examine each pair of segments, butthis is highly inefficient, since most pairs of segments aren't anywhereclose to one another in a typical input sequence. The most common, moreefficient way to solve this problem is to use a sweep line algorithmwhere we imagine a line sliding across the line segments and we trackwhich line segments it intersects at each point in time using a dynamicdata structure based on binary search trees. The Shamos-Hoey algorithmapplies this principle to solve the line segment intersection detectionproblem, as stated above, of determining whether or not a set of linesegments has an intersection; the Bentley-Ottmann algorithm works by thesame principle to list all intersections in logarithmic time perintersection.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 80 pp. Englisch. Bestandsnummer des Verkäufers 9786133246430
Anzahl: 1 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering. Bestandsnummer des Verkäufers 9786133246430
Anzahl: 1 verfügbar