A practical algorithm for decomposing polygonal domains into convex polygons by diagonals (Q1001364): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q249512
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Boglárka G.-Tóth / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: FIST / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11750-008-0055-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2114531006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The concept of state in discrete dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: DECOPOL -- Codes for decomposing a polygon into convex subpolygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the decomposition of a polygon into convex polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: FIST: fast industrial-strength triangulation of polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3670558 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing a Polygon into Simpler Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate convex decomposition of polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPUTATIONAL GEOMETRY COLUMN 29 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons / rank
 
Normal rank

Latest revision as of 02:23, 29 June 2024

scientific article
Language Label Description Also known as
English
A practical algorithm for decomposing polygonal domains into convex polygons by diagonals
scientific article

    Statements

    A practical algorithm for decomposing polygonal domains into convex polygons by diagonals (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    17 February 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    convex polygon decomposition
    0 references
    polygonal holes
    0 references
    location
    0 references
    0 references