Planning a purely translational motion of a convex object in two- dimensional space using generalized Voronoi diagrams (Q1084674): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3687711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spherical complexes and radial projections of polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3479543 / 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: Intersection and Closest-Pair Problems for a Set of Planar Discs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers / rank
 
Normal rank

Revision as of 16:41, 17 June 2024

scientific article
Language Label Description Also known as
English
Planning a purely translational motion of a convex object in two- dimensional space using generalized Voronoi diagrams
scientific article

    Statements

    Planning a purely translational motion of a convex object in two- dimensional space using generalized Voronoi diagrams (English)
    0 references
    0 references
    0 references
    1987
    0 references
    The authors consider Voronoi diagrams \(Vor_ B(S)\) constructed for a convex set B and a set S of convex bodies, playing roles of obstacles for motions of B. They also give an efficient algorithm for computing \(Vor_ B(S)\) for relatively simple objects B and S and discuss related applications to motion planning for B.
    0 references
    generalized Voronoi diagrams
    0 references
    efficient algorithm
    0 references
    motion planning
    0 references

    Identifiers