Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons (Q5056907): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Minimal link visibility paths inside a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding an approximate minimum-link visibility path inside a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: LOGARITHMIC-TIME LINK PATH QUERIES IN A SIMPLE POLYGON / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Shortest Path and Minimum-Link Path Queries between Two Convex Polygons inside a Simple Polygonal Obstacle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Point Location in a Monotone Subdivision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the visibility polygon from a convex set and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrections to Lee's visibility polygon algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-link paths among obstacles in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for minimum link paths inside a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons / rank
 
Normal rank

Latest revision as of 01:32, 31 July 2024

scientific article; zbMATH DE number 7630063
Language Label Description Also known as
English
Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons
scientific article; zbMATH DE number 7630063

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references