Finding all weakly-visible chords of a polygon in linear time (Q5056171): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: LR-visibility in polygons / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: THE TWO GUARDS PROBLEM / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Optimal Algorithm for Finding the Kernel of a Polygon / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An optimal algorithm for detecting weak visibility of a polygon / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Two-Guard Walkability of Simple Polygons / rank | |||
Normal rank |
Latest revision as of 03:07, 31 July 2024
scientific article; zbMATH DE number 7631691
Language | Label | Description | Also known as |
---|---|---|---|
English | Finding all weakly-visible chords of a polygon in linear time |
scientific article; zbMATH DE number 7631691 |
Statements
Finding all weakly-visible chords of a polygon in linear time (English)
0 references
9 December 2022
0 references
0 references
0 references