Planar lower envelope of monotone polygonal chains (Q495682): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Visibility queries and maintenance in simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient visibility queries in simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal output-sensitive convex hull algorithms in two and three dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for computing the visibility polygon from a point / rank
 
Normal rank
Property / cites work
 
Property / cites work: Output-sensitive algorithms for optimally constructing the upper envelope of straight line segments in parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for Computing Visibility in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the upper envelope of n line segments in O(n log n) time / 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: An Output-Sensitive Convex Hull Algorithm for Planar Objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query point visibility computation in polygons with holes / rank
 
Normal rank

Revision as of 18:08, 10 July 2024

scientific article
Language Label Description Also known as
English
Planar lower envelope of monotone polygonal chains
scientific article

    Statements

    Identifiers