Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom (Q1194309): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The number of edges of many faces in a line segment arrangement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangles in space or building (and analyzing) castles in the air / rank
 
Normal rank
Property / cites work
 
Property / cites work: Castles in the air revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial complexity bounds for arrangements of curves and spheres / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of random sampling in computational geometry. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795219 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity and construction of many faces in arrangements of lines and of segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extremal problems of graphs and generalized graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the general motion-planning problem with two degrees of freedom / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Motion Planning for an <i>L</i>-Shaped Object / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5812325 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\epsilon\)-nets and simplex range queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient and simple motion planning algorithm for a ladder amidst polygonal barriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space / rank
 
Normal rank

Latest revision as of 13:10, 16 May 2024

scientific article
Language Label Description Also known as
English
Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom
scientific article

    Statements

    Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom (English)
    0 references
    0 references
    0 references
    27 September 1992
    0 references
    0 references
    combinatorial bounds
    0 references
    motion planning problems
    0 references
    degrees of freedom
    0 references
    combinatorial complexity
    0 references
    arrangements
    0 references
    surfaces
    0 references
    3-dimensional space
    0 references
    surface patch
    0 references
    obstacles
    0 references
    cells
    0 references
    time complexity
    0 references
    two-dimensional arrangements
    0 references