Parallel computation of distance transforms

DOI10.1007/BF01759067zbMath0738.68089MaRDI QIDQ1175646

Otfried Schwarzkopf

Publication date: 25 June 1992

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

Voronoi diagrammesh of treesdistance transformspyramid computer

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)

Related Items

Constant time BSR solutions to \(L_ 1\) metric and digital geometry problems ⋮ Medial axis transform on mesh-connected computers with hyperbus broadcasting ⋮ The equivalence of the chessboard distance transform and the medial axis transform^∗ ⋮ Faster core-set constructions and data-stream algorithms in fixed dimensions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel computational geometry
• Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees
• Pyramid computer solutions of the closest pair problem
• Data Movement Techniques for the Pyramid Computer
• Two-Dimensional Voronoi Diagrams in the L _p -Metric
• Applications of Number Theory to Numerical Analysis
• Triangle cellular automata
• Parallel computation of discrete Voronoi diagrams
• Sequential Operations in Digital Picture Processing