共 50 条
- [32] A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets COMPUTATIONAL GEOMETRY AND GRAPH THEORY, 2008, 4535 : 90 - 100
- [33] A Convex Hull Algorithm for Planar Point Set Based on Privacy Protecting PROCEEDINGS OF THE FIRST INTERNATIONAL WORKSHOP ON EDUCATION TECHNOLOGY AND COMPUTER SCIENCE, VOL III, 2009, : 434 - 437
- [34] An Efficient Algorithm of Convex Hull for Very Large Planar Point Set PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTER SCIENCE AND ENGINEERING (CSE 2013), 2013, 42 : 37 - 40
- [35] Efficient convex hull algorithm for very large planar point set Jisuanji Gongcheng/Computer Engineering, 2006, 32 (21): : 64 - 66
- [37] ONE GENERAL-METHOD FOR THE CONVEX SET POINT FINDING IZVESTIYA VYSSHIKH UCHEBNYKH ZAVEDENII MATEMATIKA, 1983, (06): : 43 - 51
- [39] AREA, WIDTH AND DIAMETER OF PLANAR CONVEX-SETS WITH LATTICE POINT CONSTRAINTS INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, 1983, 14 (04): : 444 - 448