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.
Ihre gesetzlichen Garantierechte: Alle Verbraucher:innen in der EU profitieren von mindestens 2 Jahren gesetzlichem Garantieschutz für alle in der EU verkauften Konsumgüter. Mehr erfahren
Anbieter: Forgotten Books, London, Vereinigtes Königreich
Paperback. Zustand: New. No Jacket. Print on Demand. Fast, practical tools for detecting red-blue intersections in planar shapes, with clear paths to faster motion planning and collision checks.This book presents efficient algorithms for deciding whether red and blue arcs intersect in the plane, with a focus on cases that arise in motion planning and collision detection. It explains how to handle simple polygons, curved boundaries, and general axis layouts, often improving on traditional sweep-line methods.- Learn how to reduce complex intersection problems to single-face checks and use structural properties to stay near linear time.- Explore how these ideas apply to moving polygons, including translations and rotations, and to collision testing along prescribed paths.- See both deterministic and randomized approaches, with attention to specific arc types that yield faster results.- Understand practical implications for motion planning, robotics, computer graphics, and geometry-based collision detection.Ideal for readers interested in computational geometry, motion planning, and dependable, scalable collision checks for planar objects. 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
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