A parallel algorithm for approximate regularity.

DOI10.1016/S0020-0190(01)00252-6MaRDI QIDQ1607140zbMATH OpenFDO

Authors Laurence Boxer, Russ Miller

Publication date 25 July 2002

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

geometric pattern recognitionspatial regularity

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Recommendations

• On detecting spatial regularity in noisy images
• Parallel algorithms for all maximal equally-spaced collinear sets and all maximal regular coplanar lattices
• Optimal parallel algorithms for point-set and polygon problems
• Scalable parallel algorithms for geometric pattern recognition
• Optimal parallel algorithms for proximate points, with applications (extended abstract)

Cites work

• Linear Programming in Linear Time When the Dimension Is Fixed
• On detecting spatial regularity in noisy images
• Parallel Merge Sort
• Parallel algorithms for all maximal equally-spaced collinear sets and all maximal regular coplanar lattices

Cited in

(3)

• Parallel algorithms for all maximal equally-spaced collinear sets and all maximal regular coplanar lattices
• scientific article; zbMATH DE number 2119673 (Why is no real title available?)
• On detecting spatial regularity in noisy images

This page was built for publication: A parallel algorithm for approximate regularity.

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