Counting Convex and Non-Convex 4-Holes in a Point Set-Reference-Cited by-同舟云学术

Counting Convex and Non-Convex 4-Holes in a Point Set

Published:2021-09-01 Issue:9 Volume:E104.A Page:1094-1100
ISSN:0916-8508
Container-title:IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
language:en
Short-container-title:IEICE Trans. Fundamentals

Author:

SUNG Young-Hun¹,BAE Sang Won¹

Affiliation:

1. Division of Computer Science and Engineering, Kyonggi University

Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Subject

Applied Mathematics,Electrical and Electronic Engineering,Computer Graphics and Computer-Aided Design,Signal Processing

Link

https://www.jstage.jst.go.jp/article/transfun/E104.A/9/E104.A_2020DMP0002/_pdf

Reference24 articles.

1. [1] P. Erdős and G. Szekeres, “A combinatorial problem in geometry,” Compositio Math., vol.2, pp.463-470, 1935.

2. [2] P. Erdős and G. Szekeres, “On some extremum problems in elementary geometry,” Ann. Univ. Sci. Budapest Eötvös Sect. Math., vol.3-4, pp.53-62, 1961.

3. [3] G. Szekeres and L. Peters, “Computer solution to the 17-point Erdős-Szekeres problem,” ANZIAM J., vol.48, no.2, pp.151-164, 2006. 10.1017/s144618110000300x

4. [4] G. Tóth and P. Valtr, “The Erdős-Szekeres theorem: Upper boiunds and related results,” Combinatorial and Computational Geometry, eds. J.E. Goodman, J. Pach, and E. Welzl, MSRI, vol.52, pp.557-568, Cambridge University Press, 2005.

5. [5] P. Erdős, “Some more problems on elementary geometry,” Austral. Math. Soc. Gaz., vol.5, pp.52-54, 1978.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Faster counting empty convex polygons in a planar point set;Information Processing Letters;2022-04

2. Counting Non-Convex 5-Holes in a Planar Point Set;Symmetry;2022-01-05