Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection
From MaRDI portal
Publication:3474274
Recommendations
- LP-Based Algorithms for Detecting the Collision of Moving Objects
- An elementary algorithm for reporting intersections of red/blue curve segments
- Efficient algorithms for collision avoidance at intersections
- Parallel collision detection between moving robots for practical motion planning
- Publication:3479543
- Collision Detection Using Interpolation Schemes
- Cache-Oblivious Red-Blue Line Segment Intersection
- scientific article; zbMATH DE number 176591
Cited in
(11)- On fat partitioning, fat covering and the union size of polygons
- Preprocessing chains for fast dihedral rotations is hard or even impossible.
- Bottleneck bichromatic full Steiner trees
- Reporting intersecting pairs of convex polytopes in two and three dimensions
- Computing depth orders for fat objects and related problems
- Counting and representing intersections among triangles in three dimensions
- scientific article; zbMATH DE number 176591 (Why is no real title available?)
- Computing depth orders and related problems
- On counting pairs of intersecting segments and off-line triangle range searching
- Partitioning arrangements of lines. I: An efficient deterministic algorithm
- Partitioning arrangements of lines. II: Applications
This page was built for publication: Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3474274)