Asano, T., T. Asano, and H. Imai, Partitioning a polygonal region into trapezoids, Journal of the ACM, 33, 2, pp. 290--312, 1986. Home/Search Document Not in Database Summary ACM TOC Related Articles Check |
This paper is cited in the following contexts:
No Quadrangulation is Extremely Odd - Bose, Toussaint (1995) (13 citations) (Correct)
....and considered as degenerate trapezoids. On the other hand, trapezoidizations are used in the manufacturing industry as the main goal in electron beam lithography systems [33] where subsequent processing time is proportional to the number of trapezoids in the decomposition. Asano, Asano and Imai [2] have shown that a partition of a polygonal region into the minimum number of trapezoids can be obtained in O(n ) time. In this paper we characterize those sets of points that admit a quadrangulation. We show that S admits a quadrangulation if and only if S does not have an odd number of ....
Asano, T., T. Asano, and H. Imai, Partitioning a polygonal region into trapezoids, Journal of the ACM, 33, 2, pp. 290--312, 1986.
Characterizing and Efficiently Computing Quadrangulations .. - Prosenjit Bose Godfried (1997) (Correct)
....and considered as degenerate trapezoids. On the other hand, trapezoidizations are used in the manufacturing industry as the main goal in electron beam lithography systems [37] where subsequent processing time is proportional to the number of trapezoids in the decomposition. Asano, Asano and Imai [2] have shown that a partition of a polygonal region into the minimum number of trapezoids can be obtained in O(n ) time. In this paper we characterize those sets of points that admit a quadrangulation. We show that a set of points S admits a quadrangulation if and only if S does not have an odd ....
Asano, T., T. Asano, and H. Imai, Partitioning a polygonal region into trapezoids, Journal of the ACM, 33, 2, pp. 290--312, 1986.
No Quadrangulation is Extremely Odd - Bose, Toussaint (1995) (13 citations) (Correct)
....and considered as degenerate trapezoids. On the other hand, trapezoidizations are used in the manufacturing industry as the main goal in electron beam lithography systems [33] where subsequent processing time is proportional to the number of trapezoids in the decomposition. Asano, Asano and Imai [2] have shown that a partition of a polygonal region into the minimum number of trapezoids can be obtained in O(n 2 ) time. In this paper we characterize those sets of points that admit a quadrangulation. We show that S admits a quadrangulation if and only if S does not have an odd number of ....
Asano, T., T. Asano, and H. Imai, Partitioning a polygonal region into trapezoids, Journal of the ACM, 33, 2, pp. 290--312, 1986.
Quadrangulations of Planar Sets - Toussaint (1985) (8 citations) (Correct)
....the work on trapezoids, triangles are allowed as degenerate trapezoids. On the other hand, trapezoidizations are used as the main goal in electronbeam lithography systems [SS79] where subsequent processing time is proportional to the number of trapezoids in the decomposition. Asano, Asano and Imai [AAI86] have shown that a partition of a polygonal region into the minimum number of trapezoids can be obtained in O(n 2 ) time. 4. Quadrangulating Point Sets One characterization of those sets of points that admit a quadrangulation is via matchings [RRT95] A set S of points (not all on a line) ....
Takao Asano, Tetsuo Asano and H. Imai, "Partitioning a polygonal region into trapezoids, " Journal of the A.C.M., vol. 33, No. 2, April 1986, pp. 290-312.
Over-the-Cell Channel Routing - Cong, Liu (1988) (Correct)
....a circle. Consequently, a two terminal net becomes a chord in the circle thus formed. It is not difficult to see that the corresponding circle graph is the intersection graph of I . It is known that the problem of finding a maximum independent set of a circle graph can be solved in polynomial time [10, 1, 20]. In particular, using the dynamic programming approach presented in [20] we have Lemma 3 3 TSOP can be solved optimally in O (c 2 ) time, where c is the number of columns. Combining Theorem 3 1 and Lemma 3 3, we obtain Theorem 3 2 If the number of terminals in each net is bounded by a ....
T. Asano, T. Asano and H. Imai. "Partitioning a Polygonal Region into Trapezoids," Journal of ACM, Vol. 33, pp. 290-312, 1986.
Computational Geometry - Lee (1996) (3 citations) (Correct)
.... time algorithms for computing the minimum partition of a simple polygon into simpler parts while allowing Steiner points can be found in [10, 120] The minimum partition or covering problem for simple polygons becomes NP hard when the polygons are allowed to have holes [74, 106] Asano et al.[9] showed that the problem of partitioning of a simple polygon with h holes into a minimum number of trapezoids with two horizontal sides can be solved in O(n h 2 ) time, and that the problem is NP complete, if h is part of the input. An O(n log n) time 3 approximation algorithm was presented. ....
Ta. Asano, Te. Asano and H. Imai, "Partitioning a Polygonal Region into Trapezoids," J. ACM 33,2 (April 1986), 290-312.
Computational Geometry I - Lee (1996) (3 citations) (Correct)
.... 45] Polynomial time algorithms for computing the minimum partition of a simple polygon into simpler parts while allowing Steiner points can be found in [4] The minimum partition or covering problem for simple polygons becomes NP hard when the polygons are allowed to have holes [32] Asano et al.[3] showed that the problem of partitioning a simple polygon with h holes into a minimum number of trapezoids with two horizontal sides can be solved in O(n h 2 ) time, and that the problem is NP complete, if h is part of the input. An O(n log n) time 3 approximation algorithm was presented. The ....
Ta. Asano, Te. Asano and H. Imai, "Partitioning a Polygonal Region into Trapezoids," J. ACM 33,2 (April 1986), 290-312.
Characterizing and Efficiently Computing Quadrangulations of.. - Bose, Toussaint (1997) (Correct)
....and considered as degenerate trapezoids. On the other hand, trapezoidizations are used in the manufacturing industry as the main goal in electron beam lithography systems [37] where subsequent processing time is proportional to the number of trapezoids in the decomposition. Asano, Asano and Imai [2] have shown that a partition of a polygonal region into the minimum number of trapezoids can be obtained in O(n 2 ) time. In this paper we characterize those sets of points that admit a quadrangulation. We show that a set of points S admits a quadrangulation if and only if S does not have an odd ....
Asano, T., T. Asano, and H. Imai, Partitioning a polygonal region into trapezoids, Journal of the ACM, 33, 2, pp. 290--312, 1986.
Decompositional Problems in Computational Geometry - Palios (1992) (Correct)
No context found.
T. Asano, T. Asano, and H. Imai, Partitioning a Polygonal Region into Trapezoids, Journal of the ACM 33 (1986), 290--312.
Decompositional Problems in Computational Geometry - Palios (1992) (Correct)
No context found.
T. Asano, and T. Asano, Partitioning Polygonal Regions into Trapezoids, Proc. 24th Annual IEEE Symposium on Foundations of Computer Science (1983), 233-- 241.
On the Complexity of Some Geometric Intersection Problems - Dévai (1995) (1 citation) (Correct)
No context found.
Asano, T., Asano, T. and Imai, H. Partitioning a polygonal region into trapezoids. J. ACM 33,2 (Apr. 1986) 290--312.
Restricted Track Assignment with Applications - Sarrafzadeh, Lee (1994) (2 citations) (Correct)
No context found.
Asano, T, T. Asano, and H. Imai, "Partitioning a Polygonal Region into Trapezoids," Journal of the ACM, Vol. 33, No. 2, April 1986, pp. 290-312.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC