Pages that link to "Item:Q1176324"
From MaRDI portal
The following pages link to Triangulating a simple polygon in linear time (Q1176324):
Displayed 50 items.
- Minimum weight pseudo-triangulations (Q2385693) (← links)
- Memory-constrained algorithms for simple polygons (Q2391542) (← links)
- An efficient randomized algorithm for higher-order abstract Voronoi diagrams (Q2414862) (← links)
- Computing \(L_1\) shortest paths among polygonal obstacles in the plane (Q2414865) (← links)
- A new balanced subdivision of a simple polygon for time-space trade-off algorithms (Q2415364) (← links)
- Approximation algorithms for decomposing octilinear polygons (Q2420578) (← links)
- Three problems about simple polygons (Q2432735) (← links)
- On the polygonal diameter (= link diameter) of the interior, resp. exterior, of a simple closed polygon in the plane (Q2446340) (← 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)
- On orthogonally guarding orthogonal polygons with bounded treewidth (Q2659775) (← links)
- Rectangular partitions of a rectilinear polygon (Q2678268) (← links)
- Fast grid-free surface tracking (Q2802379) (← links)
- Dividing a Territory Among Several Vehicles (Q2815468) (← links)
- SHORTEST DESCENDING PATHS: TOWARDS AN EXACT ALGORITHM (Q2893462) (← links)
- ALGORITHMS FOR DISTANCE PROBLEMS IN PLANAR COMPLEXES OF GLOBAL NONPOSITIVE CURVATURE (Q2931158) (← links)
- PARETO ENVELOPES IN SIMPLE POLYGONS (Q3070044) (← links)
- Abstract Voronoi Diagrams from Closed Bisecting Curves (Q3132921) (← links)
- Reconstruction of Weakly Simple Polygons from Their Edges (Q3177902) (← 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)
- CUTTING OUT POLYGONS WITH A CIRCULAR SAW (Q3459357) (← 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)
- Efficient and Qualified Mesh Generation for Gaussian Molecular Surface Using Adaptive Partition and Piecewise Polynomial Approximation (Q4637667) (← links)
- VISIBILITY STABS AND DEPTH-FIRST SPIRALLING ON LINE SEGMENTS IN OUTPUT SENSITIVE TIME (Q4762913) (← links)
- Reverse polish notation method (Q4831399) (← links)
- Computing the Mostar index in networks with applications to molecular graphs (Q4988503) (← links)
- (Q5009355) (← links)
- Adaptive Planar Point Location (Q5009786) (← links)
- Query-Points Visibility Constraint Minimum Link Paths in Simple Polygons (Q5025050) (← links)
- On condorcet and median points of simple rectilinear polygons (Q5055889) (← links)
- Quadrangulations of planar sets (Q5057435) (← links)
- Vertex Guarding for Dynamic Orthogonal Art Galleries (Q5072223) (← links)
- Triangulability of convex graphs and convex skewness (Q5083873) (← links)
- (Q5088939) (← links)
- (Q5088992) (← links)
- Point Location in Incremental Planar Subdivisions. (Q5091043) (← links)
- Checking the convexity of polytopes and the planarity of subdivisions (extended abstract) (Q5096937) (← links)
- Constructing pairwise disjoint paths with few links (Q5096957) (← links)
- Guarding a Polygon Without Losing Touch (Q5100952) (← links)
- (Q5116518) (← links)