Computing convexity properties of images on a pyramid computer
From MaRDI portal
Publication:1175644
DOI10.1007/BF01759066zbMath0737.68090MaRDI QIDQ1175644
Publication date: 25 June 1992
Published in: Algorithmica (Search for Journal in Brave)
Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multiresolution image processing and analysis
- Digital and cellular convexity
- How a Digital Computer Can Tell Whether a Line is Straight
- Discrete Representation of Straight Lines
- Three-Dimensional Digital Line Segments
- Data Movement Techniques for the Pyramid Computer
- Digital Topology
- Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
- Parallel Image Processing by Memory-Augmented Cellular Automata
- Digital Straight Lines and Convexity of Digital Regions
- Digital Convexity, Straightness, and Convex Polygons
- Convex Digital Solids
- Digital Straight Line Segments
- Determining the minimum-area encasing rectangle for an arbitrary closed curve
- Sorting on a mesh-connected parallel computer
- Layered "Recognition Cone" Networks That Preprocess, Classify, and Describe
This page was built for publication: Computing convexity properties of images on a pyramid computer
