Lilian Buzer The min-# problem, a hybrid error criterion for near linear time performance. [Citation Graph (0, 0)][DBLP] CCCG, 2005, pp:23-26 [Conf]
Lilian Buzer Solving online feasibility problem in constant amortized time per update. [Citation Graph (0, 0)][DBLP] CCCG, 2005, pp:286-289 [Conf]
Lilian Buzer Optimal simplification of polygonal chain for rendering. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2007, pp:168-174 [Conf]
Lilian Buzer An Incremental Linear Time Algorithm for Digital Line and Plane Recognition Using a Linear Incremental Feasibility Problem. [Citation Graph (0, 0)][DBLP] DGCI, 2002, pp:372-381 [Conf]
Lilian Buzer An Elementary Algorithm for Digital Line Recognition in the General Case. [Citation Graph (0, 0)][DBLP] DGCI, 2005, pp:299-310 [Conf]
Lilian Buzer A Composite and Quasi Linear Time Method for Digital Plane Recognition. [Citation Graph (0, 0)][DBLP] DGCI, 2006, pp:331-342 [Conf]
Lilian Buzer A linear incremental algorithm for naive and standard digital lines and planes recognition. [Citation Graph (0, 0)][DBLP] Graphical Models, 2003, v:65, n:1-3, pp:61-76 [Journal]
Lilian Buzer A simple algorithm for digital line recognition in the general case. [Citation Graph (0, 0)][DBLP] Pattern Recognition, 2007, v:40, n:6, pp:1675-1684 [Journal]
Digital Planar Surface Segmentation Using Local Geometric Patterns. [Citation Graph (, )][DBLP]
An Efficient and Quasi Linear Worst-Case Time Algorithm for Digital Plane Recognition. [Citation Graph (, )][DBLP]