On parallel complexity of planar triangulations

DOI10.1007/3-540-60692-0_64MaRDI QIDQ2956699zbMATH OpenOpenAlexFDO

Authors Cao Wang, Christos Levcopoulos, Andrzej Lingas

Publication date 19 January 2017

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60692-0_64

Mathematics Subject Classification ID

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

Recommendations

• P-COMPLETE GEOMETRIC PROBLEMS
• scientific article; zbMATH DE number 4064506
• Parallel triangulation of a polygon in two calls to the trapezoidal map
• A space efficient greedy triangulation algorithm
• Parallel computational geometry

Cited in

(4)

• An optimal parallel algorithm for triangulating a set of points in the plane
• A space efficient greedy triangulation algorithm
• P-COMPLETE GEOMETRIC PROBLEMS
• PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS

This page was built for publication: On parallel complexity of planar triangulations

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