Triangulation and shape-complexity
From MaRDI portal
Publication:3721846
DOI10.1145/357337.357340zbMath0592.68083OpenAlexW2088864905MaRDI QIDQ3721846
Janet Incerpi, Bernard Chazelle
Publication date: 1984
Published in: ACM Transactions on Graphics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/357337.357340
Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99)
Related Items (24)
Nonobtuse triangulation of polygons ⋮ Parallel triangulation of a polygon in two calls to the trapezoidal map ⋮ Decomposition and intersection of simple splinegons ⋮ A tight bound for point guards in piecewise convex art galleries ⋮ Memory-constrained algorithms for simple polygons ⋮ An optimal visibility graph algorithm for triangulated simple polygons ⋮ Parallel computational geometry ⋮ On geodesic properties of polygons relevant to linear time triangulation ⋮ Reprint of: Memory-constrained algorithms for simple polygons ⋮ On \(k\)-convex polygons ⋮ Minimum k-partitioning of rectilinear polygons ⋮ Guarding curvilinear art galleries with vertex or point guards ⋮ A new triangulation-linear class of simple polygons ⋮ Triangulating a simple polygon in linear time ⋮ Tiling polygons with parallelograms ⋮ Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures ⋮ Linear-time algorithms for weakly-monotone polygons ⋮ Characterizing and recognizing weak visibility polygons ⋮ An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains ⋮ Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs ⋮ Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons ⋮ A fast Las Vegas algorithm for triangulating a simple polygon ⋮ A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons ⋮ Monotone path systems in simple regions
This page was built for publication: Triangulation and shape-complexity
