ON THE MAXIMAL CIRCUMRADIUS OF A PLANAR CONVEX SET CONTAINING ONE LATTICE POINT

被引：1

作者：

AWYONG, PW ^{[1
]}

SCOTT, PR ^{[1
]}

机构：

[1] UNIV ADELAIDE,DEPT PURE MATH,ADELAIDE,SA 5005,AUSTRALIA

来源：

BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY | 1995年 / 52卷 / 01期

关键词：

D O I：

10.1017/S0004972700014519

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We obtain a result about the maximal circumradius of a planar compact convex set having circumcentre O and containing no non-zero lattice points in its interior. In addition, we show that under certain conditions, the set with maximal circumradius is a triangle with an edge containing two lattice points.

引用

页码：137 / 151

页数：15

共 50 条

[21] New inequalities for planar convex sets with lattice point constraints
Awyong, PW
Scott, PR
BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 1996, 54 (03) : 391 - 396
[22] A new algorithm for computing the convex hull of a planar point set
Guang-hui Liu
Chuan-bo Chen
Journal of Zhejiang University-SCIENCE A, 2007, 8 : 1210 - 1217
[23] A new algorithm for computing the convex hull of a planar point set
LIU Guang-hui
Journal of Zhejiang University(Science A:An International Applied Physics & Engineering Journal), 2007, (08) : 1210 - 1217
[24] AN EFFICIENT ALGORITHM FOR THE CONVEX HULL OF PLANAR SCATTERED POINT SET
Fu, Zhongliang
Lu, Yuefeng
XXII ISPRS CONGRESS, TECHNICAL COMMISSION II, 2012, 39-B2 : 63 - 66
[25] A new algorithm for computing the convex hull of a planar point set
Liu, Guang-Hui
Chen, Chuan-Bo
JOURNAL OF ZHEJIANG UNIVERSITY-SCIENCE A, 2007, 8 (08): : 1210 - 1217
[26] Faster counting empty convex polygons in a planar point set
Bae, Sang Won
INFORMATION PROCESSING LETTERS, 2022, 175
[27] Simple fast convex hull algorithm of planar point set
Jin, Wenhua
He, Tao
Tang, Weiqing
Tang, Rongxi
Beijing Hangkong Hangtian Daxue Xuebao/Journal of Beijing University of Aeronautics and Astronautics, 1999, 25 (01): : 72 - 75
[28] The critical point and related symmetry measures of a planar convex set
Kaiser, MJ
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1996, 32 (09) : 79 - 98
[29] A problem of Steinhaus: Can all placements of a planar set contain exactly one lattice point?
Kolountzakis, MN
ANALYTIC NUMBER THEORY, VOL. 2 - PROCEEDINGS OF A CONFERENCE IN HONOR OF HEINI HALBERSTAM, 1996, 139 : 559 - 565
[30] A CENSUS OF CONVEX LATTICE POLYGONS WITH AT MOST ONE INTERIOR LATTICE POINT
RABINOWITZ, S
ARS COMBINATORIA, 1989, 28 : 83 - 96

← 1 2 3 4 5 →