2 papers
cs.CG2026
How to~Peel Fully Convex Digital Sets
Fabien Feschet, Jacques-Olivier Lachaud
Full convexity is an interesting alternative to classical digital convexity since it guarantees connectedness and even simple connectedness in digital spaces Z d , for any dimensio…
cs.CG2026
Fast and exact visibility on digitized shapes and application to saliency-aware normal estimation
Romain Negro, Jacques-Olivier Lachaud
Computing visibility on a geometric object requires heavy computations since it requires to identify pairs of points that are visible to each other, i.e. there is a straight segmen…