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

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q742416
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: David G. Kirkpatrick / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing shortest transversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast detection of polyhedral intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the extreme distances between two convex polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPACT INTERVAL TREES: A DATA STRUCTURE FOR CONVEX HULLS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintenance of configurations in the plane / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0218195999000054 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2110595174 / rank
 
Normal rank

Latest revision as of 12:02, 30 July 2024

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