arXiv cs/07010452007-01-16cs.CGcs.DS

Polygon Convexity: Another O(n) Test

Iosif Pinelis

备注：: 14 pages; changes: (i) a test for non-strict convexity is added; (ii) the proofs are gathered in a separate section; (iii) a more detailed abstract is given

英文摘要：

An n-gon is defined as a sequence ¶=(V_0,...,V_{n-1}) of n points on the plane. An n-gon ¶is said to be convex if the boundary of the convex hull of the set {V_0,...,V_{n-1}} of the vertices of ¶coincides with the union of the edges [V_0,V_1],...,[V_{n-1},V_0]; if at that no three vertices of ¶are collinear then ¶is called strictly convex. We prove that an n-gon ¶with n\ge3 is strictly convex if and only if a cyclic shift of the sequence (\al_0,...,\al_{n-1})\in[0,2π)^n of the angles between the x-axis and the vectors V_1-V_0,...,V_0-V_{n-1} is strictly monotone. A ``non-strict'' version of this result is also proved.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Polygon Convexity: A Minimal O(n) Test

An O(n) test for polygon convexity is stated and proved. It is also proved that the test is minimal in a certain exact sense.

2006-09-25cs.CCcs.CGmath.CO

A bound on a convexity measure for point sets

A planar point set is in convex position precisely when it has a convex polygonization, that is, a polygonization with maximum interior angle measure at most π. We can thus talk about the convexity of a set of points in terms of the minimum, taken over all polygonizations, of the maximum interior angle. The main result presented here is a nontrivial combinatorial upper bound of this min-max value in terms of the number of points in the set. Motivated by a particular construction, we also pose a natural conjecture for the best upper bound.

2014-09-15cs.CGmath.CO

Degree of Convexity and Expected Distances in Polygons

We present an algorithm for computing the so-called Beer-index of a polygon $P$ in $O(n^2)$ time, where $n$ is the number of corners. The polygon $P$ may have holes. The Beer-index is the probability that two points chosen independently and uniformly at random in $P$ can see each other. Given a finite set $M$ of $m$ points in a simple polygon $P$, we also show how the number of pairs in $M$ that see each other can be computed in $O(n\log n+m^{4/3}\log^αm\log n)$ time, where $α<1.78$ is a constant. We likewise study the problem of computing the expected geodesic distance between two points chos…

2022-10-29cs.CGmath.MG

Sibley的守卫点凸性度量：一个周长反例和一个支配界

Sibley's Guard-Point Convexity Measure: A Perimeter Counterexample and a Dominance Bound

本文研究简单多边形的Sibley守卫点凸性度量，通过构造一个非凸五边形反例否定点态周长不等式，并证明均匀界G(F) ≤ 2P(F)。

2026-08-04cs.CG

On k-Convex Polygons

We introduce a notion of $k$-convexity and explore polygons in the plane that have this property. Polygons which are \mbox{$k$-convex} can be triangulated with fast yet simple algorithms. However, recognizing them in general is a 3SUM-hard problem. We give a characterization of \mbox{$2$-convex} polygons, a particularly interesting class, and show how to recognize them in \mbox{$O(n \log n)$} time. A description of their shape is given as well, which leads to Erdős-Szekeres type results regarding subconfigurations of their vertex sets. Finally, we introduce the concept of generalized geometric…

2010-07-21cs.CGmath.CO

A Geometric Structure Associated with the Convex Polygon

We propose a geometric structure induced by any given convex polygon $P$, called $Nest(P)$, which is an arrangement of $Θ(n^2)$ line segments, each of which is parallel to an edge of $P$, where $n$ denotes the number of edges of $P$. We then deduce six nontrivial properties of $Nest(P)$ from the convexity of $P$ and the parallelism of the line segments in $Nest(P)$. Among others, we show that $Nest(P)$ is a subdivision of the exterior of $P$, and its inner boundary interleaves the boundary of $P$. They manifest that $Nest(P)$ has a surprisingly good interaction with the boundary of $P$. Furthe…

2019-07-11cs.CG

更多相关论文收起更多论文

Greedy and Local Search Heuristics to Build Area-Optimal Polygons

In this paper, we present our heuristic solutions to the problems of finding the maximum and minimum area polygons with a given set of vertices. Our solutions are based mostly on two simple algorithmic paradigms: greedy method and local search. The greedy heuristic starts with a simple polygon and adds vertices one by one, according to a weight function. A crucial ingredient to obtain good solutions is the choice of an appropriate weight function that avoids long edges. The local search part consists of moving consecutive vertices to another location in the polygonal chain. We also discuss the…

2021-06-28cs.CG

用最少顶点数界定一个多边形

Bounding a Polygon by a Minimum Number of Vertices

该研究针对按逆时针顶点数组给出的多边形，分析界定其范围所需的最少顶点数，得出上界为$4\log_2 n+O(1)$、下界为$\log_3n-o(\log n)$的结论，在常数因子内解决问题，可用于分析多边形相关算法的最佳运行时间。

2025-09-04cs.CG

A Novel Point Inclusion Test for Convex Polygons Based on Voronoi Tessellations

The point inclusion tests for polygons, in other words the point-in-polygon (PIP) algorithms, are fundamental tools for many scientific fields related to computational geometry, and they have been studied for a long time. The PIP algorithms get direct or indirect geometric definition of a polygonal entity, and validate its containment of a given point. The PIP algorithms, which are working directly on the geometric entities, derive linear boundary definitions for the edges of the polygons. Moreover, almost all direct test methods rely on the two-point form of the line equation to partition the…

2021-01-13cs.CG

Range-efficient consistent sampling and locality-sensitive hashing for polygons

Locality-sensitive hashing (LSH) is a fundamental technique for similarity search and similarity estimation in high-dimensional spaces. The basic idea is that similar objects should produce hash collisions with probability significantly larger than objects with low similarity. We consider LSH for objects that can be represented as point sets in either one or two dimensions. To make the point sets finite size we consider the subset of points on a grid. Directly applying LSH (e.g. min-wise hashing) to these point sets would require time proportional to the number of points. We seek to achieve ti…

2017-09-22cs.CG

New Hardness Results for Guarding Orthogonal Polygons with Sliding Cameras

Let $P$ be an orthogonal polygon. Consider a sliding camera that travels back and forth along an orthogonal line segment $s\in P$ as its \emph{trajectory}. The camera can see a point $p\in P$ if there exists a point $q\in s$ such that $pq$ is a line segment normal to $s$ that is completely inside $P$. In the \emph{minimum-cardinality sliding cameras problem}, the objective is to find a set $S$ of sliding cameras of minimum cardinality to guard $P$ (i.e., every point in $P$ can be seen by some sliding camera) while in the \emph{minimum-length sliding cameras problem} the goal is to find such a …

2013-03-09cs.CG

On the Expected Complexity of Random Convex Hulls

In this paper we present several results on the expected complexity of a convex hull of $n$ points chosen uniformly and independently from a convex shape. (i) We show that the expected number of vertices of the convex hull of $n$ points, chosen uniformly and independently from a disk is $O(n^{1/3})$, and $O(k \log{n})$ for the case a convex polygon with $k$ sides. Those results are well known (see \cite{rs-udkhv-63,r-slcdn-70,ps-cgi-85}), but we believe that the elementary proof given here are simpler and more intuitive. (ii) Let $\D$ be a set of directions in the plane, we define a generalize…

2011-11-22cs.CG

Flipturning polygons

A flipturn is an operation that transforms a nonconvex simple polygon into another simple polygon, by rotating a concavity 180 degrees around the midpoint of its bounding convex hull edge. Joss and Shannon proved in 1973 that a sequence of flipturns eventually transforms any simple polygon into a convex polygon. This paper describes several new results about such flipturn sequences. We show that any orthogonal polygon is convexified after at most n-5 arbitrary flipturns, or at most 5(n-4)/6 well-chosen flipturns, improving the previously best upper bound of (n-1)!/2. We also show that any simp…

2000-08-16cs.CGcs.DMmath.MG

Counting large distances in convex polygons

In a convex n-gon, let d[1] > d[2] > ... denote the set of all distances between pairs of vertices, and let m[i] be the number of pairs of vertices at distance d[i] from one another. Erdos, Lovasz, and Vesztergombi conjectured that m[1] + ... + m[k] <= k*n. Using a new computational approach, we prove their conjecture when k <= 4 and n is large; we also make some progress for arbitrary k by proving that m[1] + ... + m[k] <= (2k-1)n. Our main approach revolves around a few known facts about distances, together with a computer program that searches all distance configurations of two disjoint con…

2011-07-29cs.CGmath.CO

凸多边形三角剖分的翻转距离 / 二叉树的旋转距离是NP难的

Flip Distance Between Triangulations of Convex Polygons is NP-Complete

Graz University of Technology（格拉茨工业大学）

研究证明凸多边形三角剖分的翻转距离和二叉树的旋转距离问题均为NP难问题。

2026-07-28cs.CCcs.CGcs.DM

动态简单多边形中的最近邻搜索

Nearest Neighbor Searching in a Dynamic Simple Polygon

研究动态简单多边形中的最近邻问题，允许插入点站点和扩展多边形边界，提出首个支持域更新的近线性空间、次线性查询与更新时间的最近邻数据结构。

2025-03-05cs.CG

Implementing Simulation of Simplicity for geometric degeneracies

We describe how to implement Simulation of Simplicity (SoS). SoS removes geometric degeneracies in point-in-polygon queries, polyhedron intersection, map overlay, and other 2D and 3D geometric and spatial algorithms by determining the effect of adding non-Archimedian infinitesimals of different orders to the coordinates. Then it modifies the geometric predicates to emulate that, and evaluates them in the usual arithmetic. A geometric degeneracy is a coincidence, such as a vertex of one polygon on an edge of another polygon, that would have probability approaching zero if the objects were distr…

2022-12-16cs.CG

An Algorithm for Finding Convex Hulls of Planar Point Sets

This paper presents an alternate choice of computing the convex hulls (CHs) for planar point sets. We firstly discard the interior points and then sort the remaining vertices by x- / y- coordinates separately, and later create a group ofquadrilaterals (e-Quads) recursively according to the sequences ofthe sorted lists of points. Finally, the desired CH is built based on a simple polygon derived from all e-Quads. Besides the preprocessing for original planar point sets, this algorithm has another mechanism of discarding interior point when form e-Quads and assemble the simple polygon. Compared …

2012-12-25cs.CG

Relative Convex Hull Determination from Convex Hulls in the Plane

A new algorithm for the determination of the relative convex hull in the plane of a simple polygon A with respect to another simple polygon B which contains A, is proposed. The relative convex hull is also known as geodesic convex hull, and the problem of its determination in the plane is equivalent to find the shortest curve among all Jordan curves lying in the difference set of B and A and encircling A. Algorithms solving this problem known from Computational Geometry are based on the triangulation or similar decomposition of that difference set. The algorithm presented here does not use suc…

2016-04-29cs.CG