\(O(\log \log n)\)-time integer geometry on the CRCW PRAM

DOI10.1007/BF01300373zbMath0837.68121OpenAlexW1974381145MaRDI QIDQ1894712

Krzysztof Diks, Mirosław Kowaluk, Bogdan S. Chlebus

Publication date: 24 July 1995

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01300373

zbMATH Keywords

dominating setcomputational geometryclosest pair of pointsintersection of convex polygonsintersection of Manhattan line segmentslargest empty square

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel computational geometry
• Improved deterministic parallel integer sorting
• An O(logn) parallel connectivity algorithm

This page was built for publication: \(O(\log \log n)\)-time integer geometry on the CRCW PRAM