Computational geometry algorithms for the systolic screen

DOI10.1007/BF01759069zbMath0736.68075OpenAlexW2023691931WikidataQ62037513 ScholiaQ62037513MaRDI QIDQ1175650

Frank Dehne, Jörg-Rüdiger Sack, Nicola Santoro, Anne-Lise Hassenklover

Publication date: 25 June 1992

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

separabilityVoronoi diagrammaximavisibilityconvex hullssystolic arraymesh-of-processorsdigitized picturesoptical clustering

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Cellular automata (computational aspects) (68Q80)

Related Items

A nearest neighbor sweep circle algorithm for computing discrete Voronoi tessellations ⋮ Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the configuration space for a robot on a mesh-of-prosessors
• A systolic array for the longest common subsequence problem
• Translation separability of sets of polygons
• Optical clustering
• Solving visibility and separability problems on a mesh-of-processors
• Recognizing polygons, or how to spy
• Parallel computational geometry
• Maintenance of configurations in the plane
• A longest common subsequence algorithm suitable for similar text strings
• Digital Disks
• Graph Problems on a Mesh-Connected Processor Array
• Digital Topology
• Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
• Sorting on a mesh-connected parallel computer
• A fast algorithm for computing longest common subsequences
• Algorithms for the Longest Common Subsequence Problem
• Parallel computation of discrete Voronoi diagrams
• On Limit Properties in Digitization Schemes
• The 1972 Wald Lecture Robust Statistics: A Review