Pages that link to "Item:Q1176324"
From MaRDI portal
The following pages link to Triangulating a simple polygon in linear time (Q1176324):
Displaying 50 items.
- On triangulating three-dimensional polygons (Q1392846) (← links)
- Approximation algorithms for the watchman route and zookeeper's problems. (Q1427191) (← links)
- Distances in benzenoid systems: Further developments (Q1584454) (← links)
- An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons (Q1603488) (← links)
- Lower bounds for approximate polygon decomposition and minimum gap (Q1603513) (← links)
- Optimally computing a shortest weakly visible line segment inside a simple polygon (Q1614066) (← links)
- Recognizing weakly simple polygons (Q1688854) (← links)
- Geometric path problems with violations (Q1709576) (← links)
- An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains (Q1755791) (← links)
- The geometry of carpentry and joinery (Q1765245) (← links)
- Approximation algorithms for lawn mowing and milling (Q1841242) (← links)
- Splitting a Delaunay triangulation in linear time (Q1849762) (← links)
- Translating a convex polyhedron over monotone polyhedra (Q1862129) (← links)
- Simplicial mesh of an arbitrary polyhedron. (Q1876839) (← links)
- Expected asymptotically optimal planar point location (Q1883578) (← links)
- A linear-time algorithm for constructing a circular visibility diagram (Q1897474) (← links)
- Optimal parallel algorithms for rectilinear link-distance problems (Q1897477) (← links)
- Finding a closet visible vertex pair between two polygons (Q1899450) (← links)
- On a class of \(O(n^ 2)\) problems in computational geometry (Q1903639) (← links)
- Linear-size nonobtuse triangulation of polygons (Q1906045) (← 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 linear time algorithm to remove winding of a simple polygon (Q2489541) (← links)
