An efficient parallel algorithm for geometrically characterising drawings of a class of 3-D objects

DOI10.1007/BF01262403zbMath1433.68489OpenAlexW2031736896MaRDI QIDQ2273354

Nick D. Dendris, Iannis A. Kalafatis, Lefteris M. Kirousis

Publication date: 23 September 2019

Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)

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

zbMATH Keywords

image analysisefficient parallel algorithmsline drawingslabelling of lines of drawingsplanar projections of 3-D objects

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10) Machine vision and scene understanding (68T45)

Related Items (1)

Fast parallel constraint satisfaction

Cites Work

• Unnamed Item
• The complexity of recognizing polyhedral scenes
• Fast parallel constraint satisfaction
• Constraint relaxation may be perfect
• On the parallel complexity of discrete relaxation in constraint satisfaction networks
• A Simple Parallel Algorithm for the Maximal Independent Set Problem
• A fast parallel algorithm for the maximal independent set problem
• Constructing a Maximal Independent Set in Parallel

This page was built for publication: An efficient parallel algorithm for geometrically characterising drawings of a class of 3-D objects