A fast algorithm for the Boolean masking problem

DOI10.1016/0734-189X(85)90159-8zbMath0622.68045MaRDI QIDQ3759941

Thomas Ottmann, Derick Wood, Peter Widmayer

Publication date: 1985

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

zbMATH Keywords

algorithmcomputer graphicscomputational geometryBoolean mask combinationscalculation of Boolean combinations between layers of a VLSI circuit layouthidden-line-elimination problemi-contour problem

Mathematics Subject Classification ID

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

Related Items (6)

Time and space efficient algorithms for shortest paths between convex polygons ⋮ Separating a polyhedron by one translation from a set of obstacles ⋮ A worst-case efficient algorithm for hidden-line elimination^† ⋮ Polygon placement under translation and rotation ⋮ Limits of local search: quality and efficiency ⋮ An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction

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