2009 |
15 | EE | Lilian Buzer:
Optimal simplification of polygonal chains for subpixel-accurate rendering.
Comput. Geom. 42(1): 45-59 (2009) |
2008 |
14 | EE | Yukiko Kenmochi,
Lilian Buzer,
Akihiro Sugimoto,
Ikuko Shimizu:
Digital Planar Surface Segmentation Using Local Geometric Patterns.
DGCI 2008: 322-333 |
13 | EE | Emilie Charrier,
Lilian Buzer:
An Efficient and Quasi Linear Worst-Case Time Algorithm for Digital Plane Recognition.
DGCI 2008: 346-357 |
12 | EE | Emilie Charrier,
Lilian Buzer:
Reducing the Coefficients of a Two-Dimensional Integer Linear Constraint.
IWCIA 2008: 205-216 |
2007 |
11 | EE | Lilian Buzer:
Optimal simplification of polygonal chain for rendering.
Symposium on Computational Geometry 2007: 168-174 |
10 | EE | Lilian Buzer:
A simple algorithm for digital line recognition in the general case.
Pattern Recognition 40(6): 1675-1684 (2007) |
2006 |
9 | EE | Lilian Buzer:
A Composite and Quasi Linear Time Method for Digital Plane Recognition.
DGCI 2006: 331-342 |
8 | EE | Laurent Provot,
Lilian Buzer,
Isabelle Debled-Rennesson:
Recognition of Blurred Pieces of Discrete Planes.
DGCI 2006: 65-76 |
7 | EE | Lilian Buzer:
Digital Line Recognition, Convex Hull, Thickness, a Unified and Logarithmic Technique.
IWCIA 2006: 189-198 |
2005 |
6 | EE | Lilian Buzer:
The min-# problem, a hybrid error criterion for near linear time performance.
CCCG 2005: 23-26 |
5 | EE | Lilian Buzer:
Solving online feasibility problem in constant amortized time per update.
CCCG 2005: 286-289 |
4 | EE | Lilian Buzer:
An Elementary Algorithm for Digital Line Recognition in the General Case.
DGCI 2005: 299-310 |
2003 |
3 | EE | Lilian Buzer:
A linear incremental algorithm for naive and standard digital lines and planes recognition.
Graphical Models 65(1-3): 61-76 (2003) |
2002 |
2 | EE | Lilian Buzer:
An Incremental Linear Time Algorithm for Digital Line and Plane Recognition Using a Linear Incremental Feasibility Problem.
DGCI 2002: 372-381 |
1 | EE | Lilian Buzer:
A Survey and a New Competitive Method for the Planar min-# Problem
CoRR cs.CG/0209007: (2002) |