Loïc Crombez

activity

20182023

collaborators

Showing cs.CGShow all

5 papers · 1 filter

cs.CG2023

Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring

Loïc Crombez, Guilherme D. da Fonseca, Florian Fontan +8

CG:SHOP is an annual geometric optimization challenge and the 2022 edition proposed the problem of coloring a certain geometric graph defined by line segments. Surprisingly, the to…

cs.CG2021

Digital Convex + Unimodular Mapping =8-Connected (All Points but One 4-Connected)

Crombez Loïc

In two dimensional digital geometry, two lattice points are 4-connected (resp. 8-connected) if their Euclidean distance is at most one (resp. $2$ ). A set $S \subset Z^{2}$ is…

cs.CG2020

Efficient Algorithms for Battleship

Loïc Crombez, Guilherme D. da Fonseca, Yan Gerard

We consider an algorithmic problem inspired by the Battleship game. In the variant of the problem that we investigate, there is a unique ship of shape $S \subset Z^{2}$ which has bee…

cs.CG2019

Efficient Algorithms to Test Digital Convexity

Loïc Crombez, Guilherme D. da Fonseca, Yan Gérard

A set $S \subset Z^{d}$ is digital convex if $co n v (S) \cap Z^{d} = S$ , where $co n v (S)$ denotes the convex hull of $S$ . In this paper, we consider the algorithmic prob…

cs.CG2018

Peeling Digital Potatoes

Loïc Crombez, Guilherme D. da Fonseca, Yan Gérard

The potato-peeling problem (also known as convex skull) is a fundamental computational geometry problem and the fastest algorithm to date runs in $O (n^{8})$ time for a polygon with $…