Skip Navigation

The Computer Journal 1990 33(5):424-428; doi:10.1093/comjnl/33.5.424
© 1990 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Dehne, F.
Right arrow Articles by Ficocelli, L.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

An Efficient Computational Geometry Method for Detecting Dotted Lines in Noisy Images

F. Dehne1 * and L. Ficocelli2 §

1 School of Computer Science, Carleton University, Ottawa, Ontario, Canada K1S 5B6, 2 Grande Prairie Regional College, Grande Prairie, Alberta, Canada T8V 4C4

In this paper we present an efficient O(n log n) time, linear space, algorithm for detecting a line, or line segment, represented by a set of nL collinear points contained in a rectangular window with an additional set of nN independent, uniformly distributed random noise points; n=nL+nN. Empirical results show that the algorithm is very reliable for nL/nN>=1/3.

Received January 1989. revised April 1989.

* School of Computer Science, Carleton University, Ottawa, Ontario, Canada K1S 5B6

§ Grande Prairie Regional College, Grande Prairie, Alberta, Canada T8V 4C4


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.