3 citations · 4 across the 4 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.CG2021★ 3 cited
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…
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. ). A set is…