Minimum vertex hulls for polyhedral domains (Q1199529): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3355260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating Simple Polygons and Equivalent Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for computing a minimum nested nonconvex polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the smallest triangles containing a given convex polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Formulae and Their Uses / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon / rank
 
Normal rank

Latest revision as of 16:18, 16 May 2024

scientific article
Language Label Description Also known as
English
Minimum vertex hulls for polyhedral domains
scientific article

    Statements