Approximate convex decomposition of polygons (Q2507162): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1016/j.comgeo.2005.10.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2202245204 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time triangulation of a simple polygon made easier via randomization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating a simple polygon in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3750120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the medial axis of a simple polygon in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Polygons into Simpler Components: Feature Generation for Syntactic Pattern Recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for visibility and shortest path problems inside triangulated simple 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: Polygon Area Decomposition for Multiple-Robot Workspace Division / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing a Polygon into Simpler Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945512 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean shortest paths in the presence of rectilinear barriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3217601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3948588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for finding the convex hull of a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2D SHAPE DECOMPOSITION AND THE AUTOMATIC GENERATION OF HIERARCHICAL REPRESENTATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measuring Concavity on a Rectangular Mosaic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polygonal entropy: A convexity measure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polygon decomposition based on the straight line skeleton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4459480 / rank
 
Normal rank

Latest revision as of 21:35, 24 June 2024

scientific article
Language Label Description Also known as
English
Approximate convex decomposition of polygons
scientific article

    Statements

    Approximate convex decomposition of polygons (English)
    0 references
    0 references
    0 references
    10 October 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    convex decomposition
    0 references
    hierarchical
    0 references
    polygon
    0 references
    0 references
    0 references
    0 references
    0 references