Pages that link to "Item:Q960516"
From MaRDI portal
The following pages link to Planar separators and parallel polygon triangulation. (Q960516):
Displaying 21 items.
- Linear-time compression of 2-manifold polygon meshes into information-theoretically optimal number of bits (Q545998) (← links)
- Testing a simple polygon for monotonicity optimally in parallel (Q688449) (← links)
- Optimal deterministic algorithms for 2-d and 3-d shallow cuttings (Q728495) (← links)
- How to catch marathon cheaters: new approximation algorithms for tracking paths (Q832889) (← links)
- On the negative cost girth problem in planar networks (Q891820) (← links)
- Sublinear separators, fragility and subexponential expansion (Q896068) (← links)
- Parallelized ear clipping for the triangulation and constrained Delaunay triangulation of polygons (Q1615773) (← links)
- Efficient vertex-label distance oracles for planar graphs (Q1743124) (← links)
- Recursion and parallel algorithms in geometric modeling problems (Q1956990) (← links)
- Multicuts in planar and bounded-genus graphs with bounded number of terminals (Q2408168) (← links)
- Three problems about simple polygons (Q2432735) (← links)
- Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths (Q2968519) (← links)
- Quadrilaterizing an Orthogonal Polygon in Parallel (Q4379627) (← links)
- Determining Weak Visibility of a Polygon from an Edge in Parallel (Q4513212) (← links)
- (Q5111734) (← links)
- Contracting a Planar Graph Efficiently (Q5111739) (← links)
- Short and Simple Cycle Separators in Planar Graphs (Q5266605) (← links)
- Structured recursive separator decompositions for planar graphs in linear time (Q5495821) (← links)
- Faster shortest-path algorithms for planar graphs (Q5906822) (← links)
- Many distances in planar graphs (Q5920250) (← links)
- Good \(r\)-divisions imply optimal amortized decremental biconnectivity (Q6614619) (← links)
