Optimal algorithms for some polygon enclosure problems for VLSI layout analysis (Q864923): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10852-005-9008-z
+Normal rank
@@ Property / OpenAlex ID @@
+W2015574852
@@ Property / OpenAlex ID: W2015574852 / rank @@
+Normal rank
@@ Property / cites work @@
+Reporting intersecting pairs of convex polytopes in two and three dimensions
+Normal rank
@@ Property / cites work @@
+Algorithms for Reporting and Counting Geometric Intersections
+Normal rank
@@ Property / cites work @@
+The space-optimal version of a known rectangle enclosure reporting algorithm
+Normal rank
@@ Property / cites work @@
+The Rectangle Enclosure and Point-Dominance Problems Revisited
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for counting and reporting pairwise intersections between convex polygons
+Normal rank
@@ Property / cites work @@
+An improved algorithm for the rectangle enclosure problem
+Normal rank
@@ Property / cites work @@
+Q3694703
@@ Property / cites work: Q3694703 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4850027
@@ Property / cites work: Q4850027 / rank @@
+Normal rank