共 50 条
- [22] On the minimum number of mutually disjoint holes in planar point sets [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2015, 48 (09): : 661 - 672
- [25] Covering a Point Set by Two Disjoint Rectangles [J]. ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2008, 5369 : 728 - +
- [26] On the minimum size of a point set containing a 5-hole and double disjoint 3-holes [J]. Mathematical Notes, 2015, 97 : 951 - 960
- [28] Planar Point Sets With Large Minimum Convex Decompositions [J]. Graphs and Combinatorics, 2013, 29 : 1347 - 1353
- [29] Planar Point Sets With Large Minimum Convex Decompositions [J]. GRAPHS AND COMBINATORICS, 2013, 29 (05) : 1347 - 1353
- [30] A Fast Convex Hull Algorithm of Planar Point Set [J]. MECHATRONICS AND INTELLIGENT MATERIALS III, PTS 1-3, 2013, 706-708 : 1852 - 1855