Excerpt from Red-Blue Intersection Detection Algorithms, With Applications to Motion Planning and Collision Detection
In this section, we give an efficient algorithm for the case when the red arcs in F are non-intersecting line segments which form the boundary of a simple polygon 13 (see figure 1) or, more generally, non~intersecting Jordan arcs whose union is the boundary of a simply-connected region. Let a(i) denote the arrangement of I (i.e. The planar map induced by these arcs; its vertices are the intersection points of the arcs and their endpoints, its edges are maximal connected subsets of the arcs which do not contain any vertex, and its faces are maximal connected subsets of the plane which do not contain any vertex or edge). Let 2 denote any fixed point on 613. The following Lemma is a simple but a key observation which allows us to obtain an efficient algorithm.
Lemma Let f be the face of a(i) containing the point 2. Then 63 and I intersect if and only if and 68 intersect.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Gratis für den Versand von Vereinigtes Königreich nach USA
Versandziele, Kosten & DauerAnbieter: Forgotten Books, London, Vereinigtes Königreich
Paperback. Zustand: New. Print on Demand. This book is a technical report on the detection of intersections between sets of Jordan arcs. It presents several efficient algorithms for determining an intersection between a collection of red arcs and a collection of blue arcs, each set forming the boundary of a simply connected region. The problem of intersection detection is common in fields like motion planning, collision detection, and computer graphics. The book provides valuable insights for researchers in these areas, focusing on the efficiency of the presented algorithms. The algorithms avoid unnecessary computations by restricting the intersection problem to specific faces in the arrangement of the arcs, reducing the time complexity. The book explores the relationship between the number of faces computed and the efficiency of intersection detection, demonstrating that calculating only a small number of faces is sufficient for efficient intersection detection. Additionally, the book discusses applications of these algorithms to motion planning and collision detection, and it explores randomized algorithms for specific types of arcs, such as line segments and circles. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Bestandsnummer des Verkäufers 9781332937455_0
Anzahl: Mehr als 20 verfügbar
Anbieter: PBShop.store US, Wood Dale, IL, USA
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers LW-9781332937455
Anzahl: 15 verfügbar
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers LW-9781332937455
Anzahl: 15 verfügbar