A linear incremental algorithm for naive and standard digital lines and planes recognition-Reference-Cited by-同舟云学术

A linear incremental algorithm for naive and standard digital lines and planes recognition

Published:2003-05 Issue:1-3 Volume:65 Page:61-76
ISSN:1524-0703
Container-title:Graphical Models
language:en
Short-container-title:Graphical Models

Author:

Buzer Lilian

Publisher

Elsevier BV

Subject

Computer Graphics and Computer-Aided Design,Geometry and Topology,Modelling and Simulation,Software

Reference14 articles.

1. Efficient algorithms for geometric optimization;Agarwal;ACM Comput. Surveys,1998

2. Computational Geometry: Algorithms and Applications;de Berg,2000

3. Linear programming in O(n.23.d2) time;Clarkson;Inform. Process. Lett.,1986

4. K.L. Clarkson, A Las Vegas algorithm for linear programming when the dimension is small, in: Proceedings of the 29th Annual IEEE Symposium on Foundational Computer Science, 1998, pp. 452–456

5. A linear algorithm for segmentation of digital curves;Debled-Rennesson;Internat. J. Pattern Recognition Artificial Intell.,1995

Cited by 21 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Delaunay property and proximity results of the L-algorithm for digital plane probing;Theoretical Computer Science;2024-10

2. An Alternative Definition for Digital Convexity;Journal of Mathematical Imaging and Vision;2022-04-11

3. Discrete Linear Geometry on Grid System;SN Computer Science;2021-11-19

4. Discrete Linear Geometry on Non-square Grid;Communications in Computer and Information Science;2021

5. An Optimized Framework for Plane-Probing Algorithms;Journal of Mathematical Imaging and Vision;2020-06