PARADIS

Dec 1, 2018
website
Heterogenous data

Consortium

This project gathers members of three laboratories: LIRIS (Leader, Lyon), LAMA (Chambéry), LaBRI (Bordeaux).

plane probing digital geometry arithmetic computational geometry 3D tangential cover
Jacques-Olivier Lachaud
Jacques-Olivier Lachaud
Professor of Computer Science

My research interests include digital geometry, geometry processing, image analysis, variational models and discrete calculus.

Publications

Delaunay property and proximity results of the L-algorithm for digital plane probing
When processing the geometry of digital surfaces (boundaries of voxel sets), linear local structures such as pieces of digital planes …
Jui-Ting Lu, Tristan Roussillon, Jacques-Olivier Lachaud, David Coeurjolly
PDF Cite Project DOI URL
Delaunay property and proximity results of the L-algorithm for digital plane probing
An Optimized Framework for Plane-Probing Algorithms
A plane-probing algorithm computes the normal vector of a digital plane from a starting point and a predicate ``Is a point x in the …
Jacques-Olivier Lachaud, Jocelyn Meyron, Tristan Roussillon
PDF Cite Project Project DOI Code (DGtal) URL
An Optimized Framework for Plane-Probing Algorithms
Digital Plane Recognition with Fewer Probes
We present a new plane-probing algorithm, i.e., an algorithm that computes the normal vector of a digital plane from a starting point …
T. Roussillon, Jacques-Olivier Lachaud
PDF Cite Project Project DOI URL
Digital Plane Recognition with Fewer Probes
Two Plane-Probing Algorithms for the Computation of the Normal Vector to a Digital Plane
Digital planes are sets of integer points located between two parallel planes. We present a new algorithm that computes the normal …
Jacques-Olivier Lachaud, X. Provençal, T. Roussillon
PDF Cite Project Project DOI
Two Plane-Probing Algorithms for the Computation of the Normal Vector to a Digital Plane