On Computing a Largest Empty Arbitrarily Oriented Rectangle (Q4818583): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Computing the Largest Empty Rectangle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the largest area axis-parallel rectangle in a polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining the minimum-area encasing rectangle for an arbitrary closed curve / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programming in Linear Time When the Dimension Is Fixed / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum empty rectangle problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for the largest empty rectangle problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding minimal enclosing boxes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing largest empty circles with location constraints / rank
 
Normal rank

Latest revision as of 11:56, 7 June 2024

scientific article; zbMATH DE number 2104284
Language Label Description Also known as
English
On Computing a Largest Empty Arbitrarily Oriented Rectangle
scientific article; zbMATH DE number 2104284

    Statements