Planar separators and parallel polygon triangulation.

DOI10.1006/jcss.1995.1076zbMath1295.05233OpenAlexW1968647828MaRDI QIDQ960516

Michael T. Goodrich

Publication date: 21 December 2008

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/4ce715c0c1a61ba69e3d70b1bc0cf34e5acd6f29

zbMATH Keywords

planar separatorsparallel polygon triangulation

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (18)

Parallelized ear clipping for the triangulation and constrained Delaunay triangulation of polygons ⋮ How to catch marathon cheaters: new approximation algorithms for tracking paths ⋮ Multicuts in planar and bounded-genus graphs with bounded number of terminals ⋮ On the negative cost girth problem in planar networks ⋮ Sublinear separators, fragility and subexponential expansion ⋮ Three problems about simple polygons ⋮ Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths ⋮ Recursion and parallel algorithms in geometric modeling problems ⋮ Efficient vertex-label distance oracles for planar graphs ⋮ Testing a simple polygon for monotonicity optimally in parallel ⋮ Linear-time compression of 2-manifold polygon meshes into information-theoretically optimal number of bits ⋮ Faster shortest-path algorithms for planar graphs ⋮ Optimal deterministic algorithms for 2-d and 3-d shallow cuttings ⋮ Unnamed Item ⋮ Many distances in planar graphs ⋮ Contracting a Planar Graph Efficiently ⋮ Short and Simple Cycle Separators in Planar Graphs ⋮ Determining Weak Visibility of a Polygon from an Edge in Parallel

This page was built for publication: Planar separators and parallel polygon triangulation.