A linear time algorithm for obtaining the convex hull of a simple polygon (Q1053995)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3820582
Language Label Description Also known as
default for all languages
No label defined
    English
    A linear time algorithm for obtaining the convex hull of a simple polygon
    scientific article; zbMATH DE number 3820582

      Statements

      A linear time algorithm for obtaining the convex hull of a simple polygon (English)
      0 references
      1983
      0 references
      convex hull algorithm
      0 references
      computational complexity
      0 references
      simple polygon
      0 references
      convex polygon
      0 references
      ordered crossing polygon
      0 references
      0 references
      0 references

      Identifiers

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