Separating Geometric Data with Minimum Cost: Two Disjoint Convex Hulls

06/18/2021
by   Bahram Sadeghi Bigham, et al.
0

In this study, a geometric version of an NP-hard problem ("Almost 2-SAT" problem) is introduced which has potential applications in clustering, separation axis, binary sensor networks, shape separation, image processing, etc. Furthermore, it has been illustrated that the new problem known as "Two Disjoint Convex Hulls" can be solved in polynomial time due to some combinatorial aspects and geometric properties. For this purpose, an O(n^2) algorithm has also been presented which employs the Separating Axis Theorem (SAT) and the duality of points/lines.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/05/2021

Linking disjoint axis-parallel segments into a simple polygon is hard too

Deciding whether a family of disjoint axis-parallel line segments in the...
research
03/07/2019

An Experimental Study of Forbidden Patterns in Geometric Permutations by Combinatorial Lifting

We study the problem of deciding if a given triple of permutations can b...
research
10/02/2017

On the Parameterized Complexity of Red-Blue Points Separation

We study the following geometric separation problem: Given a set R of ...
research
01/24/2014

Hypergraph Acyclicity and Propositional Model Counting

We show that the propositional model counting problem #SAT for CNF- form...
research
09/09/2021

Worbel: Aggregating Point Labels into Word Clouds

Point feature labeling is a classical problem in cartography and GIS tha...
research
11/24/2018

Axes-parallel unit disk graph recognition is NP-hard

Unit disk graphs are the intersection graphs of unit diameter disks in t...
research
12/14/2020

An integer programming formulation using convex polygons for the convex partition problem

A convex partition of a point set P in the plane is a planar partition o...

Please sign up or login with your details

Forgot password? Click here to reset