COMPUTING CONSTRAINED SHORTEST SEGMENTS: BUTTERFLY WINGSPANS IN LOGARITHMIC TIME (Q4513231)

From MaRDI portal
Revision as of 20:36, 30 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1526825
Language Label Description Also known as
English
COMPUTING CONSTRAINED SHORTEST SEGMENTS: BUTTERFLY WINGSPANS IN LOGARITHMIC TIME
scientific article; zbMATH DE number 1526825

    Statements

    COMPUTING CONSTRAINED SHORTEST SEGMENTS: BUTTERFLY WINGSPANS IN LOGARITHMIC TIME (English)
    0 references
    0 references
    0 references
    7 November 2000
    0 references
    binary search on convex polygons
    0 references
    shortest transversal
    0 references

    Identifiers