default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLilian Buzer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c20]Lilian Buzer, Tristan Cazenave:
GPU for Monte Carlo Search. LION 2023: 179-193- 2021
- [c19]Lilian Buzer, Tristan Cazenave:
Playout Optimization for Monte-Carlo Search Algorithms. Application to Morpion Solitaire. CoG 2021: 1-8 - [c18]Jean Cousty, Benjamin Perret, Harold Phelippeau, Stela Carneiro, Pierre Kamlay, Lilian Buzer:
An Algebraic Framework for Out-of-Core Hierarchical Segmentation Algorithms. DGMM 2021: 378-390
2010 – 2019
- 2017
- [j9]Tetsuo Asano, Lilian Buzer, Sergey Bereg
:
A new algorithmic framework for basic problems on binary images. Discret. Appl. Math. 216: 376-392 (2017) - 2012
- [c17]Tetsuo Asano, Sergey Bereg, Lilian Buzer:
Small Work Space Algorithms for Some Basic Problems on Binary Images. IWCIA 2012: 103-114 - 2011
- [j8]Rita Zrour, Yukiko Kenmochi, Hugues Talbot, Lilian Buzer, Yskandar Hamam, Ikuko Shimizu, Akihiro Sugimoto:
Optimal consensus set for digital line and plane fitting. Int. J. Imaging Syst. Technol. 21(1): 45-57 (2011) - [j7]Emilie Charrier, Fabien Feschet, Lilian Buzer:
Computing efficiently the lattice width in any dimension. Theor. Comput. Sci. 412(36): 4814-4823 (2011) - [c16]Dror Aiger, Yukiko Kenmochi, Hugues Talbot, Lilian Buzer:
Efficient Robust Digital Hyperplane Fitting with Bounded Error. DGCI 2011: 223-234 - 2010
- [c15]Yukiko Kenmochi, Lilian Buzer, Hugues Talbot:
Efficiently Computing Optimal Consensus of Digital Line Fitting. ICPR 2010: 1064-1067
2000 – 2009
- 2009
- [j6]Lilian Buzer:
Optimal simplification of polygonal chains for subpixel-accurate rendering. Comput. Geom. 42(1): 45-59 (2009) - [j5]Emilie Charrier, Lilian Buzer:
Approximating a real number by a rational number with a limited denominator: A geometric approach. Discret. Appl. Math. 157(16): 3473-3484 (2009) - [j4]Alexandre Faure, Lilian Buzer, Fabien Feschet:
Tangential cover for thick digital curves. Pattern Recognit. 42(10): 2279-2287 (2009) - [c14]Emilie Charrier, Lilian Buzer, Fabien Feschet:
Efficient Lattice Width Computation in Arbitrary Dimension. DGCI 2009: 46-56 - [c13]Rita Zrour, Yukiko Kenmochi, Hugues Talbot, Lilian Buzer, Yskandar Hamam, Ikuko Shimizu, Akihiro Sugimoto:
Optimal consensus set for digital plane fitting. ICCV Workshops 2009: 1817-1824 - [c12]Rita Zrour, Yukiko Kenmochi, Hugues Talbot, Lilian Buzer, Yskandar Hamam, Ikuko Shimizu, Akihiro Sugimoto:
Optimal Consensus Set for Digital Line Fitting. IWCIA Special Track on Applications 2009: 93-105 - 2008
- [j3]Yukiko Kenmochi, Lilian Buzer, Akihiro Sugimoto, Ikuko Shimizu:
Discrete plane segmentation and estimation from a point cloud using local geometric patterns. Int. J. Autom. Comput. 5(3): 246-256 (2008) - [c11]Yukiko Kenmochi, Lilian Buzer, Akihiro Sugimoto, Ikuko Shimizu:
Digital Planar Surface Segmentation Using Local Geometric Patterns. DGCI 2008: 322-333 - [c10]Emilie Charrier, Lilian Buzer:
An Efficient and Quasi Linear Worst-Case Time Algorithm for Digital Plane Recognition. DGCI 2008: 346-357 - [c9]Emilie Charrier, Lilian Buzer:
Reducing the Coefficients of a Two-Dimensional Integer Linear Constraint. IWCIA 2008: 205-216 - 2007
- [j2]Lilian Buzer:
A simple algorithm for digital line recognition in the general case. Pattern Recognit. 40(6): 1675-1684 (2007) - [c8]Lilian Buzer:
Optimal simplification of polygonal chain for rendering. SCG 2007: 168-174 - 2006
- [c7]Laurent Provot, Lilian Buzer, Isabelle Debled-Rennesson:
Recognition of Blurred Pieces of Discrete Planes. DGCI 2006: 65-76 - [c6]Lilian Buzer:
A Composite and Quasi Linear Time Method for Digital Plane Recognition. DGCI 2006: 331-342 - [c5]Lilian Buzer:
Digital Line Recognition, Convex Hull, Thickness, a Unified and Logarithmic Technique. IWCIA 2006: 189-198 - 2005
- [c4]Lilian Buzer:
The min-# problem, a hybrid error criterion for near linear time performance. CCCG 2005: 23-26 - [c3]Lilian Buzer:
Solving online feasibility problem in constant amortized time per update. CCCG 2005: 286-289 - [c2]Lilian Buzer:
An Elementary Algorithm for Digital Line Recognition in the General Case. DGCI 2005: 299-310 - 2003
- [j1]Lilian Buzer:
A linear incremental algorithm for naive and standard digital lines and planes recognition. Graph. Model. 65(1-3): 61-76 (2003) - 2002
- [c1]Lilian Buzer:
An Incremental Linear Time Algorithm for Digital Line and Plane Recognition Using a Linear Incremental Feasibility Problem. DGCI 2002: 372-381
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
