Lilian Buzer

29 papers B 1C 4Journal 9Unranked 15
YearRankTypeTitle / Venue / Authors
2023 — conf
GPU for Monte Carlo Search.
LION
Lilian Buzer, Tristan Cazenave
2021 — conf
An Algebraic Framework for Out-of-Core Hierarchical Segmentation Algorithms.
DGMM
Jean Cousty, Benjamin Perret, Harold Phelippeau, Stela Carneiro, Pierre Kamlay, Lilian Buzer
2021 C conf
Playout Optimization for Monte-Carlo Search Algorithms. Application to Morpion Solitaire.
CoG
Lilian Buzer, Tristan Cazenave
2017 J jnl
A new algorithmic framework for basic problems on binary images.
Discret. Appl. Math.
Tetsuo Asano, Lilian Buzer, Sergey Bereg
2012 C conf
Small Work Space Algorithms for Some Basic Problems on Binary Images.
IWCIA
Tetsuo Asano, Sergey Bereg, Lilian Buzer
2011 J jnl
Computing efficiently the lattice width in any dimension.
Theor. Comput. Sci.
Emilie Charrier, Fabien Feschet, Lilian Buzer
2011 — conf
Efficient Robust Digital Hyperplane Fitting with Bounded Error.
DGCI
Dror Aiger, Yukiko Kenmochi, Hugues Talbot, Lilian Buzer
2011 J jnl
Optimal consensus set for digital line and plane fitting.
Int. J. Imaging Syst. Technol.
Rita Zrour, Yukiko Kenmochi, Hugues Talbot, Lilian Buzer, Yskandar Hamam, Ikuko Shimizu, Akihiro Sugimoto
2010 B conf
Efficiently Computing Optimal Consensus of Digital Line Fitting.
ICPR
Yukiko Kenmochi, Lilian Buzer, Hugues Talbot
2009 J jnl
Approximating a real number by a rational number with a limited denominator: A geometric approach.
Discret. Appl. Math.
Emilie Charrier, Lilian Buzer
2009 — conf
Efficient Lattice Width Computation in Arbitrary Dimension.
DGCI
Emilie Charrier, Lilian Buzer, Fabien Feschet
2009 — conf
Optimal Consensus Set for Digital Line Fitting.
IWCIA Special Track on Applications
Rita Zrour, Yukiko Kenmochi, Hugues Talbot, Lilian Buzer, Yskandar Hamam, Ikuko Shimizu, Akihiro Sugimoto
2009 — conf
Optimal consensus set for digital plane fitting.
ICCV Workshops
Rita Zrour, Yukiko Kenmochi, Hugues Talbot, Lilian Buzer, Yskandar Hamam, Ikuko Shimizu, Akihiro Sugimoto
2009 J jnl
Optimal simplification of polygonal chains for subpixel-accurate rendering.
Comput. Geom.
Lilian Buzer
2009 J jnl
Tangential cover for thick digital curves.
Pattern Recognit.
Alexandre Faure, Lilian Buzer, Fabien Feschet
2008 — conf
An Efficient and Quasi Linear Worst-Case Time Algorithm for Digital Plane Recognition.
DGCI
Emilie Charrier, Lilian Buzer
2008 — conf
Digital Planar Surface Segmentation Using Local Geometric Patterns.
DGCI
Yukiko Kenmochi, Lilian Buzer, Akihiro Sugimoto, Ikuko Shimizu
2008 J jnl
Discrete plane segmentation and estimation from a point cloud using local geometric patterns.
Int. J. Autom. Comput.
Yukiko Kenmochi, Lilian Buzer, Akihiro Sugimoto, Ikuko Shimizu
2008 C conf
Reducing the Coefficients of a Two-Dimensional Integer Linear Constraint.
IWCIA
Emilie Charrier, Lilian Buzer
2007 J jnl
A simple algorithm for digital line recognition in the general case.
Pattern Recognit.
Lilian Buzer
2007 — conf
Optimal simplification of polygonal chain for rendering.
SCG
Lilian Buzer
2006 — conf
A Composite and Quasi Linear Time Method for Digital Plane Recognition.
DGCI
Lilian Buzer
2006 C conf
Digital Line Recognition, Convex Hull, Thickness, a Unified and Logarithmic Technique.
IWCIA
Lilian Buzer
2006 — conf
Recognition of Blurred Pieces of Discrete Planes.
DGCI
Laurent Provot, Lilian Buzer, Isabelle Debled-Rennesson
2005 — conf
An Elementary Algorithm for Digital Line Recognition in the General Case.
DGCI
Lilian Buzer
2005 — conf
Solving online feasibility problem in constant amortized time per update.
CCCG
Lilian Buzer
2005 — conf
The min-# problem, a hybrid error criterion for near linear time performance.
CCCG
Lilian Buzer
2003 J jnl
A linear incremental algorithm for naive and standard digital lines and planes recognition.
Graph. Model.
Lilian Buzer
2002 — conf
An Incremental Linear Time Algorithm for Digital Line and Plane Recognition Using a Linear Incremental Feasibility Problem.
DGCI
Lilian Buzer