Year: 2026
Type: article
Abstract: Let 𝑆 be a set of 𝑛 points in the Euclidean plane and general position i.e., no three points are collinear. An at most 𝑘 -out polygon of 𝑆 is a simple polygon such that each vertex is a point in 𝑆 and there are at most 𝑘 points outside the polygon. In this paper, we consider the problem of enumerating all the at most 𝑘 -out polygon of 𝑆 . We propose a new enumeration algorithm for the at most 𝑘 -out polygons of a point set. Our algorithm enumerates all the at most 𝑘 -out polygons in 𝒪 ( 𝑛 2 l o g 𝑛 ) delay, while the running time of an existing algorithm is 𝒪 ( 𝑛 3 l o g 𝑛 ) delay.
Source: Discrete Applied Mathematics
Authors: Waseem Akram, Katsuhisa Yamanaka
Institutions: The University of Tokyo, Iwate University
Language: English
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $3,090
OpenAlex ID: W4415316396
