On crossing-families in planar point sets

被引：2

作者：

Aichholzer, Oswin ^{[1
]}

Kyncl, Jan ^{[2
]}

Scheucher, Manfred ^{[3
]}

Vogtenhuber, Birgit ^{[1
]}

Valtr, Pavel ^{[2
]}

机构：

[1] Graz Univ Technol, Inst Software Technol, Graz, Austria

[2] Charles Univ Prague, Fac Math & Phys, Dept Appl Math, Prague, Czech Republic

[3] Tech Univ Berlin, Inst Math, Berlin, Germany

来源：

COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | 2022年 / 107卷

基金：

奥地利科学基金会;

关键词：

Crossing family; Point set; Order type; Geometric thrackle;

D O I：

10.1016/j.comgeo.2022.101899

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

A k-crossing family in a point set S in general position is a set of k segments spanned by points of S such that all k segments mutually cross. In this short note we present two statements on crossing families which are based on sets of small cardinality: (1) Any set of at least 15 points contains a crossing family of size 4. (2) There are sets of n points which do not contain a crossing family of size larger than 8 inverted right perpendicular pi/4inverted left perpendicular. Both results improve the previously best known bounds. (C) 2022 Elsevier B.V. All rights reserved.

引用

页数：8

共 50 条

[31] Trapezoids and Deltoids in Wide Planar Point Sets
Gy. Elekes
Graphs and Combinatorics, 2019, 35 : 569 - 578
[32] Trapezoids and Deltoids in Wide Planar Point Sets
Elekes, Gy.
GRAPHS AND COMBINATORICS, 2019, 35 (03) : 569 - 578
[33] COUNTING CONVEX POLYGONS IN PLANAR POINT SETS
MITCHELL, JSB
ROTE, G
SUNDARAM, G
WOEGINGER, G
INFORMATION PROCESSING LETTERS, 1995, 56 (01) : 45 - 49
[34] Vietoris–Rips Complexes of Planar Point Sets
Erin W. Chambers
Vin de Silva
Jeff Erickson
Robert Ghrist
Discrete & Computational Geometry, 2010, 44 : 75 - 90
[35] A note on universal point sets for planar graphs
Scheucher M.
Schrezenmaier H.
Steiner R.
Journal of Graph Algorithms and Applications, 2020, 24 (03) : 247 - 267
[36] COUNTABILITY OF POINT-FINITE FAMILIES OF SETS
JUNNILA, HJK
CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES, 1979, 31 (04): : 673 - 679
[37] The number of crossing free configurations on finite point sets in the plane
Welzl, Emo
FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, Proceedings, 2006, 4337 : 20 - 20
[38] The polytope of non-crossing graphs on a planar point set
Orden, D
Santos, F
DISCRETE & COMPUTATIONAL GEOMETRY, 2005, 33 (02) : 275 - 305
[39] Point sets with many non-crossing perfect matchings
Asinowski, Andrei
Rote, Guenter
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2018, 68 : 7 - 33
[40] The Polytope of Non-Crossing Graphs on a Planar Point Set
David Orden
Francisco Santos
Discrete & Computational Geometry, 2005, 33 : 275 - 305

← 1 2 3 4 5 →