Pages that link to "Item:Q3721847"
From MaRDI portal
The following pages link to Triangulating Simple Polygons and Equivalent Problems (Q3721847):
Displaying 39 items.
- Reprint of: Memory-constrained algorithms for simple polygons (Q390167) (← links)
- On \(k\)-convex polygons (Q427049) (← links)
- Linear-time algorithms for weakly-monotone polygons (Q685601) (← links)
- On the minimality of polygon triangulation (Q751276) (← links)
- A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons (Q809630) (← links)
- Computational geometry in a curved world (Q911324) (← links)
- Some chain visibility problems in a simple polygon (Q911765) (← links)
- Triangulating input-constrained planar point sets (Q975526) (← links)
- Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons (Q982944) (← links)
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons (Q1101226) (← links)
- Parallel triangulation of a polygon in two calls to the trapezoidal map (Q1104087) (← links)
- Decomposition and intersection of simple splinegons (Q1105375) (← links)
- Optimum watchman routes (Q1107312) (← links)
- On geodesic properties of polygons relevant to linear time triangulation (Q1118350) (← links)
- Triangulations, visibility graph and reflex vertices of a simple polygon (Q1126249) (← links)
- Triangulating a simple polygon in linear time (Q1176324) (← links)
- Tiling polygons with parallelograms (Q1184161) (← links)
- Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures (Q1189285) (← links)
- Computing the shortest diagonal of a monotone polygon in linear time (Q1198084) (← links)
- Minimum vertex hulls for polyhedral domains (Q1199529) (← links)
- A workbench for computational geometry (Q1322571) (← links)
- Monotone path systems in simple regions (Q1323475) (← links)
- Computing minimum length paths of a given homotopy class (Q1330462) (← links)
- Simplest polymetric geometries (Q1380249) (← links)
- Characterizing and efficiently computing quadrangulations of planar point sets (Q1389729) (← links)
- Time-space trade-offs for triangulations and Voronoi diagrams (Q1615777) (← links)
- An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains (Q1755791) (← links)
- A fast Las Vegas algorithm for triangulating a simple polygon (Q1823686) (← links)
- Simplex and polygon equations. (Q2353224) (← links)
- Memory-constrained algorithms for simple polygons (Q2391542) (← links)
- A contribution to triangulation algorithms for simple polygons (Q2744733) (← links)
- Time-Space Trade-offs for Triangulations and Voronoi Diagrams (Q3449845) (← links)
- A new triangulation-linear class of simple polygons (Q3804191) (← links)
- (Q4455257) (← links)
- Triangulating a polygon in parallel (Q4732108) (← links)
- Quadrangulations of planar sets (Q5057435) (← links)
- A linear-time construction of the relative neighborhood graph within a histogram (Q5057436) (← links)
- A randomized algorithm for triangulating a simple polygon in linear time (Q5946382) (← links)
- External-memory algorithms for processing line segments in geographic information systems (Q6102308) (← links)
