Optimal algorithms for some polygon enclosure problems for VLSI layout analysis
From MaRDI portal
Publication:864923
DOI10.1007/s10852-005-9008-zzbMath1104.68844OpenAlexW2015574852MaRDI QIDQ864923
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
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Software, source code, etc. for problems pertaining to geometry (51-04) Algorithms in computer science (68W99)
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient algorithms for counting and reporting pairwise intersections between convex polygons
- The space-optimal version of a known rectangle enclosure reporting algorithm
- Reporting intersecting pairs of convex polytopes in two and three dimensions
- Algorithms for Reporting and Counting Geometric Intersections
- An improved algorithm for the rectangle enclosure problem
- The Rectangle Enclosure and Point-Dominance Problems Revisited
This page was built for publication: Optimal algorithms for some polygon enclosure problems for VLSI layout analysis
