Volume 27December 2022Current IssueIssue-in-Progress
SSLC: A Search Algorithm Based on Linear Collisions and Poisson Probability Distribution
December 2022, Article No.: 1.4, pp 1–15https://doi.org/10.1145/3497876

This article proposes an algorithm, sequential search based on linear collisions (SSLC), based on Poisson probability distribution. SSLC works on large static volumes of data, whose keys are ordered and uniformly distributed. We proved that it takes a ...

Binary Fuse Filters: Fast and Smaller Than Xor Filters
December 2022, Article No.: 1.5, pp 1–15https://doi.org/10.1145/3510449

Bloom and cuckoo filters provide fast approximate set membership while using little memory. Engineers use them to avoid expensive disk and network accesses. The recently introduced xor filters can be faster and smaller than Bloom and cuckoo filters. The ...

SECTION: Special Issue on Computational Geometry

Greedy and Local Search Heuristics to Build Area-Optimal Polygons
December 2022, Article No.: 2.2, pp 1–11https://doi.org/10.1145/3503999

In this article, 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 and local search. The greedy ...

Area Optimal Polygonization Using Simulated Annealing
December 2022, Article No.: 2.3, pp 1–17https://doi.org/10.1145/3500911

We describe a practical method to find near-optimal solutions for the area-optimal simple polygonization problem: Given a set of points S in the plane, the objective is to find a simple polygon of minimum or maximum area defined by S. Our approach is ...

Open Access
Area-Optimal Simple Polygonalizations: The CG Challenge 2019
December 2022, Article No.: 2.4, pp 1–12https://doi.org/10.1145/3504000

We give an overview of theoretical and practical aspects of finding a simple polygon of minimum (Min-Area) or maximum (Max-Area) possible area for a given set of n points in the plane. Both problems are known to be NP-hard and were the subject of the 2019 ...

Open Access
2-Opt Moves and Flips for Area-optimal Polygonizations
December 2022, Article No.: 2.7, pp 1–12https://doi.org/10.1145/3500913

Our work on the Computational Geometry Challenge 2019 on area-optimal polygonizations is based on two key components: (1) sampling the search space to obtain initial polygonizations and (2) optimizing such a polygonizations. Among other heuristics for ...


Currently Not Available icon

Currently Not Available


About Cookies On This Site

We use cookies to ensure that we give you the best experience on our website.

Learn more

Got it!