3 citations · 4 across the 4 of their papers we have counts for
6 papers
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…
Greedy and Local Search Heuristics to Build Area-Optimal Polygons
Loïc Crombez, Guilherme D. da Fonseca, Yan Gerard
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 t…
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. ). A set is…
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 which has bee…
Efficient Algorithms to Test Digital Convexity
Loïc Crombez, Guilherme D. da Fonseca, Yan Gérard
A set is digital convex if , where denotes the convex hull of . In this paper, we consider the algorithmic prob…
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 time for a polygon with $…