The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Lilian Buzer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Lilian Buzer
    Solving online feasibility problem in constant amortized time per update. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:286-289 [Conf]
  3. Lilian Buzer
    Optimal simplification of polygonal chain for rendering. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:168-174 [Conf]
  4. 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]
  5. Lilian Buzer
    An Elementary Algorithm for Digital Line Recognition in the General Case. [Citation Graph (0, 0)][DBLP]
    DGCI, 2005, pp:299-310 [Conf]
  6. Lilian Buzer
    A Composite and Quasi Linear Time Method for Digital Plane Recognition. [Citation Graph (0, 0)][DBLP]
    DGCI, 2006, pp:331-342 [Conf]
  7. Laurent Provot, Lilian Buzer, Isabelle Debled-Rennesson
    Recognition of Blurred Pieces of Discrete Planes. [Citation Graph (0, 0)][DBLP]
    DGCI, 2006, pp:65-76 [Conf]
  8. Lilian Buzer
    Digital Line Recognition, Convex Hull, Thickness, a Unified and Logarithmic Technique. [Citation Graph (0, 0)][DBLP]
    IWCIA, 2006, pp:189-198 [Conf]
  9. Lilian Buzer
    A Survey and a New Competitive Method for the Planar min-# Problem [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  10. 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]
  11. 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]

  12. Digital Planar Surface Segmentation Using Local Geometric Patterns. [Citation Graph (, )][DBLP]


  13. An Efficient and Quasi Linear Worst-Case Time Algorithm for Digital Plane Recognition. [Citation Graph (, )][DBLP]


  14. Efficient Lattice Width Computation in Arbitrary Dimension. [Citation Graph (, )][DBLP]


  15. Reducing the Coefficients of a Two-Dimensional Integer Linear Constraint. [Citation Graph (, )][DBLP]


  16. Optimal simplification of polygonal chains for subpixel-accurate rendering. [Citation Graph (, )][DBLP]


  17. Approximating a real number by a rational number with a limited denominator: A geometric approach. [Citation Graph (, )][DBLP]


Search in 0.001secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002