KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS (Q4818544): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Ray shooting in polygons using geodesic triangulations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficiently Planning Compliant Motion in the Plane / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A compact piecewise-linear Voronoi diagram for convex sites in the plane / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A “retraction” method for planning the motion of a disc / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Coordinated motion planning for two independent robots / rank | |||
Normal rank |
Latest revision as of 10:56, 7 June 2024
scientific article; zbMATH DE number 2104247
Language | Label | Description | Also known as |
---|---|---|---|
English | KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS |
scientific article; zbMATH DE number 2104247 |
Statements
KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS (English)
0 references
29 September 2004
0 references
collision detection
0 references
kinetic data structures
0 references
minimum link separation
0 references
0 references