An algorithm for enumerating all vertices of a convex polyhedron (Q1219775): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Finding all vertices of a convex polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4085499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5599564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5547252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: �ber die konvexe H�lle von n zuf�llig gew�hlten Punkten / rank
 
Normal rank
Property / cites work
 
Property / cites work: ZufÄllige konvexe Polygone in einem Ringgebiet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Die konvexe H�lle von n rotationssymmetrisch verteilten Punkten / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results in probabilistic geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: On The Number of Faces of a Convex Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Vertices of a Convex Polytope / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02242366 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W233935999 / rank
 
Normal rank

Latest revision as of 09:56, 30 July 2024

scientific article
Language Label Description Also known as
English
An algorithm for enumerating all vertices of a convex polyhedron
scientific article

    Statements

    Identifiers

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