Triangulation and shape-complexity
From MaRDI portal
Recommendations
- Triangulating a simple polygon in linear time
- Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures
- A randomized algorithm for triangulating a simple polygon in linear time
- An O(n\log \log n)-Time Algorithm for Triangulating a Simple Polygon
- Triangulating Simple Polygons and Equivalent Problems
Cited in
(36)- Local culprits of shape complexity
- Linear-time algorithms for weakly-monotone polygons
- Parallel computational geometry
- Orbiting triangle method for convex polygon triangulation
- A fast Las Vegas algorithm for triangulating a simple polygon
- Spiral serpentine polygonization of a planar point set
- Parallel triangulation of a polygon in two calls to the trapezoidal map
- Memory-constrained algorithms for simple polygons
- Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
- Guarding curvilinear art galleries with vertex or point guards
- Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures
- Implementation of the convex polygon triangulation algorithm
- FIST: fast industrial-strength triangulation of polygons
- Efficient generation of simple polygons for characterizing the shape of a set of points in the plane
- Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs
- A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
- On geodesic properties of polygons relevant to linear time triangulation
- Triangulating a simple polygon in linear time
- Cartographic line simplication and polygon CSG formulae in \(O(n \log^* n)\) time
- Nonobtuse triangulation of polygons
- Tiling polygons with parallelograms
- Monotone path systems in simple regions
- On k-convex polygons
- From Shapes to Amortized Complexity
- A tight bound for point guards in piecewise convex art galleries
- Minimum k-partitioning of rectilinear polygons
- Decomposition and intersection of simple splinegons
- Computing bushy and thin triangulations
- A new triangulation-linear class of simple polygons
- Triangulating Simple Polygons and Equivalent Problems
- A local triangulation algorithm to determine the relation between monotone chains
- An optimal visibility graph algorithm for triangulated simple polygons
- scientific article; zbMATH DE number 1428343 (Why is no real title available?)
- Exploring 2D Shape Complexity
- Characterizing and recognizing weak visibility polygons
- Reprint of: Memory-constrained algorithms for simple polygons
This page was built for publication: Triangulation and shape-complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3721846)
