Quadrilaterizing an Orthogonal Polygon in Parallel

DOI10.1002/MALQ.19980440104MaRDI QIDQ4379627zbMATH OpenOpenAlexFDO

Authors Jana Dietel, Hans-Dietrich Hecker

Publication date 13 July 1998

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19980440104

zbMATH Keywords

CREW-algorithmdecompositionquadrilaterization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)

Recommendations

• Triangulating a polygon in parallel
• scientific article; zbMATH DE number 4074480
• Partitioning and separating sets of orthogonal polygons
• Parallel triangulation of a polygon in two calls to the trapezoidal map
• Planar separators and parallel polygon triangulation.

Cites work

• Efficient Algorithms for Geometric Graph Search Problems
• scientific article; zbMATH DE number 4065813 (Why is no real title available?)

This page was built for publication: Quadrilaterizing an Orthogonal Polygon in Parallel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4379627)