Computational geometry algorithms for the systolic screen

DOI10.1007/BF01759069MaRDI QIDQ1175650zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Frank Dehne, Anne-Lise Hassenklover, Jörg-Rüdiger Sack, N. Santoro

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

convex hullsdigitized picturesmaximamesh-of-processorsoptical clusteringseparabilitysystolic arrayvisibilityVoronoi diagram

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4155940
• Systolic algorithms for computational geometry problems - a survey
• scientific article; zbMATH DE number 4050999
• Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region
• scientific article; zbMATH DE number 4170139

Cites work

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

Cited in

(13)

• VLSI systems for some problems of computational geometry
• Systolic algorithms for rectilinear polygons
• Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region
• Systolic algorithms for computational geometry problems - a survey
• Optimal geometric algorithms for digitized images on fixed-size linear arrays and scan-line arrays
• Parallel computational geometry of rectangles
• Constant time BSR solutions to \(L_ 1\) metric and digital geometry problems
• A nearest neighbor sweep circle algorithm for computing discrete Voronoi tessellations
• scientific article; zbMATH DE number 4155940 (Why is no real title available?)
• Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles
• scientific article; zbMATH DE number 4050999 (Why is no real title available?)
• Géométrie systolique et technique de régularisation
• Geometric computation with smart pixels

This page was built for publication: Computational geometry algorithms for the systolic screen

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