Optimizing generalized kernels of polygons (Q2046316): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5452284 / 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: Q4028880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing common tangents without a separating line / 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: A linear algorithm for finding the convex hull of a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line construction of the convex hull of a simple polyline / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2721995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple-guard kernels of simple polygons / rank
 
Normal rank

Revision as of 09:49, 26 July 2024

scientific article
Language Label Description Also known as
English
Optimizing generalized kernels of polygons
scientific article

    Statements

    Identifiers