A fast algorithm for the Boolean masking problem

DOI10.1016/0734-189X(85)90159-8zbMATH Open0622.68045MaRDI QIDQ3759941FDOQ3759941

D. Wood, Peter Widmayer, Thomas Ottmann

Publication date: 1985

Published in: Computer Vision, Graphics, and Image Processing (Search for Journal in Brave)

Recommendations

• A parallel algorithm for computing polygon set operations
• The contour problem for rectilinear polygons
• Optimal algorithms for some polygon enclosure problems for VLSI layout analysis
• scientific article; zbMATH DE number 3894498
• scientific article; zbMATH DE number 3918386

zbMATH Keywords

algorithmcomputational geometrycomputer graphicsBoolean mask combinationscalculation of Boolean combinations between layers of a VLSI circuit layouthidden-line-elimination problemi-contour problem

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Analysis of algorithms and problem complexity (68Q25) Applications of graph theory to circuits and networks (94C15)

Cited In (10)

• Title not available (Why is that?)
• Time and space efficient algorithms for shortest paths between convex polygons
• Optimal algorithms for some polygon enclosure problems for VLSI layout analysis
• Polygon placement under translation and rotation
• An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction
• Algorithms for Switching between Boolean and Arithmetic Masking of Second Order
• Separating a polyhedron by one translation from a set of obstacles
• Fast verification of masking schemes in characteristic two
• A worst-case efficient algorithm for hidden-line elimination^†
• Limits of local search: quality and efficiency

This page was built for publication: A fast algorithm for the Boolean masking problem

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