Predictions about collision free paths from intersection tests

DOI10.1007/3-540-54891-2_23MaRDI QIDQ4035767zbMATH OpenFDO

Authors Sabine Stifter

Publication date 18 May 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-54891-2_23

zbMATH Keywords

collision free pathsintersection testsRoider methodseparating hyperplane

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection
• A vertex algorithm for collision detection
• LP-Based Algorithms for Detecting the Collision of Moving Objects
• Kinetic collision detection between two simple polygons.
• Guaranteed collision detection with toleranced motions

Cited in

(3)

• An equivalence relation for local path sets
• Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection
• A novel prediction‐based collision resolution algorithm

This page was built for publication: Predictions about collision free paths from intersection tests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035767)