A fast algorithm for the Boolean masking problem

DOI10.1016/0734-189X(85)90159-8MaRDI QIDQ3759941zbMATH OpenFDO

Authors Thomas Ottmann, Peter Widmayer, D. Wood

Publication date 1985

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

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)

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

Cited in

(10)

• scientific article; zbMATH DE number 4121435 (Why is no real title available?)
• 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
• Algorithms for Switching between Boolean and Arithmetic Masking of Second Order
• An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction
• 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)