The sphere as a rational Be´ier surface
Computer Aided Geometric Design
Curve and surface constructions using rational B-splines
Computer-Aided Design
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Approximation hierarchies and S-bounds
SMA '91 Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications
Implicitization using moving curves and surfaces
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
An O(h2n) Hermite approximation for conic sections
Computer Aided Geometric Design
Fast computation of generalized Voronoi diagrams using graphics hardware
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Fast and simple 2D geometric proximity queries using graphics hardware
I3D '01 Proceedings of the 2001 symposium on Interactive 3D graphics
Efficient collision detection of complex deformable models using AABB trees
Journal of Graphics Tools
Kinetic collision detection between two simple polygons
Computational Geometry: Theory and Applications
Rational B-Splines for Curve and Surface Representation
IEEE Computer Graphics and Applications
Conic Representations for Shape Description
IEEE Computer Graphics and Applications
Continuous Collision Detection for Two Moving Elliptic Disks
IEEE Transactions on Robotics
| Hi-index | 0.00 |
This paper presents a novel approach which continuously detects the first collision between two curved-edge polygons moving under rational motions. Edges of the two polygons in this paper are planar curves, represented as conic splines, i.e. elliptic or parabolic sections. The curved-edge polygons are not confined to be convex and conic sections are only required to be GC0 continuous. Motions of the polygons are modeled by interpolating between control points along motion trajectories. Our algorithm returns the first collision moment and collision position if there is a collision between the two moving polygons and returns no-collision otherwise. Collision condition of the two polygons moving under rational motions is represented as an univariate polynomial of time t. Bernstein form is used to improve the accuracy of solving the high degree polynomial. We also use bounding circles to improve the efficiency of our approach and compare our method with the PIVOT2D method and prove ours to be more accurate and faster.