Optimal algorithms for some polygon enclosure problems for VLSI layout analysis

DOI10.1007/S10852-005-9008-ZMaRDI QIDQ864923zbMATH OpenOpenAlexFDO

Authors Vamsi Krishna Kundeti, Prosenjit Gupta

Publication date 13 February 2007

Published in JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10852-005-9008-z

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to geometry (51-04) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Algorithms in computer science (68W99)

Recommendations

• scientific article; zbMATH DE number 3911725
• A fast algorithm for the Boolean masking problem
• VLSI systems for some problems of computational geometry
• scientific article; zbMATH DE number 4039253
• Minimum-perimeter enclosures

Cites work

• Algorithms for Reporting and Counting Geometric Intersections
• An improved algorithm for the rectangle enclosure problem
• Efficient algorithms for counting and reporting pairwise intersections between convex polygons
• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 802995 (Why is no real title available?)
• Reporting intersecting pairs of convex polytopes in two and three dimensions
• The Rectangle Enclosure and Point-Dominance Problems Revisited
• The space-optimal version of a known rectangle enclosure reporting algorithm

Cited in

(5)

• scientific article; zbMATH DE number 3911725 (Why is no real title available?)
• A fast algorithm for the Boolean masking problem
• scientific article; zbMATH DE number 1930924 (Why is no real title available?)
• scientific article; zbMATH DE number 833244 (Why is no real title available?)
• Data structures for extension violations in a query range

This page was built for publication: Optimal algorithms for some polygon enclosure problems for VLSI layout analysis

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