Pages that link to "Item:Q1176324"
From MaRDI portal
The following pages link to Triangulating a simple polygon in linear time (Q1176324):
Displayed 30 items.
- A multifacility location problem on median spaces (Q1917237) (← links)
- Algorithms for the decomposition of a polygon into convex polygons (Q1969864) (← links)
- On compatible triangulations of simple polygons (Q2367126) (← links)
- Approximate unions of lines and Minkowski sums (Q2369877) (← links)
- Minimum weight pseudo-triangulations (Q2385693) (← links)
- Three problems about simple polygons (Q2432735) (← links)
- A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation (Q2489546) (← links)
- Approximate convex decomposition of polygons (Q2507162) (← links)
- Rectilinear paths among rectilinear obstacles (Q2563920) (← links)
- SHORTEST DESCENDING PATHS: TOWARDS AN EXACT ALGORITHM (Q2893462) (← links)
- PARETO ENVELOPES IN SIMPLE POLYGONS (Q3070044) (← links)
- Delaunay Triangulation of Imprecise Points Simplified and Extended (Q3183447) (← links)
- Solving the irregular strip packing problem via guided local search for overlap minimization (Q3401324) (← links)
- OPTIMAL VORONOI DIAGRAM CONSTRUCTION WITH n CONVEX SITES IN THREE DIMENSIONS (Q3503107) (← links)
- Algorithms for Computing Diffuse Reflection Paths in Polygons (Q3605484) (← links)
- Generating All Triangulations of Plane Graphs (Extended Abstract) (Q3605494) (← links)
- CLEARING A POLYGON WITH TWO 1-SEARCHERS (Q3628102) (← links)
- Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time (Q4210159) (← links)
- Dynamic Trees and Dynamic Point Location (Q4210167) (← links)
- Illumination of Orthogonal Polygons with Orthogonal Floodlights (Q4513201) (← links)
- Determining Weak Visibility of a Polygon from an Edge in Parallel (Q4513212) (← links)
- ISOMORPHIC TRIANGULATIONS WITH SMALL NUMBER OF STEINER POINTS (Q4513241) (← links)
- VISIBILITY STABS AND DEPTH-FIRST SPIRALLING ON LINE SEGMENTS IN OUTPUT SENSITIVE TIME (Q4762913) (← links)
- Reverse polish notation method (Q4831399) (← links)
- OPTIMAL TRIANGULATIONS OF POINTS AND SEGMENTS WITH STEINER POINTS (Q5305065) (← links)
- Optimal Triangulation with Steiner Points (Q5387801) (← links)
- Fast enumeration algorithms for non-crossing geometric graphs (Q5896957) (← links)
- Characterizing LR-visibility polygons and related problems (Q5931367) (← links)
- An addition to art galleries with interior walls (Q5932813) (← links)
- Conformal mapping in linear time (Q5962354) (← links)
