Computing Area-Optimal Simple Polygonizations (Q5102075): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q114071091, #quickstatements; #temporary_batch_1706335038149
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3212800592 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Area-Optimal Simple Polygonalizations: The CG Challenge 2019 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On simple polygonalizations with optimal area / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Flow Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Terminal Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5115812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Empirical Study on Randomized Optimal Area Polygonization of Planar Point Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple min-cut algorithm / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:23, 30 July 2024

scientific article; zbMATH DE number 7581968
Language Label Description Also known as
English
Computing Area-Optimal Simple Polygonizations
scientific article; zbMATH DE number 7581968

    Statements

    Computing Area-Optimal Simple Polygonizations (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    6 September 2022
    0 references
    computational geometry
    0 references
    geometric optimization
    0 references
    algorithm engineering
    0 references
    exact algorithms
    0 references
    polygonization
    0 references
    area optimization
    0 references

    Identifiers