Applications of a two-dimensional hidden-line algorithm to other geometric problems (Q1838318): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Triangulating a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for determining the convex hull of a finite planar set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some properties of \(L\) sets in the plane / 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: Measuring Concavity on a Rectangular Mosaic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the convex hull of a simple polygon / rank
 
Normal rank

Latest revision as of 18:37, 13 June 2024

scientific article
Language Label Description Also known as
English
Applications of a two-dimensional hidden-line algorithm to other geometric problems
scientific article

    Statements

    Applications of a two-dimensional hidden-line algorithm to other geometric problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    1983
    0 references
    0 references
    0 references
    0 references
    0 references
    visibility
    0 references
    simple polygons
    0 references
    convex hull
    0 references
    triangulation
    0 references
    L-convex polygon
    0 references
    edge visible polygon
    0 references
    algorithms
    0 references
    geometric complexity
    0 references