Parallel strategies for geometric probing

DOI10.1016/0196-6774(92)90022-5MaRDI QIDQ3990612zbMATH OpenOpenAlexFDO

Authors Michael Lindenbaum, Alfred M. Bruckstein

Publication date 28 June 1992

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(92)90022-5

zbMATH Keywords

geometric probingreconstruction of shapes of convex planar polygons

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Convex sets in (2) dimensions (including convex curves) (52A10)

Recommendations

• scientific article; zbMATH DE number 1182929
• Parallel computational geometry
• Parallel geometric algorithms for multi-core computers
• Parallel geometric algorithms for multi-core computers
• scientific article; zbMATH DE number 1206101
• scientific article; zbMATH DE number 4092772
• Finding coarse grained parallelism in computational geometry algorithms
• Parallel algorithms for geometric graph problems
• scientific article; zbMATH DE number 1424306
• scientific article; zbMATH DE number 1424292

Cited in

(2)

• Algorithmic construction of the subdifferential from directional derivatives
• Point probe decision trees for geometric concept classes

This page was built for publication: Parallel strategies for geometric probing

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