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.
- Finding a closet visible vertex pair between two polygons (Q1899450) (← links)
- On a class of \(O(n^ 2)\) problems in computational geometry (Q1903639) (← links)
- Generalized hidden surface removal (Q1917036) (← links)
- Generalized guarding and partitioning for rectilinear polygons (Q1917042) (← links)
- A multifacility location problem on median spaces (Q1917237) (← links)
- Algorithms for the decomposition of a polygon into convex polygons (Q1969864) (← links)
- Computing the \(k\)-visibility region of a point in a polygon (Q2032289) (← links)
- Affine invariant triangulations (Q2065637) (← links)
- Optimal placement of base stations in border surveillance using limited capacity drones (Q2079881) (← links)
- Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane (Q2084662) (← links)
- Planar straight-line realizations of 2-trees with prescribed edge lengths (Q2151440) (← links)
- Optimally guarding 2-reflex orthogonal polyhedra by reflex edge guards (Q2173452) (← links)
- Adaptive density estimation on bounded domains under mixing conditions (Q2188474) (← links)
- Shortest paths and convex hulls in 2D complexes with non-positive curvature (Q2206723) (← links)
- Covering paths for planar point sets (Q2250054) (← links)
- \(L_{1}\) shortest path queries in simple polygons (Q2272388) (← links)
- Compressed algebraic cubature over polygons with applications to optical design (Q2297095) (← links)
- A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon (Q2300726) (← links)
- High-order polygonal discontinuous Petrov-Galerkin (PolyDPG) methods using ultraweak formulations (Q2310869) (← links)
- Monotone drawings of graphs with fixed embedding (Q2346955) (← links)
- Fast segment insertion and incremental construction of constrained Delaunay triangulations (Q2354921) (← links)
- On compatible triangulations of simple polygons (Q2367126) (← links)
- Approximate unions of lines and Minkowski sums (Q2369877) (← links)
- 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)