Triangulating Simple Polygons and Equivalent Problems
From MaRDI portal
Recommendations
- An O(n\log \log n)-Time Algorithm for Triangulating a Simple Polygon
- Triangulating a simple polygon in linear time
- Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures
- Triangulation and shape-complexity
- A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
Cited in
(46)- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Parallel triangulation of a polygon in two calls to the trapezoidal map
- Decomposition and intersection of simple splinegons
- Optimum watchman routes
- On geodesic properties of polygons relevant to linear time triangulation
- Triangulations, visibility graph and reflex vertices of a simple polygon
- Triangulating a simple polygon in linear time
- Tiling polygons with parallelograms
- Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures
- Computing the shortest diagonal of a monotone polygon in linear time
- Minimum vertex hulls for polyhedral domains
- A workbench for computational geometry
- Monotone path systems in simple regions
- Computing minimum length paths of a given homotopy class
- Simplest polymetric geometries
- Characterizing and efficiently computing quadrangulations of planar point sets
- Time-space trade-offs for triangulations and Voronoi diagrams
- A fast Las Vegas algorithm for triangulating a simple polygon
- Simplex and polygon equations.
- Memory-constrained algorithms for simple polygons
- A contribution to triangulation algorithms for simple polygons
- scientific article; zbMATH DE number 4174383 (Why is no real title available?)
- A new linear algorithm for triangulating monotone polygons
- Time-space trade-offs for triangulations and Voronoi diagrams
- Triangulation and shape-complexity
- Polygon triangulation: Efficiency and minimality
- A new triangulation-linear class of simple polygons
- Reprint of: Memory-constrained algorithms for simple polygons
- On k-convex polygons
- TRIANGULATING DISJOINT JORDAN CHAINS
- scientific article; zbMATH DE number 2058624 (Why is no real title available?)
- Triangulating a polygon in parallel
- A Linear Time Heuristics for Trapezoidation of GIS Polygons
- ON HAMILTONIAN TRIANGULATIONS IN SIMPLE POLYGONS
- Quadrangulations of planar sets
- A linear-time construction of the relative neighborhood graph within a histogram
- A randomized algorithm for triangulating a simple polygon in linear time
- External-memory algorithms for processing line segments in geographic information systems
- Linear-time algorithms for weakly-monotone polygons
- Constrained two-line center problems
- On the minimality of polygon triangulation
- A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
- Computational geometry in a curved world
- Some chain visibility problems in a simple polygon
- Triangulating input-constrained planar point sets
- Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
This page was built for publication: Triangulating Simple Polygons and Equivalent Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3721847)
