A faster optimal algorithm for the measure problem

DOI10.1016/S0167-8191(05)80058-4MaRDI QIDQ1179216zbMATH OpenOpenAlexFDO

Authors Stephan Olariu, Zhaofang Wen, Weixiong Zhang

Publication date 26 June 1992

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-8191(05)80058-4

zbMATH Keywords

CREW PRAMcomponent layoutgeographic data processing

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)

Recommendations

• An optimal speedup algorithm for the measure problem
• scientific article; zbMATH DE number 3846893
• Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles
• An in-place algorithm for Klee's measure problem in two dimensions
• scientific article; zbMATH DE number 4037198

Cited in

(3)

• An optimal speedup algorithm for the measure problem
• An in-place algorithm for Klee's measure problem in two dimensions
• scientific article; zbMATH DE number 4037198 (Why is no real title available?)

This page was built for publication: A faster optimal algorithm for the measure problem

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